/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 16:11:12,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 16:11:12,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 16:11:12,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 16:11:12,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 16:11:12,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 16:11:12,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 16:11:12,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 16:11:12,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 16:11:12,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 16:11:12,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 16:11:12,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 16:11:12,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 16:11:12,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 16:11:12,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 16:11:12,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 16:11:12,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 16:11:12,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 16:11:12,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 16:11:12,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 16:11:12,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 16:11:12,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 16:11:12,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 16:11:12,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 16:11:12,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 16:11:12,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 16:11:12,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 16:11:12,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 16:11:12,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 16:11:12,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 16:11:12,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 16:11:12,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 16:11:12,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 16:11:12,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 16:11:12,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 16:11:12,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 16:11:12,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 16:11:12,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 16:11:12,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 16:11:12,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 16:11:12,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 16:11:12,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 16:11:12,392 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 16:11:12,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 16:11:12,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 16:11:12,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 16:11:12,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 16:11:12,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 16:11:12,396 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 16:11:12,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 16:11:12,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 16:11:12,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 16:11:12,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 16:11:12,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 16:11:12,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 16:11:12,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 16:11:12,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 16:11:12,397 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 16:11:12,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 16:11:12,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 16:11:12,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 16:11:12,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 16:11:12,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 16:11:12,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 16:11:12,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 16:11:12,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 16:11:12,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 16:11:12,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 16:11:12,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 16:11:12,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 16:11:12,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 16:11:12,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 16:11:12,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-12 16:11:12,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 16:11:12,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 16:11:12,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 16:11:12,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 16:11:12,731 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 16:11:12,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2022-12-12 16:11:13,830 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 16:11:14,014 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 16:11:14,015 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2022-12-12 16:11:14,023 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eae802f7/c32f82ff2fe3453e929091fbb83d778c/FLAG7977e619d [2022-12-12 16:11:14,037 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eae802f7/c32f82ff2fe3453e929091fbb83d778c [2022-12-12 16:11:14,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 16:11:14,040 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 16:11:14,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 16:11:14,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 16:11:14,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 16:11:14,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ca12f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14, skipping insertion in model container [2022-12-12 16:11:14,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 16:11:14,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 16:11:14,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:11:14,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:11:14,262 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-12-12 16:11:14,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 16:11:14,288 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 16:11:14,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 16:11:14,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 16:11:14,328 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2533,2546] [2022-12-12 16:11:14,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 16:11:14,343 INFO L208 MainTranslator]: Completed translation [2022-12-12 16:11:14,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14 WrapperNode [2022-12-12 16:11:14,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 16:11:14,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 16:11:14,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 16:11:14,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 16:11:14,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,404 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 225 [2022-12-12 16:11:14,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 16:11:14,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 16:11:14,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 16:11:14,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 16:11:14,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 16:11:14,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 16:11:14,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 16:11:14,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 16:11:14,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (1/1) ... [2022-12-12 16:11:14,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 16:11:14,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:14,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 16:11:14,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 16:11:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 16:11:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 16:11:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 16:11:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 16:11:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 16:11:14,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 16:11:14,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 16:11:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 16:11:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 16:11:14,527 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 16:11:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 16:11:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 16:11:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 16:11:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 16:11:14,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 16:11:14,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 16:11:14,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 16:11:14,529 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 16:11:14,615 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 16:11:14,617 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 16:11:14,989 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 16:11:15,126 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 16:11:15,126 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 16:11:15,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 04:11:15 BoogieIcfgContainer [2022-12-12 16:11:15,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 16:11:15,131 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 16:11:15,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 16:11:15,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 16:11:15,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 04:11:14" (1/3) ... [2022-12-12 16:11:15,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742b2f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 04:11:15, skipping insertion in model container [2022-12-12 16:11:15,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 04:11:14" (2/3) ... [2022-12-12 16:11:15,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742b2f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 04:11:15, skipping insertion in model container [2022-12-12 16:11:15,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 04:11:15" (3/3) ... [2022-12-12 16:11:15,136 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2022-12-12 16:11:15,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 16:11:15,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 16:11:15,152 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 16:11:15,239 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 16:11:15,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 203 transitions, 430 flow [2022-12-12 16:11:15,389 INFO L130 PetriNetUnfolder]: 18/200 cut-off events. [2022-12-12 16:11:15,389 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 16:11:15,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 200 events. 18/200 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 296 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-12 16:11:15,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 203 transitions, 430 flow [2022-12-12 16:11:15,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 190 transitions, 398 flow [2022-12-12 16:11:15,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 16:11:15,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 190 transitions, 398 flow [2022-12-12 16:11:15,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 190 transitions, 398 flow [2022-12-12 16:11:15,492 INFO L130 PetriNetUnfolder]: 18/190 cut-off events. [2022-12-12 16:11:15,493 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 16:11:15,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 18/190 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 291 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-12 16:11:15,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 190 transitions, 398 flow [2022-12-12 16:11:15,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 7140 [2022-12-12 16:11:22,725 INFO L241 LiptonReduction]: Total number of compositions: 164 [2022-12-12 16:11:22,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 16:11:22,752 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ea2a8ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 16:11:22,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 16:11:22,763 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-12 16:11:22,763 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 16:11:22,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:22,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:22,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1980545478, now seen corresponding path program 1 times [2022-12-12 16:11:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:22,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870370659] [2022-12-12 16:11:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:23,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870370659] [2022-12-12 16:11:23,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870370659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:11:23,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:11:23,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 16:11:23,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620134210] [2022-12-12 16:11:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:11:23,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 16:11:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:23,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 16:11:23,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 16:11:23,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-12 16:11:23,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:23,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:23,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-12 16:11:23,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:23,509 INFO L130 PetriNetUnfolder]: 619/873 cut-off events. [2022-12-12 16:11:23,510 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-12 16:11:23,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 873 events. 619/873 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3369 event pairs, 95 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 1491. Up to 688 conditions per place. [2022-12-12 16:11:23,518 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-12 16:11:23,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-12 16:11:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 16:11:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 16:11:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-12 16:11:23,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6538461538461539 [2022-12-12 16:11:23,532 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 70 flow. Second operand 3 states and 51 transitions. [2022-12-12 16:11:23,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 203 flow [2022-12-12 16:11:23,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 44 transitions, 181 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-12 16:11:23,538 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 84 flow [2022-12-12 16:11:23,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-12 16:11:23,544 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-12 16:11:23,544 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 84 flow [2022-12-12 16:11:23,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:23,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:23,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:23,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 16:11:23,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2108477278, now seen corresponding path program 1 times [2022-12-12 16:11:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:23,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664638561] [2022-12-12 16:11:23,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:11:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:23,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664638561] [2022-12-12 16:11:23,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664638561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 16:11:23,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 16:11:23,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 16:11:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043046355] [2022-12-12 16:11:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:11:23,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 16:11:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 16:11:23,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 16:11:23,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-12 16:11:23,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:23,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:23,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-12 16:11:23,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:23,916 INFO L130 PetriNetUnfolder]: 570/825 cut-off events. [2022-12-12 16:11:23,916 INFO L131 PetriNetUnfolder]: For 154/163 co-relation queries the response was YES. [2022-12-12 16:11:23,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 825 events. 570/825 cut-off events. For 154/163 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3290 event pairs, 318 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 372. Up to 803 conditions per place. [2022-12-12 16:11:23,921 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-12 16:11:23,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 140 flow [2022-12-12 16:11:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 16:11:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 16:11:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-12 16:11:23,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4358974358974359 [2022-12-12 16:11:23,923 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 84 flow. Second operand 3 states and 34 transitions. [2022-12-12 16:11:23,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 140 flow [2022-12-12 16:11:23,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 16:11:23,924 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 92 flow [2022-12-12 16:11:23,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2022-12-12 16:11:23,925 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-12-12 16:11:23,925 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 92 flow [2022-12-12 16:11:23,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:23,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:23,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:23,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 16:11:23,927 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:23,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:23,927 INFO L85 PathProgramCache]: Analyzing trace with hash 521122621, now seen corresponding path program 1 times [2022-12-12 16:11:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:23,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887268339] [2022-12-12 16:11:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:11:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:24,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887268339] [2022-12-12 16:11:24,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887268339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:24,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926155070] [2022-12-12 16:11:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:24,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:24,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:11:24,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 16:11:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:24,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 16:11:24,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:11:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:11:24,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:11:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:11:24,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926155070] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:24,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 16:11:24,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-12 16:11:24,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399323906] [2022-12-12 16:11:24,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 16:11:24,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 16:11:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:24,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 16:11:24,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 16:11:24,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-12 16:11:24,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:24,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:24,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-12 16:11:24,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:24,435 INFO L130 PetriNetUnfolder]: 612/869 cut-off events. [2022-12-12 16:11:24,435 INFO L131 PetriNetUnfolder]: For 149/153 co-relation queries the response was YES. [2022-12-12 16:11:24,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1997 conditions, 869 events. 612/869 cut-off events. For 149/153 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3485 event pairs, 171 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 1984. Up to 472 conditions per place. [2022-12-12 16:11:24,440 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-12-12 16:11:24,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 210 flow [2022-12-12 16:11:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 16:11:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 16:11:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-12 16:11:24,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36153846153846153 [2022-12-12 16:11:24,442 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 92 flow. Second operand 5 states and 47 transitions. [2022-12-12 16:11:24,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 210 flow [2022-12-12 16:11:24,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 204 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-12 16:11:24,444 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2022-12-12 16:11:24,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2022-12-12 16:11:24,445 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2022-12-12 16:11:24,445 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2022-12-12 16:11:24,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:24,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:24,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:24,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 16:11:24,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:24,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:24,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 70290992, now seen corresponding path program 1 times [2022-12-12 16:11:24,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:24,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200855530] [2022-12-12 16:11:24,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:24,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:24,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200855530] [2022-12-12 16:11:24,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200855530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155216281] [2022-12-12 16:11:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:24,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:24,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:24,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:11:24,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 16:11:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:24,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 16:11:24,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:11:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:25,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:11:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:25,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155216281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:11:25,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:11:25,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-12-12 16:11:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578677383] [2022-12-12 16:11:25,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:11:25,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 16:11:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 16:11:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-12-12 16:11:25,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:11:25,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 flow. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:25,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:25,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:11:25,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:25,622 INFO L130 PetriNetUnfolder]: 887/1295 cut-off events. [2022-12-12 16:11:25,622 INFO L131 PetriNetUnfolder]: For 1122/1268 co-relation queries the response was YES. [2022-12-12 16:11:25,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3516 conditions, 1295 events. 887/1295 cut-off events. For 1122/1268 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5207 event pairs, 160 based on Foata normal form. 242/1434 useless extension candidates. Maximal degree in co-relation 3495. Up to 427 conditions per place. [2022-12-12 16:11:25,630 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 108 selfloop transitions, 28 changer transitions 0/137 dead transitions. [2022-12-12 16:11:25,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 137 transitions, 791 flow [2022-12-12 16:11:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 16:11:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 16:11:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 132 transitions. [2022-12-12 16:11:25,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3905325443786982 [2022-12-12 16:11:25,633 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 13 states and 132 transitions. [2022-12-12 16:11:25,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 137 transitions, 791 flow [2022-12-12 16:11:25,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 137 transitions, 762 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-12 16:11:25,636 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 305 flow [2022-12-12 16:11:25,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=305, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2022-12-12 16:11:25,637 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-12-12 16:11:25,637 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 305 flow [2022-12-12 16:11:25,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:25,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:25,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:25,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 16:11:25,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-12 16:11:25,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:25,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1479649402, now seen corresponding path program 1 times [2022-12-12 16:11:25,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:25,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290014054] [2022-12-12 16:11:25,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:25,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:27,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:27,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290014054] [2022-12-12 16:11:27,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290014054] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:27,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118510230] [2022-12-12 16:11:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:27,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:27,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:27,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:11:27,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 16:11:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:27,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-12 16:11:27,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:11:27,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-12 16:11:27,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:11:27,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:11:27,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 16:11:28,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:11:28,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2022-12-12 16:11:28,276 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:28,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:28,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 53 [2022-12-12 16:11:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:28,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:11:28,746 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_177 (Array Int Int))) (< (+ c_~sum~0 c_~mts2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177) c_~A~0.base) .cse0)) (+ c_~mts1~0 1))) (or (forall ((v_ArrVal_177 (Array Int Int))) (not (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177) c_~A~0.base) .cse0)) 0))) (= c_~mts1~0 0)) (forall ((v_ArrVal_177 (Array Int Int))) (let ((.cse1 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_177) c_~A~0.base) .cse0)))) (or (< .cse1 0) (= c_~mts1~0 .cse1)))))) is different from false [2022-12-12 16:11:34,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:34,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2022-12-12 16:11:34,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:34,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 390 [2022-12-12 16:11:34,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 282 [2022-12-12 16:11:34,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:34,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 332 treesize of output 326 [2022-12-12 16:11:34,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 246 [2022-12-12 16:11:34,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:34,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 94 [2022-12-12 16:11:34,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:34,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:34,803 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:34,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 148 [2022-12-12 16:11:34,820 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:34,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 98 [2022-12-12 16:11:35,039 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:11:35,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 1 [2022-12-12 16:11:35,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:35,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 74 [2022-12-12 16:11:35,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:35,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:35,074 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:35,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 131 [2022-12-12 16:11:35,094 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:35,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 99 [2022-12-12 16:11:35,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:35,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 76 [2022-12-12 16:11:35,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:35,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:35,192 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:35,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 99 [2022-12-12 16:11:35,210 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:35,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 67 [2022-12-12 16:11:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:35,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118510230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:11:35,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:11:35,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 33 [2022-12-12 16:11:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621365004] [2022-12-12 16:11:35,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:11:35,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-12 16:11:35,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-12 16:11:35,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=968, Unknown=7, NotChecked=64, Total=1190 [2022-12-12 16:11:35,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:11:35,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 305 flow. Second operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:35,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:35,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:11:35,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:39,131 INFO L130 PetriNetUnfolder]: 2367/3474 cut-off events. [2022-12-12 16:11:39,131 INFO L131 PetriNetUnfolder]: For 5939/5939 co-relation queries the response was YES. [2022-12-12 16:11:39,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13145 conditions, 3474 events. 2367/3474 cut-off events. For 5939/5939 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16058 event pairs, 142 based on Foata normal form. 2/3476 useless extension candidates. Maximal degree in co-relation 10195. Up to 1826 conditions per place. [2022-12-12 16:11:39,200 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 217 selfloop transitions, 106 changer transitions 7/330 dead transitions. [2022-12-12 16:11:39,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 330 transitions, 2387 flow [2022-12-12 16:11:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 16:11:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 16:11:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 227 transitions. [2022-12-12 16:11:39,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43653846153846154 [2022-12-12 16:11:39,206 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 305 flow. Second operand 20 states and 227 transitions. [2022-12-12 16:11:39,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 330 transitions, 2387 flow [2022-12-12 16:11:39,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 330 transitions, 2284 flow, removed 50 selfloop flow, removed 2 redundant places. [2022-12-12 16:11:39,236 INFO L231 Difference]: Finished difference. Result has 77 places, 150 transitions, 1214 flow [2022-12-12 16:11:39,237 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1214, PETRI_PLACES=77, PETRI_TRANSITIONS=150} [2022-12-12 16:11:39,239 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2022-12-12 16:11:39,239 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 150 transitions, 1214 flow [2022-12-12 16:11:39,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:39,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:39,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:39,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 16:11:39,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:39,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash 870833870, now seen corresponding path program 2 times [2022-12-12 16:11:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:39,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014527390] [2022-12-12 16:11:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:40,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014527390] [2022-12-12 16:11:40,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014527390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:40,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141053341] [2022-12-12 16:11:40,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:11:40,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:40,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:40,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:11:40,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 16:11:40,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:11:40,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:11:40,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 16:11:40,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:11:41,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:41,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:41,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 53 [2022-12-12 16:11:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:41,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:11:42,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:42,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 94 [2022-12-12 16:11:42,481 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:11:42,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2022-12-12 16:11:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:42,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141053341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:11:42,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:11:42,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-12-12 16:11:42,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823760961] [2022-12-12 16:11:42,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:11:42,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 16:11:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:42,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 16:11:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2022-12-12 16:11:42,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:11:42,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 150 transitions, 1214 flow. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:42,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:42,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:11:42,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:45,429 INFO L130 PetriNetUnfolder]: 2631/3884 cut-off events. [2022-12-12 16:11:45,430 INFO L131 PetriNetUnfolder]: For 12397/12397 co-relation queries the response was YES. [2022-12-12 16:11:45,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17111 conditions, 3884 events. 2631/3884 cut-off events. For 12397/12397 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18131 event pairs, 641 based on Foata normal form. 24/3908 useless extension candidates. Maximal degree in co-relation 16987. Up to 3081 conditions per place. [2022-12-12 16:11:45,461 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 186 selfloop transitions, 99 changer transitions 7/292 dead transitions. [2022-12-12 16:11:45,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 292 transitions, 2572 flow [2022-12-12 16:11:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-12 16:11:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-12 16:11:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-12-12 16:11:45,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2932692307692308 [2022-12-12 16:11:45,463 INFO L175 Difference]: Start difference. First operand has 77 places, 150 transitions, 1214 flow. Second operand 24 states and 183 transitions. [2022-12-12 16:11:45,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 292 transitions, 2572 flow [2022-12-12 16:11:45,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 292 transitions, 2365 flow, removed 75 selfloop flow, removed 3 redundant places. [2022-12-12 16:11:45,496 INFO L231 Difference]: Finished difference. Result has 111 places, 202 transitions, 1800 flow [2022-12-12 16:11:45,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1800, PETRI_PLACES=111, PETRI_TRANSITIONS=202} [2022-12-12 16:11:45,499 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2022-12-12 16:11:45,499 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 202 transitions, 1800 flow [2022-12-12 16:11:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:45,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:45,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:45,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 16:11:45,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:45,703 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1224553880, now seen corresponding path program 3 times [2022-12-12 16:11:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:45,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455809171] [2022-12-12 16:11:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:47,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455809171] [2022-12-12 16:11:47,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455809171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:47,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990552218] [2022-12-12 16:11:47,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:11:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:47,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:47,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:11:47,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 16:11:47,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:11:47,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:11:47,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-12 16:11:47,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:11:47,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:11:47,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 16:11:48,106 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:11:48,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:11:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:48,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:11:49,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:49,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 159 [2022-12-12 16:11:49,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:49,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 130 [2022-12-12 16:11:49,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:49,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 112 [2022-12-12 16:11:49,876 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 16:11:49,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 101 [2022-12-12 16:11:49,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 77 [2022-12-12 16:11:49,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2022-12-12 16:11:49,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:49,921 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 16:11:49,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 28 [2022-12-12 16:11:49,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:11:49,953 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 16:11:49,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 56 [2022-12-12 16:11:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:50,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990552218] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:11:50,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:11:50,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 31 [2022-12-12 16:11:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39008833] [2022-12-12 16:11:50,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:11:50,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-12 16:11:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:11:50,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-12 16:11:50,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=880, Unknown=3, NotChecked=0, Total=1056 [2022-12-12 16:11:50,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:11:50,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 202 transitions, 1800 flow. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:50,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:11:50,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:11:50,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:11:53,584 INFO L130 PetriNetUnfolder]: 2964/4388 cut-off events. [2022-12-12 16:11:53,585 INFO L131 PetriNetUnfolder]: For 22890/22890 co-relation queries the response was YES. [2022-12-12 16:11:53,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22022 conditions, 4388 events. 2964/4388 cut-off events. For 22890/22890 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 21255 event pairs, 722 based on Foata normal form. 3/4391 useless extension candidates. Maximal degree in co-relation 21879. Up to 3681 conditions per place. [2022-12-12 16:11:53,620 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 241 selfloop transitions, 124 changer transitions 13/378 dead transitions. [2022-12-12 16:11:53,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 378 transitions, 3887 flow [2022-12-12 16:11:53,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-12 16:11:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-12 16:11:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 190 transitions. [2022-12-12 16:11:53,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30448717948717946 [2022-12-12 16:11:53,622 INFO L175 Difference]: Start difference. First operand has 111 places, 202 transitions, 1800 flow. Second operand 24 states and 190 transitions. [2022-12-12 16:11:53,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 378 transitions, 3887 flow [2022-12-12 16:11:53,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 378 transitions, 3778 flow, removed 51 selfloop flow, removed 3 redundant places. [2022-12-12 16:11:53,686 INFO L231 Difference]: Finished difference. Result has 142 places, 259 transitions, 2734 flow [2022-12-12 16:11:53,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2734, PETRI_PLACES=142, PETRI_TRANSITIONS=259} [2022-12-12 16:11:53,687 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2022-12-12 16:11:53,687 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 259 transitions, 2734 flow [2022-12-12 16:11:53,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:11:53,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:11:53,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:11:53,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 16:11:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:53,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:11:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:11:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1139826318, now seen corresponding path program 4 times [2022-12-12 16:11:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:11:53,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508462805] [2022-12-12 16:11:53,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:11:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:11:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:11:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:55,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:11:55,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508462805] [2022-12-12 16:11:55,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508462805] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:11:55,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999906660] [2022-12-12 16:11:55,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:11:55,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:11:55,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:11:55,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:11:55,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 16:11:55,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:11:55,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:11:55,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-12 16:11:55,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:11:55,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-12 16:11:55,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:11:55,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:11:55,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:11:55,979 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:11:55,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:11:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:11:56,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:11:58,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~sum~0 c_~mts2~0))) (and (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (~M~0 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse1 (+ c_~mts3~0 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse0 (+ c_~mts1~0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse0 0) (< 0 ~M~0) (= .cse0 .cse1) (< ~M~0 0) (< .cse1 0) (not (<= .cse0 2147483647)))))) (< c_~mts3~0 .cse3)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_313 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (+ c_~mts1~0 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse5 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse4 0) (= (+ c_~sum~0 .cse5 c_~mts2~0) .cse4) (= .cse4 0) (not (<= .cse4 2147483647)) (not (< (+ c_~mts3~0 .cse5) 0)))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_313 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) 0) (not (= (+ c_~mts1~0 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_313 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select .cse11 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse10 (+ c_~mts3~0 .cse9)) (.cse8 (+ c_~mts1~0 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse8 0) (= (+ c_~sum~0 .cse9 c_~mts2~0) .cse8) (= .cse8 .cse10) (< .cse10 0) (not (<= .cse8 2147483647))))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_313 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (+ c_~mts3~0 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (not (< (+ c_~mts1~0 .cse12) 0)) (not (<= 0 (+ c_~mts1~0 .cse12 2147483648))) (< .cse13 0) (= .cse13 0))))))) (or (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (~M~0 Int) (v_ArrVal_313 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (+ c_~mts1~0 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse15 0) (< 0 ~M~0) (< ~M~0 0) (not (<= .cse15 2147483647)) (not (= .cse15 (+ c_~mts3~0 (select .cse16 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) (<= .cse3 c_~mts3~0)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_313 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (+ c_~sum~0 (select .cse17 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) 0) (not (< (+ c_~mts1~0 .cse18) 0)) (not (<= 0 (+ c_~mts1~0 .cse18 2147483648))))))))))) is different from false [2022-12-12 16:11:58,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:11:58,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 96 [2022-12-12 16:11:58,717 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:58,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1239 treesize of output 1195 [2022-12-12 16:11:58,746 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:58,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1191 treesize of output 1067 [2022-12-12 16:11:58,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:11:58,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 799 treesize of output 767 [2022-12-12 16:11:58,789 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:11:58,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1031 treesize of output 971 [2022-12-12 16:12:00,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:00,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 75 [2022-12-12 16:12:00,375 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:00,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 448 treesize of output 436 [2022-12-12 16:12:00,394 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:00,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 432 treesize of output 416 [2022-12-12 16:12:00,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:12:00,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 331 [2022-12-12 16:12:00,423 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:00,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 366 [2022-12-12 16:12:00,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:00,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-12-12 16:12:01,005 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 962 treesize of output 926 [2022-12-12 16:12:01,036 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 914 treesize of output 822 [2022-12-12 16:12:01,066 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 786 treesize of output 766 [2022-12-12 16:12:01,097 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 640 treesize of output 596 [2022-12-12 16:12:01,102 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:12:01,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:01,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 55 [2022-12-12 16:12:01,322 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 628 treesize of output 608 [2022-12-12 16:12:01,359 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 604 treesize of output 576 [2022-12-12 16:12:01,382 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 572 treesize of output 512 [2022-12-12 16:12:01,410 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 373 [2022-12-12 16:12:01,415 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:12:01,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:01,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 147 [2022-12-12 16:12:01,597 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1687 treesize of output 1611 [2022-12-12 16:12:01,631 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1593 treesize of output 1493 [2022-12-12 16:12:01,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:12:01,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 893 treesize of output 827 [2022-12-12 16:12:01,681 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:01,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1395 treesize of output 1191 [2022-12-12 16:12:03,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:03,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 109 [2022-12-12 16:12:03,057 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:03,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5222 treesize of output 5002 [2022-12-12 16:12:03,116 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:03,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4966 treesize of output 4394 [2022-12-12 16:12:03,188 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:03,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4262 treesize of output 4122 [2022-12-12 16:12:03,243 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:03,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4086 treesize of output 3802 [2022-12-12 16:12:03,261 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:12:13,040 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:13,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 129 [2022-12-12 16:12:13,058 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:13,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1572 treesize of output 1512 [2022-12-12 16:12:13,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:12:13,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1055 treesize of output 963 [2022-12-12 16:12:13,107 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:13,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1410 treesize of output 1374 [2022-12-12 16:12:13,138 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:12:13,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1364 treesize of output 1208 [2022-12-12 16:12:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 16:12:21,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999906660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:12:21,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:12:21,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 34 [2022-12-12 16:12:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052054966] [2022-12-12 16:12:21,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:12:21,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 16:12:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:12:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 16:12:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=4, NotChecked=66, Total=1260 [2022-12-12 16:12:21,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:12:21,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 259 transitions, 2734 flow. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:21,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:12:21,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:12:21,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:12:24,555 INFO L130 PetriNetUnfolder]: 3728/5513 cut-off events. [2022-12-12 16:12:24,555 INFO L131 PetriNetUnfolder]: For 33975/33975 co-relation queries the response was YES. [2022-12-12 16:12:24,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28986 conditions, 5513 events. 3728/5513 cut-off events. For 33975/33975 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 28045 event pairs, 659 based on Foata normal form. 1/5514 useless extension candidates. Maximal degree in co-relation 28848. Up to 4139 conditions per place. [2022-12-12 16:12:24,610 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 224 selfloop transitions, 210 changer transitions 1/435 dead transitions. [2022-12-12 16:12:24,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 435 transitions, 5135 flow [2022-12-12 16:12:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-12 16:12:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-12 16:12:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 120 transitions. [2022-12-12 16:12:24,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-12 16:12:24,612 INFO L175 Difference]: Start difference. First operand has 142 places, 259 transitions, 2734 flow. Second operand 15 states and 120 transitions. [2022-12-12 16:12:24,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 435 transitions, 5135 flow [2022-12-12 16:12:24,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 435 transitions, 4807 flow, removed 84 selfloop flow, removed 9 redundant places. [2022-12-12 16:12:24,753 INFO L231 Difference]: Finished difference. Result has 155 places, 363 transitions, 4427 flow [2022-12-12 16:12:24,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4427, PETRI_PLACES=155, PETRI_TRANSITIONS=363} [2022-12-12 16:12:24,755 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 123 predicate places. [2022-12-12 16:12:24,755 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 363 transitions, 4427 flow [2022-12-12 16:12:24,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:24,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:12:24,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:12:24,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-12 16:12:24,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:24,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:12:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:12:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -631360156, now seen corresponding path program 5 times [2022-12-12 16:12:24,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:12:24,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796266725] [2022-12-12 16:12:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:12:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:12:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:12:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:12:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796266725] [2022-12-12 16:12:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796266725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:12:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896894982] [2022-12-12 16:12:26,151 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 16:12:26,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:12:26,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:12:26,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 16:12:26,267 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:12:26,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:12:26,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-12 16:12:26,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:12:26,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:12:26,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 16:12:26,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:12:26,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:26,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 53 [2022-12-12 16:12:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:12:26,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:12:27,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:27,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 229 [2022-12-12 16:12:27,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:27,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 206 [2022-12-12 16:12:27,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:27,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 188 [2022-12-12 16:12:27,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2022-12-12 16:12:27,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 157 [2022-12-12 16:12:28,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:12:28,259 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:12:28,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2022-12-12 16:12:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:12:28,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896894982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:12:28,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:12:28,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2022-12-12 16:12:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707601764] [2022-12-12 16:12:28,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:12:28,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 16:12:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:12:28,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 16:12:28,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2022-12-12 16:12:28,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:12:28,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 363 transitions, 4427 flow. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:28,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:12:28,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:12:28,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:12:31,336 INFO L130 PetriNetUnfolder]: 4086/6046 cut-off events. [2022-12-12 16:12:31,337 INFO L131 PetriNetUnfolder]: For 46202/46202 co-relation queries the response was YES. [2022-12-12 16:12:31,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35686 conditions, 6046 events. 4086/6046 cut-off events. For 46202/46202 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 31466 event pairs, 680 based on Foata normal form. 1/6047 useless extension candidates. Maximal degree in co-relation 35549. Up to 4816 conditions per place. [2022-12-12 16:12:31,391 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 321 selfloop transitions, 232 changer transitions 1/554 dead transitions. [2022-12-12 16:12:31,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 554 transitions, 7621 flow [2022-12-12 16:12:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 16:12:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 16:12:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-12-12 16:12:31,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3293269230769231 [2022-12-12 16:12:31,392 INFO L175 Difference]: Start difference. First operand has 155 places, 363 transitions, 4427 flow. Second operand 16 states and 137 transitions. [2022-12-12 16:12:31,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 554 transitions, 7621 flow [2022-12-12 16:12:31,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 554 transitions, 7442 flow, removed 67 selfloop flow, removed 3 redundant places. [2022-12-12 16:12:31,561 INFO L231 Difference]: Finished difference. Result has 173 places, 467 transitions, 6467 flow [2022-12-12 16:12:31,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6467, PETRI_PLACES=173, PETRI_TRANSITIONS=467} [2022-12-12 16:12:31,562 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 141 predicate places. [2022-12-12 16:12:31,563 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 467 transitions, 6467 flow [2022-12-12 16:12:31,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:31,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:12:31,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:12:31,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-12 16:12:31,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:31,769 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:12:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:12:31,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1746293180, now seen corresponding path program 6 times [2022-12-12 16:12:31,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:12:31,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263060459] [2022-12-12 16:12:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:12:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:12:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:12:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:32,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:12:32,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263060459] [2022-12-12 16:12:32,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263060459] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:12:32,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404049512] [2022-12-12 16:12:32,727 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 16:12:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:12:32,728 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:12:32,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-12 16:12:32,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-12 16:12:32,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:12:32,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 16:12:32,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:12:33,260 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:12:33,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:12:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:33,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:12:33,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:33,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 110 [2022-12-12 16:12:33,922 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:12:33,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2022-12-12 16:12:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:34,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404049512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:12:34,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:12:34,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2022-12-12 16:12:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803901918] [2022-12-12 16:12:34,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:12:34,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-12 16:12:34,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:12:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-12 16:12:34,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-12-12 16:12:34,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:12:34,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 467 transitions, 6467 flow. Second operand has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:34,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:12:34,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:12:34,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:12:36,978 INFO L130 PetriNetUnfolder]: 4517/6701 cut-off events. [2022-12-12 16:12:36,979 INFO L131 PetriNetUnfolder]: For 56580/56580 co-relation queries the response was YES. [2022-12-12 16:12:37,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42170 conditions, 6701 events. 4517/6701 cut-off events. For 56580/56580 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 35362 event pairs, 947 based on Foata normal form. 3/6704 useless extension candidates. Maximal degree in co-relation 42021. Up to 5545 conditions per place. [2022-12-12 16:12:37,041 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 370 selfloop transitions, 250 changer transitions 13/633 dead transitions. [2022-12-12 16:12:37,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 633 transitions, 9412 flow [2022-12-12 16:12:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-12 16:12:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-12 16:12:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 192 transitions. [2022-12-12 16:12:37,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28402366863905326 [2022-12-12 16:12:37,043 INFO L175 Difference]: Start difference. First operand has 173 places, 467 transitions, 6467 flow. Second operand 26 states and 192 transitions. [2022-12-12 16:12:37,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 633 transitions, 9412 flow [2022-12-12 16:12:37,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 633 transitions, 9047 flow, removed 36 selfloop flow, removed 3 redundant places. [2022-12-12 16:12:37,273 INFO L231 Difference]: Finished difference. Result has 209 places, 533 transitions, 8025 flow [2022-12-12 16:12:37,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6149, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=8025, PETRI_PLACES=209, PETRI_TRANSITIONS=533} [2022-12-12 16:12:37,273 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 177 predicate places. [2022-12-12 16:12:37,274 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 533 transitions, 8025 flow [2022-12-12 16:12:37,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5714285714285716) internal successors, (72), 28 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:37,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:12:37,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:12:37,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-12 16:12:37,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-12 16:12:37,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:12:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:12:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1265005880, now seen corresponding path program 7 times [2022-12-12 16:12:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:12:37,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122106887] [2022-12-12 16:12:37,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:12:37,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:12:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:12:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:12:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122106887] [2022-12-12 16:12:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122106887] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:12:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300139370] [2022-12-12 16:12:38,270 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 16:12:38,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:38,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:12:38,272 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:12:38,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-12 16:12:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:12:38,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-12 16:12:38,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:12:38,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:12:38,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:38,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 53 [2022-12-12 16:12:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:38,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:12:39,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:39,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 70 [2022-12-12 16:12:39,299 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:12:39,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 1 [2022-12-12 16:12:39,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:39,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300139370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:12:39,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:12:39,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-12 16:12:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172955672] [2022-12-12 16:12:39,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:12:39,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-12 16:12:39,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:12:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-12 16:12:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2022-12-12 16:12:39,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-12 16:12:39,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 533 transitions, 8025 flow. Second operand has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:39,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:12:39,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-12 16:12:39,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:12:41,643 INFO L130 PetriNetUnfolder]: 5201/7760 cut-off events. [2022-12-12 16:12:41,643 INFO L131 PetriNetUnfolder]: For 78167/78356 co-relation queries the response was YES. [2022-12-12 16:12:41,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52469 conditions, 7760 events. 5201/7760 cut-off events. For 78167/78356 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 43583 event pairs, 801 based on Foata normal form. 159/7875 useless extension candidates. Maximal degree in co-relation 52296. Up to 5873 conditions per place. [2022-12-12 16:12:41,727 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 399 selfloop transitions, 302 changer transitions 4/727 dead transitions. [2022-12-12 16:12:41,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 727 transitions, 11795 flow [2022-12-12 16:12:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 16:12:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 16:12:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 151 transitions. [2022-12-12 16:12:41,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4467455621301775 [2022-12-12 16:12:41,729 INFO L175 Difference]: Start difference. First operand has 209 places, 533 transitions, 8025 flow. Second operand 13 states and 151 transitions. [2022-12-12 16:12:41,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 727 transitions, 11795 flow [2022-12-12 16:12:42,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 727 transitions, 11494 flow, removed 135 selfloop flow, removed 5 redundant places. [2022-12-12 16:12:42,013 INFO L231 Difference]: Finished difference. Result has 222 places, 642 transitions, 10547 flow [2022-12-12 16:12:42,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=7724, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10547, PETRI_PLACES=222, PETRI_TRANSITIONS=642} [2022-12-12 16:12:42,013 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 190 predicate places. [2022-12-12 16:12:42,013 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 642 transitions, 10547 flow [2022-12-12 16:12:42,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 27 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:42,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:12:42,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:12:42,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-12 16:12:42,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:42,215 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:12:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:12:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1384576018, now seen corresponding path program 8 times [2022-12-12 16:12:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:12:42,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497622580] [2022-12-12 16:12:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:12:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:12:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:12:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:12:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497622580] [2022-12-12 16:12:43,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497622580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:12:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016133169] [2022-12-12 16:12:43,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:12:43,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:12:43,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:12:43,295 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:12:43,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 16:12:43,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:12:43,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:12:43,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-12 16:12:43,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:12:43,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:12:43,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 16:12:43,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:43,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 60 [2022-12-12 16:12:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:44,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:12:45,748 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< |c_thread1Thread1of1ForFork1_#t~ret3#1| 0))) (and (or .cse0 (not (<= |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483647)) (let ((.cse3 (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset))) (and (forall ((v_ArrVal_493 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base))) (or (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int)) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< (+ .cse1 c_~mts3~0) 0)) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (< 0 (+ c_~sum~0 .cse1 c_~mts2~0))))) (= (+ (select .cse2 .cse3) c_~mts1~0) 0)))) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base))) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (let ((.cse4 (+ (select .cse7 .cse3) c_~mts1~0)) (.cse5 (+ .cse6 c_~mts3~0))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (= .cse4 .cse5)) (<= (+ c_~sum~0 .cse6 c_~mts2~0) .cse4) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (< .cse5 0)))))) (or (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base))) (let ((.cse8 (+ (select .cse9 (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) c_~mts3~0))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (< .cse8 0) (= (+ (select .cse9 .cse3) c_~mts1~0) .cse8)))))) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base))) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< (+ .cse10 c_~mts3~0) 0)) (<= (+ c_~sum~0 .cse10 c_~mts2~0) (+ (select .cse11 .cse3) c_~mts1~0)) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)))))) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base))) (let ((.cse14 (select .cse15 (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (let ((.cse12 (+ .cse14 c_~mts3~0)) (.cse13 (+ (select .cse15 .cse3) c_~mts1~0))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (< .cse12 0) (= .cse13 .cse12) (= (+ c_~sum~0 .cse14 c_~mts2~0) .cse13)))))) (forall ((v_ArrVal_493 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base))) (let ((.cse16 (+ (select .cse18 .cse3) c_~mts1~0))) (or (= .cse16 0) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int)) (let ((.cse17 (select .cse18 (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< (+ .cse17 c_~mts3~0) 0)) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (= (+ c_~sum~0 .cse17 c_~mts2~0) .cse16))))))))))) (or (not .cse0) (and (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base) (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (= (+ .cse19 c_~mts3~0) 0)) (<= c_~N~0 |thread3Thread1of1ForFork0_~i~2#1|) (<= (+ c_~sum~0 .cse19 c_~mts2~0) 0)))) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse20 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base) (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) c_~mts3~0))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (< .cse20 0) (= .cse20 0)))) (forall ((|thread3Thread1of1ForFork0_~i~2#1| Int) (v_ArrVal_493 (Array Int Int))) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_493) c_~A~0.base) (+ c_~A~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))))) (or (< (+ |thread3Thread1of1ForFork0_~i~2#1| 1) c_~N~0) (not (< (+ .cse21 c_~mts3~0) 0)) (not (< |thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (<= (+ c_~sum~0 .cse21 c_~mts2~0) 0))))) (not (<= 0 (+ |c_thread1Thread1of1ForFork1_#t~ret3#1| 2147483648)))))) is different from false [2022-12-12 16:12:45,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:45,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 268 treesize of output 276 [2022-12-12 16:12:45,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 178 [2022-12-12 16:12:45,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-12-12 16:12:45,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2022-12-12 16:12:48,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:12:48,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:12:48,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 381 treesize of output 433 [2022-12-12 16:12:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:12:56,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016133169] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:12:56,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:12:56,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 30 [2022-12-12 16:12:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553311879] [2022-12-12 16:12:56,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:12:56,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 16:12:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:12:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 16:12:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=755, Unknown=1, NotChecked=58, Total=992 [2022-12-12 16:12:56,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:12:56,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 642 transitions, 10547 flow. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:12:56,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:12:56,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:12:56,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:13:00,632 INFO L130 PetriNetUnfolder]: 6378/9466 cut-off events. [2022-12-12 16:13:00,632 INFO L131 PetriNetUnfolder]: For 110035/110035 co-relation queries the response was YES. [2022-12-12 16:13:00,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68239 conditions, 9466 events. 6378/9466 cut-off events. For 110035/110035 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 53559 event pairs, 893 based on Foata normal form. 2/9468 useless extension candidates. Maximal degree in co-relation 68053. Up to 6441 conditions per place. [2022-12-12 16:13:00,728 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 478 selfloop transitions, 449 changer transitions 9/936 dead transitions. [2022-12-12 16:13:00,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 936 transitions, 16338 flow [2022-12-12 16:13:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-12 16:13:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-12 16:13:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 222 transitions. [2022-12-12 16:13:00,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3415384615384615 [2022-12-12 16:13:00,730 INFO L175 Difference]: Start difference. First operand has 222 places, 642 transitions, 10547 flow. Second operand 25 states and 222 transitions. [2022-12-12 16:13:00,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 936 transitions, 16338 flow [2022-12-12 16:13:01,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 936 transitions, 15984 flow, removed 169 selfloop flow, removed 3 redundant places. [2022-12-12 16:13:01,364 INFO L231 Difference]: Finished difference. Result has 254 places, 795 transitions, 14630 flow [2022-12-12 16:13:01,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=10331, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=14630, PETRI_PLACES=254, PETRI_TRANSITIONS=795} [2022-12-12 16:13:01,365 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 222 predicate places. [2022-12-12 16:13:01,365 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 795 transitions, 14630 flow [2022-12-12 16:13:01,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:01,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:13:01,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:13:01,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 16:13:01,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 16:13:01,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:13:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:13:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 522187254, now seen corresponding path program 9 times [2022-12-12 16:13:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:13:01,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83737496] [2022-12-12 16:13:01,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:13:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:13:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:13:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:13:02,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83737496] [2022-12-12 16:13:02,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83737496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:13:02,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121158652] [2022-12-12 16:13:02,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:13:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:13:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:13:02,765 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:13:02,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-12 16:13:02,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 16:13:02,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:13:02,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-12 16:13:02,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:13:03,363 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:13:03,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:13:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:03,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:13:03,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:03,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 123 [2022-12-12 16:13:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:04,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121158652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:13:04,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:13:04,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-12-12 16:13:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726812763] [2022-12-12 16:13:04,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:13:04,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-12 16:13:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:13:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-12 16:13:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2022-12-12 16:13:04,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:13:04,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 795 transitions, 14630 flow. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:04,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:13:04,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:13:04,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:13:08,209 INFO L130 PetriNetUnfolder]: 6696/9925 cut-off events. [2022-12-12 16:13:08,209 INFO L131 PetriNetUnfolder]: For 143674/143674 co-relation queries the response was YES. [2022-12-12 16:13:08,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75409 conditions, 9925 events. 6696/9925 cut-off events. For 143674/143674 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 56321 event pairs, 1481 based on Foata normal form. 1/9926 useless extension candidates. Maximal degree in co-relation 75205. Up to 8149 conditions per place. [2022-12-12 16:13:08,307 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 518 selfloop transitions, 407 changer transitions 1/926 dead transitions. [2022-12-12 16:13:08,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 926 transitions, 18087 flow [2022-12-12 16:13:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-12 16:13:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-12 16:13:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 176 transitions. [2022-12-12 16:13:08,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3076923076923077 [2022-12-12 16:13:08,309 INFO L175 Difference]: Start difference. First operand has 254 places, 795 transitions, 14630 flow. Second operand 22 states and 176 transitions. [2022-12-12 16:13:08,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 926 transitions, 18087 flow [2022-12-12 16:13:08,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 926 transitions, 17690 flow, removed 183 selfloop flow, removed 5 redundant places. [2022-12-12 16:13:08,851 INFO L231 Difference]: Finished difference. Result has 275 places, 838 transitions, 16255 flow [2022-12-12 16:13:08,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=14249, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=16255, PETRI_PLACES=275, PETRI_TRANSITIONS=838} [2022-12-12 16:13:08,852 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 243 predicate places. [2022-12-12 16:13:08,852 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 838 transitions, 16255 flow [2022-12-12 16:13:08,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:08,852 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:13:08,852 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:13:08,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-12 16:13:09,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-12 16:13:09,053 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:13:09,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:13:09,054 INFO L85 PathProgramCache]: Analyzing trace with hash -742572222, now seen corresponding path program 10 times [2022-12-12 16:13:09,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:13:09,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955631529] [2022-12-12 16:13:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:13:09,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:13:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:13:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:13:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955631529] [2022-12-12 16:13:10,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955631529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:13:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615246506] [2022-12-12 16:13:10,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:13:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:13:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:13:10,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:13:10,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-12 16:13:10,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:13:10,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:13:10,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-12 16:13:10,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:13:10,938 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:13:10,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:13:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:13:11,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:13:11,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:11,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 121 [2022-12-12 16:13:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:13:11,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615246506] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:13:11,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:13:11,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 31 [2022-12-12 16:13:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517818021] [2022-12-12 16:13:11,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:13:11,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-12 16:13:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:13:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-12 16:13:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2022-12-12 16:13:11,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:13:11,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 838 transitions, 16255 flow. Second operand has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:11,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:13:11,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:13:11,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:13:15,891 INFO L130 PetriNetUnfolder]: 6826/10149 cut-off events. [2022-12-12 16:13:15,891 INFO L131 PetriNetUnfolder]: For 142170/142170 co-relation queries the response was YES. [2022-12-12 16:13:15,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77809 conditions, 10149 events. 6826/10149 cut-off events. For 142170/142170 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 58521 event pairs, 1231 based on Foata normal form. 2/10151 useless extension candidates. Maximal degree in co-relation 77596. Up to 7711 conditions per place. [2022-12-12 16:13:15,994 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 396 selfloop transitions, 552 changer transitions 2/950 dead transitions. [2022-12-12 16:13:15,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 950 transitions, 19683 flow [2022-12-12 16:13:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 16:13:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 16:13:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 126 transitions. [2022-12-12 16:13:15,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2850678733031674 [2022-12-12 16:13:15,996 INFO L175 Difference]: Start difference. First operand has 275 places, 838 transitions, 16255 flow. Second operand 17 states and 126 transitions. [2022-12-12 16:13:15,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 950 transitions, 19683 flow [2022-12-12 16:13:16,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 950 transitions, 19072 flow, removed 216 selfloop flow, removed 8 redundant places. [2022-12-12 16:13:16,658 INFO L231 Difference]: Finished difference. Result has 290 places, 872 transitions, 17739 flow [2022-12-12 16:13:16,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=15702, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=17739, PETRI_PLACES=290, PETRI_TRANSITIONS=872} [2022-12-12 16:13:16,659 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 258 predicate places. [2022-12-12 16:13:16,659 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 872 transitions, 17739 flow [2022-12-12 16:13:16,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:16,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:13:16,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:13:16,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-12 16:13:16,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-12 16:13:16,866 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:13:16,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:13:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1491355774, now seen corresponding path program 11 times [2022-12-12 16:13:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:13:16,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086133520] [2022-12-12 16:13:16,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:13:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:13:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:13:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:13:18,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086133520] [2022-12-12 16:13:18,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086133520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:13:18,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740228996] [2022-12-12 16:13:18,114 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 16:13:18,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:13:18,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:13:18,115 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:13:18,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-12 16:13:18,212 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:13:18,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:13:18,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-12 16:13:18,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:13:18,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-12 16:13:18,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:13:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:13:18,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 16:13:18,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:13:18,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-12 16:13:19,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:19,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:19,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 53 [2022-12-12 16:13:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:19,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:13:25,465 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((~M~0 Int) (v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse1 (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (+ c_~mts3~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse2 (+ c_~mts1~0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse0 0) (= (+ (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0) .cse0) (< 0 ~M~0) (< ~M~0 0) (not (<= .cse2 2147483647)) (< .cse2 0)))))) (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse7 (+ c_~mts1~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (let ((.cse4 (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= (+ (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0) 0) (not (< (+ c_~mts3~0 .cse5) 0)) (< 0 (+ c_~sum~0 .cse5 c_~mts2~0)))))) (not (<= .cse7 2147483647)) (< .cse7 0))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse8 (+ c_~mts1~0 (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse8 2147483647)) (< .cse8 0) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (let ((.cse11 (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (+ (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0)) (.cse10 (select .cse11 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= .cse9 (+ c_~sum~0 .cse10 c_~mts2~0)) (= .cse9 0) (not (< (+ c_~mts3~0 .cse10) 0)))))))))) (< 0 ~M~0) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse15 (+ c_~mts1~0 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (+ c_~sum~0 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) (+ (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0)))) (not (<= .cse15 2147483647)) (< .cse15 0))))) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (let ((.cse16 (+ c_~mts3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (< .cse16 0) (= .cse16 0)))) (not (< (+ c_~mts1~0 .cse18) 0)) (not (<= 0 (+ c_~mts1~0 .cse18 2147483648))))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) 0)) (not (< (+ c_~mts1~0 .cse20) 0)) (not (<= 0 (+ c_~mts1~0 .cse20 2147483648))))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_628 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_628))) (let ((.cse21 (+ c_~mts1~0 (select (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (<= .cse21 2147483647)) (< .cse21 0) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (let ((.cse25 (select (store (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse24 (select .cse25 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse22 (+ c_~mts3~0 .cse24)) (.cse23 (+ (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (< .cse22 0) (= .cse23 .cse22) (= .cse23 (+ c_~sum~0 .cse24 c_~mts2~0)))))))))))))) is different from false [2022-12-12 16:13:25,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:25,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2022-12-12 16:13:25,553 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 404 treesize of output 384 [2022-12-12 16:13:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 330 treesize of output 306 [2022-12-12 16:13:25,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:13:25,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 193 [2022-12-12 16:13:25,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 246 [2022-12-12 16:13:25,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:25,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2022-12-12 16:13:25,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:25,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:25,798 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 126 [2022-12-12 16:13:25,812 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 77 [2022-12-12 16:13:25,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:25,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 76 [2022-12-12 16:13:25,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:25,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:25,906 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 83 [2022-12-12 16:13:25,920 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2022-12-12 16:13:25,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:25,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 97 [2022-12-12 16:13:25,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:25,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 16:13:25,966 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 106 [2022-12-12 16:13:25,983 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:25,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 56 [2022-12-12 16:13:26,032 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:13:26,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 1 [2022-12-12 16:13:26,048 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:13:26,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 1 [2022-12-12 16:13:26,059 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:13:26,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 1 [2022-12-12 16:13:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 16:13:26,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740228996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:13:26,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:13:26,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-12-12 16:13:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688947689] [2022-12-12 16:13:26,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:13:26,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-12 16:13:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:13:26,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-12 16:13:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1135, Unknown=8, NotChecked=70, Total=1406 [2022-12-12 16:13:26,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:13:26,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 872 transitions, 17739 flow. Second operand has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:26,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:13:26,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:13:26,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:13:31,171 INFO L130 PetriNetUnfolder]: 6865/10219 cut-off events. [2022-12-12 16:13:31,171 INFO L131 PetriNetUnfolder]: For 153342/153342 co-relation queries the response was YES. [2022-12-12 16:13:31,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80602 conditions, 10219 events. 6865/10219 cut-off events. For 153342/153342 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 59286 event pairs, 1249 based on Foata normal form. 1/10220 useless extension candidates. Maximal degree in co-relation 80374. Up to 8188 conditions per place. [2022-12-12 16:13:31,279 INFO L137 encePairwiseOnDemand]: 12/26 looper letters, 543 selfloop transitions, 420 changer transitions 1/964 dead transitions. [2022-12-12 16:13:31,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 964 transitions, 20510 flow [2022-12-12 16:13:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 16:13:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 16:13:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 135 transitions. [2022-12-12 16:13:31,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3245192307692308 [2022-12-12 16:13:31,280 INFO L175 Difference]: Start difference. First operand has 290 places, 872 transitions, 17739 flow. Second operand 16 states and 135 transitions. [2022-12-12 16:13:31,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 964 transitions, 20510 flow [2022-12-12 16:13:31,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 964 transitions, 19797 flow, removed 159 selfloop flow, removed 5 redundant places. [2022-12-12 16:13:31,907 INFO L231 Difference]: Finished difference. Result has 304 places, 880 transitions, 18184 flow [2022-12-12 16:13:31,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=17034, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=872, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=18184, PETRI_PLACES=304, PETRI_TRANSITIONS=880} [2022-12-12 16:13:31,908 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 272 predicate places. [2022-12-12 16:13:31,908 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 880 transitions, 18184 flow [2022-12-12 16:13:31,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.945945945945946) internal successors, (72), 37 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:31,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:13:31,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:13:31,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-12 16:13:32,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 16:13:32,109 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:13:32,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:13:32,110 INFO L85 PathProgramCache]: Analyzing trace with hash 626607118, now seen corresponding path program 12 times [2022-12-12 16:13:32,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:13:32,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170368665] [2022-12-12 16:13:32,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:13:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:13:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:13:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:13:33,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170368665] [2022-12-12 16:13:33,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170368665] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:13:33,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818463623] [2022-12-12 16:13:33,385 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 16:13:33,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:13:33,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:13:33,387 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:13:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-12 16:13:33,497 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-12 16:13:33,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:13:33,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 16:13:33,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:13:33,952 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:13:33,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:13:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:34,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:13:34,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:34,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 84 [2022-12-12 16:13:34,622 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 16:13:34,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 70 [2022-12-12 16:13:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:34,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818463623] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:13:34,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:13:34,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-12-12 16:13:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094050745] [2022-12-12 16:13:34,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:13:34,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-12 16:13:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:13:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-12 16:13:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2022-12-12 16:13:34,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:13:34,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 880 transitions, 18184 flow. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:34,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:13:34,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:13:34,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:13:39,093 INFO L130 PetriNetUnfolder]: 7118/10592 cut-off events. [2022-12-12 16:13:39,094 INFO L131 PetriNetUnfolder]: For 174773/174773 co-relation queries the response was YES. [2022-12-12 16:13:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86043 conditions, 10592 events. 7118/10592 cut-off events. For 174773/174773 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 61309 event pairs, 1735 based on Foata normal form. 2/10592 useless extension candidates. Maximal degree in co-relation 85807. Up to 9495 conditions per place. [2022-12-12 16:13:39,221 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 638 selfloop transitions, 328 changer transitions 7/973 dead transitions. [2022-12-12 16:13:39,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 973 transitions, 21216 flow [2022-12-12 16:13:39,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-12 16:13:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-12 16:13:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 157 transitions. [2022-12-12 16:13:39,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2516025641025641 [2022-12-12 16:13:39,223 INFO L175 Difference]: Start difference. First operand has 304 places, 880 transitions, 18184 flow. Second operand 24 states and 157 transitions. [2022-12-12 16:13:39,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 973 transitions, 21216 flow [2022-12-12 16:13:40,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 973 transitions, 20639 flow, removed 24 selfloop flow, removed 7 redundant places. [2022-12-12 16:13:40,088 INFO L231 Difference]: Finished difference. Result has 323 places, 904 transitions, 18879 flow [2022-12-12 16:13:40,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=17625, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=18879, PETRI_PLACES=323, PETRI_TRANSITIONS=904} [2022-12-12 16:13:40,089 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 291 predicate places. [2022-12-12 16:13:40,090 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 904 transitions, 18879 flow [2022-12-12 16:13:40,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:13:40,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:13:40,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:13:40,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-12 16:13:40,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:13:40,296 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:13:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:13:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1306982020, now seen corresponding path program 13 times [2022-12-12 16:13:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:13:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006147059] [2022-12-12 16:13:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:13:40,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:13:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:13:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:13:41,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006147059] [2022-12-12 16:13:41,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006147059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:13:41,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262170444] [2022-12-12 16:13:41,271 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 16:13:41,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:13:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:13:41,276 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:13:41,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-12 16:13:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:13:41,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-12 16:13:41,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:13:41,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-12 16:13:41,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:13:41,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:13:41,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:13:42,069 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:13:42,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 85 [2022-12-12 16:13:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:13:42,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:13:51,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:51,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2022-12-12 16:13:51,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:51,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1953 treesize of output 1883 [2022-12-12 16:13:51,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:51,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1873 treesize of output 1691 [2022-12-12 16:13:51,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:51,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1681 treesize of output 1595 [2022-12-12 16:13:51,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:51,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1585 treesize of output 1547 [2022-12-12 16:13:54,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:54,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 147 [2022-12-12 16:13:54,929 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:54,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1687 treesize of output 1611 [2022-12-12 16:13:54,960 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:54,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1593 treesize of output 1493 [2022-12-12 16:13:54,988 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:54,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1461 treesize of output 1257 [2022-12-12 16:13:55,046 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:55,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 753 treesize of output 705 [2022-12-12 16:13:56,085 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:56,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 96 [2022-12-12 16:13:56,104 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:56,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 599 treesize of output 579 [2022-12-12 16:13:56,124 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:56,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 575 treesize of output 515 [2022-12-12 16:13:56,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 16:13:56,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 373 [2022-12-12 16:13:56,155 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:56,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 495 treesize of output 467 [2022-12-12 16:13:56,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:13:56,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 109 [2022-12-12 16:13:56,879 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:56,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2590 treesize of output 2482 [2022-12-12 16:13:56,922 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:56,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2462 treesize of output 2178 [2022-12-12 16:13:56,965 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:56,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2110 treesize of output 1970 [2022-12-12 16:13:57,004 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:13:57,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1934 treesize of output 1866 [2022-12-12 16:13:57,015 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:14:08,464 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 16:14:08,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-12-12 16:14:08,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:14:08,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 129 [2022-12-12 16:14:08,502 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:14:08,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1572 treesize of output 1512 [2022-12-12 16:14:08,532 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:14:08,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1502 treesize of output 1426 [2022-12-12 16:14:08,561 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:14:08,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1410 treesize of output 1374 [2022-12-12 16:14:08,603 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:14:08,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1364 treesize of output 1208 [2022-12-12 16:14:08,612 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:14:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:14:11,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262170444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:14:11,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:14:11,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 35 [2022-12-12 16:14:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760882517] [2022-12-12 16:14:11,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:14:11,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-12 16:14:11,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:14:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-12 16:14:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1104, Unknown=27, NotChecked=0, Total=1332 [2022-12-12 16:14:11,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:14:11,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 904 transitions, 18879 flow. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:14:11,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:14:11,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:14:11,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:15:04,958 WARN L233 SmtUtils]: Spent 46.14s on a formula simplification. DAG size of input: 238 DAG size of output: 193 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:15:51,670 WARN L233 SmtUtils]: Spent 42.96s on a formula simplification. DAG size of input: 258 DAG size of output: 197 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:16:33,217 WARN L233 SmtUtils]: Spent 37.76s on a formula simplification. DAG size of input: 290 DAG size of output: 216 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:16:45,815 WARN L233 SmtUtils]: Spent 10.15s on a formula simplification. DAG size of input: 183 DAG size of output: 145 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:17:34,629 WARN L233 SmtUtils]: Spent 46.64s on a formula simplification. DAG size of input: 326 DAG size of output: 246 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:18:05,291 WARN L233 SmtUtils]: Spent 27.93s on a formula simplification. DAG size of input: 308 DAG size of output: 235 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:18:46,311 WARN L233 SmtUtils]: Spent 37.43s on a formula simplification. DAG size of input: 272 DAG size of output: 219 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 16:18:48,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:18:50,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:18:55,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:18:56,978 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| c_~A~0.base))) (let ((.cse15 (select .cse17 c_~A~0.offset))) (let ((.cse27 (+ .cse15 c_~mts1~0))) (let ((.cse16 (< .cse27 0)) (.cse10 (< c_~mts3~0 (+ c_~sum~0 c_~mts2~0)))) (and (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~A~0.base))) (let ((.cse0 (+ c_~mts1~0 (select .cse3 c_~A~0.offset)))) (or (not (<= .cse0 2147483647)) (forall ((~M~0 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse1 (+ c_~mts3~0 .cse2))) (or (= .cse1 .cse0) (= (+ c_~sum~0 c_~mts2~0 .cse2) .cse0) (< 0 ~M~0) (< .cse1 0) (< (+ ~M~0 1) c_~N~0))))) (< .cse0 0))))) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< (+ c_~mts1~0 .cse4) 0)) (not (<= 0 (+ c_~mts1~0 .cse4 2147483648))) (forall ((~M~0 Int)) (let ((.cse5 (+ c_~mts3~0 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (< .cse5 0) (< 0 ~M~0) (= .cse5 0) (< (+ ~M~0 1) c_~N~0)))))))) (or (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (+ c_~mts3~0 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse8 (+ c_~mts1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse7 0) (< 0 ~M~0) (= .cse7 .cse8) (< .cse8 0) (not (<= .cse8 2147483647)) (< (+ ~M~0 1) c_~N~0))))) .cse10) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (+ c_~mts1~0 (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse11 0) (not (<= .cse11 2147483647)) (forall ((~M~0 Int)) (let ((.cse13 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse12 (+ c_~mts3~0 .cse13))) (or (< .cse12 0) (< 0 ~M~0) (= .cse12 .cse11) (= (+ c_~sum~0 .cse13 c_~mts2~0) .cse11) (< (+ ~M~0 1) c_~N~0))))))))) (= c_~mts2~0 0) (or (not (<= 0 (+ .cse15 c_~mts1~0 2147483648))) (not .cse16) (and (forall ((~M~0 Int)) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (<= (+ c_~sum~0 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))) c_~mts2~0) 0) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int)) (let ((.cse18 (+ c_~mts3~0 (select .cse17 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (= .cse18 0) (< .cse18 0) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~A~0.base))) (let ((.cse19 (select .cse21 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse19) 0)) (forall ((~M~0 Int)) (let ((.cse20 (+ c_~mts3~0 (select .cse21 (+ c_~A~0.offset (* ~M~0 4)))))) (or (= .cse20 0) (< 0 ~M~0) (< .cse20 0) (< (+ ~M~0 1) c_~N~0)))) (not (<= 0 (+ c_~mts1~0 .cse19 2147483648))))))) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~A~0.base))) (let ((.cse22 (+ c_~mts1~0 (select .cse23 c_~A~0.offset)))) (or (not (<= .cse22 2147483647)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (<= (+ c_~sum~0 c_~mts2~0 (select .cse23 (+ c_~A~0.offset (* ~M~0 4)))) .cse22) (< (+ ~M~0 1) c_~N~0))) (< .cse22 0))))) (or .cse10 (forall ((v_ArrVal_723 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~A~0.base))) (let ((.cse24 (+ c_~mts3~0 (select .cse26 (+ c_~A~0.offset (* ~M~0 4))))) (.cse25 (+ c_~mts1~0 (select .cse26 c_~A~0.offset)))) (or (= .cse24 .cse25) (< 0 ~M~0) (< .cse24 0) (not (<= .cse25 2147483647)) (< .cse25 0) (< (+ ~M~0 1) c_~N~0)))))) (or (not (<= .cse27 2147483647)) .cse16 (and (forall ((~M~0 Int)) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (<= (+ c_~sum~0 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))) c_~mts2~0) .cse27) (< (+ ~M~0 1) c_~N~0))) (or .cse10 (forall ((~M~0 Int)) (let ((.cse28 (+ c_~mts3~0 (select .cse17 (+ c_~A~0.offset (* ~M~0 4)))))) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (< .cse28 0) (= .cse27 .cse28) (< (+ ~M~0 1) c_~N~0))))) (or (forall ((~M~0 Int)) (let ((.cse29 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (not (< (+ c_~mts3~0 .cse29) 0)) (= .cse27 (+ c_~sum~0 .cse29 c_~mts2~0)) (< (+ ~M~0 1) c_~N~0)))) (= .cse27 0)) (forall ((~M~0 Int)) (let ((.cse30 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse31 (+ c_~mts3~0 .cse30))) (or (< |c_thread2Thread1of1ForFork2_~i~1#1| ~M~0) (= .cse27 (+ c_~sum~0 .cse30 c_~mts2~0)) (< .cse31 0) (= .cse27 .cse31) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~A~0.base))) (let ((.cse32 (+ c_~mts1~0 (select .cse34 c_~A~0.offset)))) (or (= .cse32 0) (not (<= .cse32 2147483647)) (< .cse32 0) (forall ((~M~0 Int)) (let ((.cse33 (select .cse34 (+ c_~A~0.offset (* ~M~0 4))))) (or (= (+ c_~sum~0 c_~mts2~0 .cse33) .cse32) (< 0 ~M~0) (not (< (+ c_~mts3~0 .cse33) 0)) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse35 (+ c_~mts1~0 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (= 0 .cse35) (< .cse35 0) (not (<= .cse35 2147483647)) (forall ((~M~0 Int)) (let ((.cse36 (select .cse37 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< 0 ~M~0) (not (< (+ c_~mts3~0 .cse36) 0)) (= (+ c_~sum~0 .cse36 c_~mts2~0) .cse35) (< (+ ~M~0 1) c_~N~0)))))))) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse39 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< (+ c_~mts1~0 .cse38) 0)) (not (<= 0 (+ c_~mts1~0 .cse38 2147483648))) (forall ((~M~0 Int)) (or (<= (+ c_~sum~0 (select .cse39 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) 0) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))))) (forall ((v_ArrVal_723 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) c_~A~0.base))) (let ((.cse40 (select .cse41 c_~A~0.offset))) (or (not (< (+ c_~mts1~0 .cse40) 0)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (<= (+ c_~sum~0 c_~mts2~0 (select .cse41 (+ c_~A~0.offset (* ~M~0 4)))) 0) (< (+ ~M~0 1) c_~N~0))) (not (<= 0 (+ c_~mts1~0 .cse40 2147483648))))))) (let ((.cse42 (< c_~sum~0 0))) (or (and (<= 0 (+ c_~sum~0 2147483648)) (= c_~mts3~0 0) .cse42 (= c_~mts1~0 0)) (and (= c_~sum~0 c_~mts3~0) (<= c_~sum~0 2147483647) (not .cse42) (= c_~sum~0 c_~mts1~0)))) (forall ((v_ArrVal_722 (Array Int Int)) (v_ArrVal_721 (Array Int Int)) (v_ArrVal_723 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_722) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (+ c_~mts1~0 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse43 0) (not (<= .cse43 2147483647)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (<= (+ c_~sum~0 (select .cse44 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) .cse43) (< (+ ~M~0 1) c_~N~0)))))))))))) is different from false [2022-12-12 16:18:59,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:19:01,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 16:19:02,660 INFO L130 PetriNetUnfolder]: 9061/13526 cut-off events. [2022-12-12 16:19:02,660 INFO L131 PetriNetUnfolder]: For 246435/246435 co-relation queries the response was YES. [2022-12-12 16:19:02,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113672 conditions, 13526 events. 9061/13526 cut-off events. For 246435/246435 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 82872 event pairs, 1218 based on Foata normal form. 4/13528 useless extension candidates. Maximal degree in co-relation 113427. Up to 8953 conditions per place. [2022-12-12 16:19:02,824 INFO L137 encePairwiseOnDemand]: 7/26 looper letters, 524 selfloop transitions, 1049 changer transitions 18/1591 dead transitions. [2022-12-12 16:19:02,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 1591 transitions, 34840 flow [2022-12-12 16:19:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-12 16:19:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-12-12 16:19:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 345 transitions. [2022-12-12 16:19:02,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26018099547511314 [2022-12-12 16:19:02,826 INFO L175 Difference]: Start difference. First operand has 323 places, 904 transitions, 18879 flow. Second operand 51 states and 345 transitions. [2022-12-12 16:19:02,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 1591 transitions, 34840 flow [2022-12-12 16:19:03,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1591 transitions, 33962 flow, removed 250 selfloop flow, removed 15 redundant places. [2022-12-12 16:19:03,906 INFO L231 Difference]: Finished difference. Result has 382 places, 1406 transitions, 32861 flow [2022-12-12 16:19:03,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=18311, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=580, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=32861, PETRI_PLACES=382, PETRI_TRANSITIONS=1406} [2022-12-12 16:19:03,907 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 350 predicate places. [2022-12-12 16:19:03,908 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 1406 transitions, 32861 flow [2022-12-12 16:19:03,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:19:03,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:19:03,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:19:03,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-12 16:19:04,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 16:19:04,114 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:19:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:19:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1028039776, now seen corresponding path program 14 times [2022-12-12 16:19:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:19:04,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662726304] [2022-12-12 16:19:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:19:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:19:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:19:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:19:05,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:19:05,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662726304] [2022-12-12 16:19:05,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662726304] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:19:05,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199879864] [2022-12-12 16:19:05,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 16:19:05,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:19:05,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:19:05,502 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:19:05,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-12 16:19:05,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 16:19:05,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:19:05,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-12 16:19:05,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:19:06,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:19:06,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 97 [2022-12-12 16:19:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:19:06,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:19:07,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:19:07,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 139 [2022-12-12 16:19:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:19:07,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199879864] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:19:07,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:19:07,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 29 [2022-12-12 16:19:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077971544] [2022-12-12 16:19:07,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:19:07,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-12 16:19:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:19:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-12 16:19:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-12-12 16:19:07,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:19:07,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1406 transitions, 32861 flow. Second operand has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:19:07,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:19:07,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:19:07,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:19:23,316 INFO L130 PetriNetUnfolder]: 11663/17245 cut-off events. [2022-12-12 16:19:23,316 INFO L131 PetriNetUnfolder]: For 452583/452583 co-relation queries the response was YES. [2022-12-12 16:19:23,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166088 conditions, 17245 events. 11663/17245 cut-off events. For 452583/452583 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 108251 event pairs, 1321 based on Foata normal form. 2/17245 useless extension candidates. Maximal degree in co-relation 165862. Up to 10403 conditions per place. [2022-12-12 16:19:23,562 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 731 selfloop transitions, 1736 changer transitions 7/2474 dead transitions. [2022-12-12 16:19:23,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2474 transitions, 57695 flow [2022-12-12 16:19:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-12 16:19:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-12 16:19:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 432 transitions. [2022-12-12 16:19:23,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26373626373626374 [2022-12-12 16:19:23,568 INFO L175 Difference]: Start difference. First operand has 382 places, 1406 transitions, 32861 flow. Second operand 63 states and 432 transitions. [2022-12-12 16:19:23,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 2474 transitions, 57695 flow [2022-12-12 16:19:26,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 2474 transitions, 54359 flow, removed 1490 selfloop flow, removed 13 redundant places. [2022-12-12 16:19:26,554 INFO L231 Difference]: Finished difference. Result has 447 places, 2183 transitions, 51044 flow [2022-12-12 16:19:26,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=30780, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=51044, PETRI_PLACES=447, PETRI_TRANSITIONS=2183} [2022-12-12 16:19:26,556 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 415 predicate places. [2022-12-12 16:19:26,556 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 2183 transitions, 51044 flow [2022-12-12 16:19:26,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.4) internal successors, (72), 30 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:19:26,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:19:26,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:19:26,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-12 16:19:26,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-12 16:19:26,763 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:19:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:19:26,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1119664546, now seen corresponding path program 15 times [2022-12-12 16:19:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:19:26,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983468116] [2022-12-12 16:19:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:19:26,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:19:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:19:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:19:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:19:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983468116] [2022-12-12 16:19:28,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983468116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:19:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941316518] [2022-12-12 16:19:28,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 16:19:28,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:19:28,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:19:28,003 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:19:28,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-12 16:19:28,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 16:19:28,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:19:28,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-12 16:19:28,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:19:28,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:19:28,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 60 [2022-12-12 16:19:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:19:28,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:19:29,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:19:29,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 136 [2022-12-12 16:19:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 16:19:29,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941316518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 16:19:29,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 16:19:29,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 30 [2022-12-12 16:19:29,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688292518] [2022-12-12 16:19:29,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 16:19:29,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 16:19:29,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 16:19:29,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 16:19:29,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2022-12-12 16:19:29,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-12 16:19:29,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 2183 transitions, 51044 flow. Second operand has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:19:29,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 16:19:29,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-12 16:19:29,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 16:19:45,570 INFO L130 PetriNetUnfolder]: 13659/20096 cut-off events. [2022-12-12 16:19:45,570 INFO L131 PetriNetUnfolder]: For 589777/589777 co-relation queries the response was YES. [2022-12-12 16:19:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206288 conditions, 20096 events. 13659/20096 cut-off events. For 589777/589777 co-relation queries the response was YES. Maximal size of possible extension queue 1188. Compared 127750 event pairs, 1507 based on Foata normal form. 1/20097 useless extension candidates. Maximal degree in co-relation 205949. Up to 12287 conditions per place. [2022-12-12 16:19:45,893 INFO L137 encePairwiseOnDemand]: 11/26 looper letters, 974 selfloop transitions, 1998 changer transitions 2/2974 dead transitions. [2022-12-12 16:19:45,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 2974 transitions, 72897 flow [2022-12-12 16:19:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-12 16:19:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-12 16:19:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 403 transitions. [2022-12-12 16:19:45,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31 [2022-12-12 16:19:45,895 INFO L175 Difference]: Start difference. First operand has 447 places, 2183 transitions, 51044 flow. Second operand 50 states and 403 transitions. [2022-12-12 16:19:45,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 2974 transitions, 72897 flow [2022-12-12 16:19:50,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2974 transitions, 67742 flow, removed 2515 selfloop flow, removed 6 redundant places. [2022-12-12 16:19:50,773 INFO L231 Difference]: Finished difference. Result has 508 places, 2708 transitions, 64482 flow [2022-12-12 16:19:50,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=47228, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=64482, PETRI_PLACES=508, PETRI_TRANSITIONS=2708} [2022-12-12 16:19:50,775 INFO L295 CegarLoopForPetriNet]: 32 programPoint places, 476 predicate places. [2022-12-12 16:19:50,775 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 2708 transitions, 64482 flow [2022-12-12 16:19:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 31 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 16:19:50,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 16:19:50,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 16:19:50,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-12 16:19:50,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:19:50,983 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 16:19:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 16:19:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1397553520, now seen corresponding path program 16 times [2022-12-12 16:19:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 16:19:50,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371968131] [2022-12-12 16:19:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 16:19:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 16:19:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 16:19:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:19:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 16:19:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371968131] [2022-12-12 16:19:52,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371968131] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 16:19:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661648060] [2022-12-12 16:19:52,248 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 16:19:52,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:19:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 16:19:52,249 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 16:19:52,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-12 16:19:52,356 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 16:19:52,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 16:19:52,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-12 16:19:52,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 16:19:52,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-12 16:19:52,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:19:52,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:19:52,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 16:19:53,024 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-12 16:19:53,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 85 [2022-12-12 16:19:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 16:19:53,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 16:19:55,713 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~sum~0 c_~mts2~0))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse3 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse1 (+ c_~mts3~0 .cse2)) (.cse0 (+ (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (= .cse0 .cse1) (< .cse0 0) (= (+ c_~sum~0 .cse2 c_~mts2~0) .cse0) (< .cse1 0) (not (<= .cse0 2147483647))))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= (+ c_~sum~0 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~mts2~0) 0) (not (<= 0 (+ .cse5 c_~mts1~0 2147483648))) (not (< (+ .cse5 c_~mts1~0) 0)))))))) (or (forall ((v_ArrVal_858 (Array Int Int)) (~M~0 Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (+ c_~mts3~0 (select .cse8 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse6 (+ (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (< 0 ~M~0) (not (= .cse6 .cse7)) (< ~M~0 0) (< .cse7 0) (not (<= .cse6 2147483647)))))) (<= .cse9 c_~mts3~0)) (or (forall ((v_ArrVal_858 (Array Int Int)) (~M~0 Int) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (+ c_~mts3~0 (select .cse12 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse10 (+ (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (< 0 ~M~0) (< ~M~0 0) (= .cse10 .cse11) (< .cse10 0) (< .cse11 0) (not (<= .cse10 2147483647)))))) (< c_~mts3~0 .cse9)) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse14 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ c_~sum~0 .cse13 c_~mts2~0) 0) (<= 0 (+ c_~mts3~0 .cse13)) (not (= (+ (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0) 0)))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse17 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse15 (+ c_~mts3~0 (select .cse17 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse16 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse15 0) (not (<= 0 (+ .cse16 c_~mts1~0 2147483648))) (< .cse15 0) (not (< (+ .cse16 c_~mts1~0) 0)))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (let ((.cse20 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse20 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse18 (+ (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (< .cse18 0) (not (< (+ c_~mts3~0 .cse19) 0)) (= (+ c_~sum~0 .cse19 c_~mts2~0) .cse18) (= .cse18 0) (not (<= .cse18 2147483647)))))) (< ~M~0 0))))) is different from false [2022-12-12 16:19:55,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:19:55,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 77 [2022-12-12 16:19:55,774 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:55,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1945 treesize of output 1869 [2022-12-12 16:19:55,801 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:55,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1865 treesize of output 1757 [2022-12-12 16:19:55,832 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:55,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1753 treesize of output 1533 [2022-12-12 16:19:55,858 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:55,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1529 treesize of output 1477 [2022-12-12 16:19:55,865 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 16:19:56,062 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 16:19:56,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 109 [2022-12-12 16:19:56,097 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:56,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5222 treesize of output 5002 [2022-12-12 16:19:56,149 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:56,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4966 treesize of output 4682 [2022-12-12 16:19:56,203 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:56,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4614 treesize of output 4042 [2022-12-12 16:19:56,315 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-12 16:19:56,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2552 treesize of output 2412 Received shutdown request... [2022-12-12 16:24:42,832 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-12 16:24:42,833 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 16:24:42,834 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-12 16:24:42,834 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 16:24:42,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-12 16:24:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 16:24:43,035 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. [2022-12-12 16:24:43,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-12 16:24:43,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-12 16:24:43,052 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-12 16:24:43,053 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1, 1, 1, 1] [2022-12-12 16:24:43,057 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 16:24:43,057 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 16:24:43,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 04:24:43 BasicIcfg [2022-12-12 16:24:43,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 16:24:43,063 INFO L158 Benchmark]: Toolchain (without parser) took 809023.55ms. Allocated memory was 199.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 165.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-12 16:24:43,063 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 199.2MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 16:24:43,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.69ms. Allocated memory is still 199.2MB. Free memory was 164.7MB in the beginning and 152.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 16:24:43,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.99ms. Allocated memory is still 199.2MB. Free memory was 152.6MB in the beginning and 150.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 16:24:43,064 INFO L158 Benchmark]: Boogie Preprocessor took 48.99ms. Allocated memory is still 199.2MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 16:24:43,064 INFO L158 Benchmark]: RCFGBuilder took 672.86ms. Allocated memory is still 199.2MB. Free memory was 148.4MB in the beginning and 112.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-12 16:24:43,065 INFO L158 Benchmark]: TraceAbstraction took 807932.07ms. Allocated memory was 199.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 111.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-12 16:24:43,067 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 199.2MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.69ms. Allocated memory is still 199.2MB. Free memory was 164.7MB in the beginning and 152.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.99ms. Allocated memory is still 199.2MB. Free memory was 152.6MB in the beginning and 150.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.99ms. Allocated memory is still 199.2MB. Free memory was 150.5MB in the beginning and 148.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 672.86ms. Allocated memory is still 199.2MB. Free memory was 148.4MB in the beginning and 112.8MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 807932.07ms. Allocated memory was 199.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 111.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 182 PlacesBefore, 32 PlacesAfterwards, 190 TransitionsBefore, 26 TransitionsAfterwards, 7140 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 68 TrivialYvCompositions, 82 ConcurrentYvCompositions, 14 ChoiceCompositions, 164 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 4509, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4534, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4211, independent: 4192, independent conditional: 0, independent unconditional: 4192, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4211, independent: 4192, independent conditional: 0, independent unconditional: 4192, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4534, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 4211, unknown conditional: 0, unknown unconditional: 4211] , Statistics on independence cache: Total cache size (in pairs): 7813, Positive cache size: 7794, Positive conditional cache size: 0, Positive unconditional cache size: 7794, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 270 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 807.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 379.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 68 mSolverCounterUnknown, 4167 SdHoareTripleChecker+Valid, 36.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4167 mSDsluCounter, 1389 SdHoareTripleChecker+Invalid, 34.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 483 IncrementalHoareTripleChecker+Unchecked, 1267 mSDsCounter, 356 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22661 IncrementalHoareTripleChecker+Invalid, 23568 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 356 mSolverCounterUnsat, 122 mSDtfsCounter, 22661 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1280 GetRequests, 484 SyntacticMatches, 9 SemanticMatches, 787 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 10215 ImplicationChecksByTransitivity, 327.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64482occurred in iteration=19, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 122.4s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1203 ConstructedInterpolants, 62 QuantifiedInterpolants, 58589 SizeOfPredicates, 458 NumberOfNonLiveVariables, 4374 ConjunctsInSsa, 951 ConjunctsInUnsatCore, 53 InterpolantComputations, 3 PerfectInterpolantSequences, 15/148 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown