./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:14:07,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:14:07,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:14:07,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:14:07,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:14:07,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:14:07,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:14:07,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:14:07,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:14:07,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:14:07,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:14:07,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:14:07,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:14:07,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:14:07,568 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:14:07,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:14:07,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:14:07,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:14:07,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:14:07,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:14:07,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:14:07,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:14:07,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:14:07,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:14:07,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:14:07,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:14:07,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:14:07,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:14:07,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:14:07,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:14:07,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:14:07,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:14:07,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:14:07,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:14:07,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:14:07,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:14:07,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:14:07,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:14:07,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:14:07,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:14:07,575 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:14:07,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:14:07,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:14:07,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612 [2024-01-27 15:14:07,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:14:07,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:14:07,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:14:07,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:14:07,816 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:14:07,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-27 15:14:08,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:14:08,993 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:14:08,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-27 15:14:09,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07508c1d/6e6b398d2db448128c102cf936fd7232/FLAGb51184f88 [2024-01-27 15:14:09,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07508c1d/6e6b398d2db448128c102cf936fd7232 [2024-01-27 15:14:09,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:14:09,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:14:09,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:14:09,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:14:09,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:14:09,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17149ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09, skipping insertion in model container [2024-01-27 15:14:09,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:14:09,160 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-27 15:14:09,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:14:09,169 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:14:09,184 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-27 15:14:09,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:14:09,201 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:14:09,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09 WrapperNode [2024-01-27 15:14:09,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:14:09,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:14:09,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:14:09,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:14:09,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,238 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-01-27 15:14:09,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:14:09,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:14:09,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:14:09,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:14:09,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,263 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-27 15:14:09,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,284 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:14:09,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:14:09,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:14:09,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:14:09,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (1/1) ... [2024-01-27 15:14:09,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:14:09,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:14:09,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:14:09,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:14:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:14:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:14:09,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:14:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:14:09,361 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:14:09,361 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:14:09,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:14:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 15:14:09,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 15:14:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:14:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:14:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:14:09,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:14:09,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:14:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:14:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:14:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:14:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:14:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:14:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:14:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:14:09,366 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:14:09,456 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:14:09,458 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:14:09,599 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:14:09,600 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:14:09,728 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:14:09,728 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 15:14:09,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:14:09 BoogieIcfgContainer [2024-01-27 15:14:09,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:14:09,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:14:09,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:14:09,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:14:09,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:14:09" (1/3) ... [2024-01-27 15:14:09,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782e21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:14:09, skipping insertion in model container [2024-01-27 15:14:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:09" (2/3) ... [2024-01-27 15:14:09,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782e21d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:14:09, skipping insertion in model container [2024-01-27 15:14:09,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:14:09" (3/3) ... [2024-01-27 15:14:09,737 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-01-27 15:14:09,743 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:14:09,749 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:14:09,749 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:14:09,749 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:14:09,791 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-27 15:14:09,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 98 flow [2024-01-27 15:14:09,856 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-01-27 15:14:09,856 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:14:09,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-01-27 15:14:09,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 35 transitions, 98 flow [2024-01-27 15:14:09,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2024-01-27 15:14:09,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:14:09,886 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1cc9b8b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:14:09,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-01-27 15:14:09,906 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:14:09,907 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2024-01-27 15:14:09,907 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-27 15:14:09,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:09,907 INFO L208 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, 1, 1] [2024-01-27 15:14:09,908 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 2 more)] === [2024-01-27 15:14:09,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1037175478, now seen corresponding path program 1 times [2024-01-27 15:14:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702464223] [2024-01-27 15:14:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:10,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:10,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:10,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702464223] [2024-01-27 15:14:10,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702464223] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:10,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:10,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:14:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862708332] [2024-01-27 15:14:10,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:10,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:14:10,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:10,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:14:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:14:10,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:10,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2024-01-27 15:14:10,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:10,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:10,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:10,805 INFO L124 PetriNetUnfolderBase]: 1537/1955 cut-off events. [2024-01-27 15:14:10,805 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-01-27 15:14:10,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1955 events. 1537/1955 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6388 event pairs, 141 based on Foata normal form. 1/1134 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2024-01-27 15:14:10,821 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 41 selfloop transitions, 5 changer transitions 1/52 dead transitions. [2024-01-27 15:14:10,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 243 flow [2024-01-27 15:14:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:14:10,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:14:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-01-27 15:14:10,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-01-27 15:14:10,835 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 84 flow. Second operand 3 states and 75 transitions. [2024-01-27 15:14:10,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 243 flow [2024-01-27 15:14:10,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-27 15:14:10,844 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 101 flow [2024-01-27 15:14:10,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-01-27 15:14:10,850 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2024-01-27 15:14:10,850 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 101 flow [2024-01-27 15:14:10,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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) [2024-01-27 15:14:10,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:10,851 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:14:10,852 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 2 more)] === [2024-01-27 15:14:10,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:10,853 INFO L85 PathProgramCache]: Analyzing trace with hash 442976563, now seen corresponding path program 1 times [2024-01-27 15:14:10,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864447917] [2024-01-27 15:14:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:10,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864447917] [2024-01-27 15:14:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864447917] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:10,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:10,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:14:10,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516118468] [2024-01-27 15:14:10,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:10,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:14:10,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:10,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:14:10,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:14:10,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:10,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:10,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:10,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:10,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:11,256 INFO L124 PetriNetUnfolderBase]: 1843/2368 cut-off events. [2024-01-27 15:14:11,257 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2024-01-27 15:14:11,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 2368 events. 1843/2368 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8349 event pairs, 139 based on Foata normal form. 34/2396 useless extension candidates. Maximal degree in co-relation 1448. Up to 967 conditions per place. [2024-01-27 15:14:11,271 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2024-01-27 15:14:11,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 87 transitions, 415 flow [2024-01-27 15:14:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-01-27 15:14:11,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2024-01-27 15:14:11,275 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 101 flow. Second operand 5 states and 121 transitions. [2024-01-27 15:14:11,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 87 transitions, 415 flow [2024-01-27 15:14:11,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:14:11,281 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 161 flow [2024-01-27 15:14:11,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2024-01-27 15:14:11,282 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2024-01-27 15:14:11,283 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 161 flow [2024-01-27 15:14:11,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:11,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:11,283 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:14:11,283 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 2 more)] === [2024-01-27 15:14:11,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1961728037, now seen corresponding path program 1 times [2024-01-27 15:14:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:11,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843187336] [2024-01-27 15:14:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:11,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843187336] [2024-01-27 15:14:11,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843187336] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:11,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:11,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:14:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90218195] [2024-01-27 15:14:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:11,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:14:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:14:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:14:11,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:11,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:11,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:11,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:11,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:11,640 INFO L124 PetriNetUnfolderBase]: 2211/2949 cut-off events. [2024-01-27 15:14:11,640 INFO L125 PetriNetUnfolderBase]: For 3566/3566 co-relation queries the response was YES. [2024-01-27 15:14:11,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8999 conditions, 2949 events. 2211/2949 cut-off events. For 3566/3566 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11970 event pairs, 330 based on Foata normal form. 80/3001 useless extension candidates. Maximal degree in co-relation 3490. Up to 1265 conditions per place. [2024-01-27 15:14:11,657 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 90 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2024-01-27 15:14:11,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 103 transitions, 615 flow [2024-01-27 15:14:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-01-27 15:14:11,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-01-27 15:14:11,661 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 161 flow. Second operand 5 states and 119 transitions. [2024-01-27 15:14:11,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 103 transitions, 615 flow [2024-01-27 15:14:11,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 103 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:14:11,666 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 216 flow [2024-01-27 15:14:11,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2024-01-27 15:14:11,667 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2024-01-27 15:14:11,667 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 216 flow [2024-01-27 15:14:11,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:11,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:11,668 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:11,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:14:11,668 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 2 more)] === [2024-01-27 15:14:11,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1597391429, now seen corresponding path program 2 times [2024-01-27 15:14:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:11,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233124669] [2024-01-27 15:14:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:11,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:11,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233124669] [2024-01-27 15:14:11,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233124669] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:11,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:11,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:14:11,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919549189] [2024-01-27 15:14:11,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:11,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:14:11,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:14:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:14:11,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:11,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:11,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:11,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:11,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:11,997 INFO L124 PetriNetUnfolderBase]: 2111/2831 cut-off events. [2024-01-27 15:14:11,997 INFO L125 PetriNetUnfolderBase]: For 4771/4771 co-relation queries the response was YES. [2024-01-27 15:14:12,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10429 conditions, 2831 events. 2111/2831 cut-off events. For 4771/4771 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11723 event pairs, 435 based on Foata normal form. 104/2923 useless extension candidates. Maximal degree in co-relation 5299. Up to 1605 conditions per place. [2024-01-27 15:14:12,015 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 90 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2024-01-27 15:14:12,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 105 transitions, 677 flow [2024-01-27 15:14:12,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-01-27 15:14:12,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2024-01-27 15:14:12,017 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 216 flow. Second operand 5 states and 121 transitions. [2024-01-27 15:14:12,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 105 transitions, 677 flow [2024-01-27 15:14:12,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 105 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:14:12,024 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 270 flow [2024-01-27 15:14:12,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-01-27 15:14:12,025 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2024-01-27 15:14:12,025 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 270 flow [2024-01-27 15:14:12,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:12,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:12,025 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:12,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:14:12,025 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 2 more)] === [2024-01-27 15:14:12,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:12,026 INFO L85 PathProgramCache]: Analyzing trace with hash -883981246, now seen corresponding path program 1 times [2024-01-27 15:14:12,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:12,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717492500] [2024-01-27 15:14:12,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:12,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:12,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717492500] [2024-01-27 15:14:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717492500] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:12,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:14:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063287866] [2024-01-27 15:14:12,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:12,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:14:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:12,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:14:12,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:14:12,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:12,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:12,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:12,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:12,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:12,353 INFO L124 PetriNetUnfolderBase]: 2045/2752 cut-off events. [2024-01-27 15:14:12,353 INFO L125 PetriNetUnfolderBase]: For 7525/7525 co-relation queries the response was YES. [2024-01-27 15:14:12,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11166 conditions, 2752 events. 2045/2752 cut-off events. For 7525/7525 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11527 event pairs, 165 based on Foata normal form. 66/2814 useless extension candidates. Maximal degree in co-relation 5677. Up to 1169 conditions per place. [2024-01-27 15:14:12,378 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-01-27 15:14:12,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 104 transitions, 701 flow [2024-01-27 15:14:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-01-27 15:14:12,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2024-01-27 15:14:12,381 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 270 flow. Second operand 5 states and 120 transitions. [2024-01-27 15:14:12,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 104 transitions, 701 flow [2024-01-27 15:14:12,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 692 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:14:12,393 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 275 flow [2024-01-27 15:14:12,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-01-27 15:14:12,396 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2024-01-27 15:14:12,396 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 275 flow [2024-01-27 15:14:12,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:12,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:12,396 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:12,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:14:12,397 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 2 more)] === [2024-01-27 15:14:12,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash -359156568, now seen corresponding path program 1 times [2024-01-27 15:14:12,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620411787] [2024-01-27 15:14:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:12,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:12,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620411787] [2024-01-27 15:14:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620411787] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:14:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978001502] [2024-01-27 15:14:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:12,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:14:12,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:12,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:14:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:14:12,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:12,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:12,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:12,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:12,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:12,717 INFO L124 PetriNetUnfolderBase]: 2003/2728 cut-off events. [2024-01-27 15:14:12,717 INFO L125 PetriNetUnfolderBase]: For 8510/8516 co-relation queries the response was YES. [2024-01-27 15:14:12,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11350 conditions, 2728 events. 2003/2728 cut-off events. For 8510/8516 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11099 event pairs, 75 based on Foata normal form. 43/2751 useless extension candidates. Maximal degree in co-relation 5727. Up to 1137 conditions per place. [2024-01-27 15:14:12,736 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 104 selfloop transitions, 10 changer transitions 0/119 dead transitions. [2024-01-27 15:14:12,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 119 transitions, 937 flow [2024-01-27 15:14:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:12,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-01-27 15:14:12,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2024-01-27 15:14:12,737 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 275 flow. Second operand 5 states and 117 transitions. [2024-01-27 15:14:12,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 119 transitions, 937 flow [2024-01-27 15:14:12,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 119 transitions, 912 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-27 15:14:12,744 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 329 flow [2024-01-27 15:14:12,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2024-01-27 15:14:12,747 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2024-01-27 15:14:12,747 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 329 flow [2024-01-27 15:14:12,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:12,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:12,747 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:12,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:14:12,747 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 2 more)] === [2024-01-27 15:14:12,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash -505749815, now seen corresponding path program 2 times [2024-01-27 15:14:12,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:12,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649063370] [2024-01-27 15:14:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:12,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:12,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649063370] [2024-01-27 15:14:12,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649063370] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:12,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:12,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:14:12,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447344993] [2024-01-27 15:14:12,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:12,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:14:12,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:12,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:14:12,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:14:12,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:12,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:12,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:12,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:12,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:13,042 INFO L124 PetriNetUnfolderBase]: 1801/2440 cut-off events. [2024-01-27 15:14:13,042 INFO L125 PetriNetUnfolderBase]: For 7814/7820 co-relation queries the response was YES. [2024-01-27 15:14:13,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10810 conditions, 2440 events. 1801/2440 cut-off events. For 7814/7820 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9481 event pairs, 99 based on Foata normal form. 39/2459 useless extension candidates. Maximal degree in co-relation 6696. Up to 987 conditions per place. [2024-01-27 15:14:13,056 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 98 selfloop transitions, 9 changer transitions 4/116 dead transitions. [2024-01-27 15:14:13,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 116 transitions, 917 flow [2024-01-27 15:14:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-01-27 15:14:13,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2024-01-27 15:14:13,058 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 329 flow. Second operand 5 states and 116 transitions. [2024-01-27 15:14:13,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 116 transitions, 917 flow [2024-01-27 15:14:13,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 904 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-27 15:14:13,068 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 329 flow [2024-01-27 15:14:13,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-01-27 15:14:13,068 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2024-01-27 15:14:13,068 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 329 flow [2024-01-27 15:14:13,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2024-01-27 15:14:13,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:13,069 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:13,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:14:13,069 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 2 more)] === [2024-01-27 15:14:13,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1770117446, now seen corresponding path program 2 times [2024-01-27 15:14:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342071494] [2024-01-27 15:14:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342071494] [2024-01-27 15:14:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342071494] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:14:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247906193] [2024-01-27 15:14:13,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:14:13,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:14:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:14:13,169 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) [2024-01-27 15:14:13,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:14:13,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:14:13,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:14:13,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:14:13,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:14:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:13,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:14:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247906193] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:14:13,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:14:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-27 15:14:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196305408] [2024-01-27 15:14:13,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:14:13,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:14:13,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:13,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:14:13,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:14:13,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:13,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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) [2024-01-27 15:14:13,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:13,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:13,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:13,713 INFO L124 PetriNetUnfolderBase]: 1725/2376 cut-off events. [2024-01-27 15:14:13,713 INFO L125 PetriNetUnfolderBase]: For 8083/8089 co-relation queries the response was YES. [2024-01-27 15:14:13,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10854 conditions, 2376 events. 1725/2376 cut-off events. For 8083/8089 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 9815 event pairs, 293 based on Foata normal form. 77/2433 useless extension candidates. Maximal degree in co-relation 6831. Up to 1307 conditions per place. [2024-01-27 15:14:13,732 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 101 selfloop transitions, 8 changer transitions 0/114 dead transitions. [2024-01-27 15:14:13,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 114 transitions, 929 flow [2024-01-27 15:14:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-01-27 15:14:13,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6457142857142857 [2024-01-27 15:14:13,734 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 329 flow. Second operand 5 states and 113 transitions. [2024-01-27 15:14:13,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 114 transitions, 929 flow [2024-01-27 15:14:13,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 114 transitions, 920 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:14:13,741 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 370 flow [2024-01-27 15:14:13,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2024-01-27 15:14:13,741 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2024-01-27 15:14:13,741 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 370 flow [2024-01-27 15:14:13,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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) [2024-01-27 15:14:13,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:13,742 INFO L208 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, 1, 1, 1] [2024-01-27 15:14:13,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:14:13,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:14:13,956 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 2 more)] === [2024-01-27 15:14:13,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1778441492, now seen corresponding path program 2 times [2024-01-27 15:14:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485321140] [2024-01-27 15:14:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485321140] [2024-01-27 15:14:14,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485321140] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:14:14,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146795481] [2024-01-27 15:14:14,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:14:14,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:14:14,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:14:14,010 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) [2024-01-27 15:14:14,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:14:14,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:14:14,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:14:14,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:14:14,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:14:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:14,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:14:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146795481] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:14:14,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:14:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-01-27 15:14:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808312959] [2024-01-27 15:14:14,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:14:14,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:14:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:14:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:14:14,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:14:14,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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) [2024-01-27 15:14:14,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:14,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:14:14,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:14:14,474 INFO L124 PetriNetUnfolderBase]: 1657/2291 cut-off events. [2024-01-27 15:14:14,474 INFO L125 PetriNetUnfolderBase]: For 8485/8485 co-relation queries the response was YES. [2024-01-27 15:14:14,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11190 conditions, 2291 events. 1657/2291 cut-off events. For 8485/8485 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9706 event pairs, 481 based on Foata normal form. 68/2348 useless extension candidates. Maximal degree in co-relation 9804. Up to 1331 conditions per place. [2024-01-27 15:14:14,488 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 117 selfloop transitions, 8 changer transitions 0/130 dead transitions. [2024-01-27 15:14:14,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1118 flow [2024-01-27 15:14:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:14:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:14:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-01-27 15:14:14,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2024-01-27 15:14:14,489 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 370 flow. Second operand 5 states and 117 transitions. [2024-01-27 15:14:14,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1118 flow [2024-01-27 15:14:14,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 130 transitions, 1060 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-01-27 15:14:14,498 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 407 flow [2024-01-27 15:14:14,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2024-01-27 15:14:14,498 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 34 predicate places. [2024-01-27 15:14:14,498 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 407 flow [2024-01-27 15:14:14,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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) [2024-01-27 15:14:14,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:14,499 INFO L208 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, 1, 1, 1, 1] [2024-01-27 15:14:14,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-27 15:14:14,710 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,SelfDestructingSolverStorable8 [2024-01-27 15:14:14,710 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 2 more)] === [2024-01-27 15:14:14,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 992173959, now seen corresponding path program 1 times [2024-01-27 15:14:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702176154] [2024-01-27 15:14:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702176154] [2024-01-27 15:14:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702176154] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:14:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838871115] [2024-01-27 15:14:15,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:14:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:14:15,173 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) [2024-01-27 15:14:15,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:14:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:15,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:14:15,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:15:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:15:07,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:15:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:15:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838871115] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:15:16,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:15:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-01-27 15:15:16,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347670992] [2024-01-27 15:15:16,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:15:16,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:15:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:16,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:15:16,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=168, Unknown=3, NotChecked=0, Total=240 [2024-01-27 15:15:16,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:15:16,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 407 flow. Second operand has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 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) [2024-01-27 15:15:16,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:16,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:15:16,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:29,287 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification. DAG size of input: 76 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:15:33,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:15:37,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:15:40,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:15:48,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:15:51,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:15:57,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:01,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:05,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:09,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:13,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:15,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:19,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:23,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:27,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:35,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:51,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:55,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:57,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:04,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:08,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:12,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:14,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:18,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:23,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:25,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:26,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:27,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:30,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:34,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:37,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:40,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:17:40,336 INFO L124 PetriNetUnfolderBase]: 3505/4891 cut-off events. [2024-01-27 15:17:40,337 INFO L125 PetriNetUnfolderBase]: For 16709/16709 co-relation queries the response was YES. [2024-01-27 15:17:40,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24684 conditions, 4891 events. 3505/4891 cut-off events. For 16709/16709 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 23765 event pairs, 201 based on Foata normal form. 25/4905 useless extension candidates. Maximal degree in co-relation 22644. Up to 2591 conditions per place. [2024-01-27 15:17:40,372 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 245 selfloop transitions, 91 changer transitions 20/361 dead transitions. [2024-01-27 15:17:40,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 361 transitions, 2846 flow [2024-01-27 15:17:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:17:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:17:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 410 transitions. [2024-01-27 15:17:40,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2024-01-27 15:17:40,374 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 407 flow. Second operand 16 states and 410 transitions. [2024-01-27 15:17:40,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 361 transitions, 2846 flow [2024-01-27 15:17:40,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 361 transitions, 2825 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-01-27 15:17:40,394 INFO L231 Difference]: Finished difference. Result has 97 places, 147 transitions, 1539 flow [2024-01-27 15:17:40,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1539, PETRI_PLACES=97, PETRI_TRANSITIONS=147} [2024-01-27 15:17:40,395 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 58 predicate places. [2024-01-27 15:17:40,395 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 147 transitions, 1539 flow [2024-01-27 15:17:40,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.8125) internal successors, (205), 16 states have internal predecessors, (205), 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) [2024-01-27 15:17:40,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:17:40,396 INFO L208 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, 1, 1, 1, 1] [2024-01-27 15:17:40,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:17:40,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:17:40,607 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 2 more)] === [2024-01-27 15:17:40,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:17:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -587318309, now seen corresponding path program 1 times [2024-01-27 15:17:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:17:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477172804] [2024-01-27 15:17:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:17:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:17:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:17:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:17:40,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:17:40,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477172804] [2024-01-27 15:17:40,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477172804] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:17:40,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033827375] [2024-01-27 15:17:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:17:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:17:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:17:40,988 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) [2024-01-27 15:17:41,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:17:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:17:41,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:17:41,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:18:17,060 WARN L293 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 31 DAG size of output: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:18:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:18:17,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:18:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:18:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033827375] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:18:18,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:18:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-01-27 15:18:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264615794] [2024-01-27 15:18:18,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:18:18,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:18:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:18:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:18:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=168, Unknown=2, NotChecked=0, Total=240 [2024-01-27 15:18:18,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:18:18,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 147 transitions, 1539 flow. Second operand has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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) [2024-01-27 15:18:18,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:18:18,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:18:18,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:18:27,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:18:31,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:18:33,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:18:33,256 INFO L124 PetriNetUnfolderBase]: 4973/6935 cut-off events. [2024-01-27 15:18:33,256 INFO L125 PetriNetUnfolderBase]: For 35041/35041 co-relation queries the response was YES. [2024-01-27 15:18:33,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39350 conditions, 6935 events. 4973/6935 cut-off events. For 35041/35041 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 35290 event pairs, 451 based on Foata normal form. 19/6943 useless extension candidates. Maximal degree in co-relation 36968. Up to 4984 conditions per place. [2024-01-27 15:18:33,306 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 297 selfloop transitions, 100 changer transitions 28/430 dead transitions. [2024-01-27 15:18:33,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 430 transitions, 4304 flow [2024-01-27 15:18:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:18:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:18:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 382 transitions. [2024-01-27 15:18:33,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6821428571428572 [2024-01-27 15:18:33,308 INFO L175 Difference]: Start difference. First operand has 97 places, 147 transitions, 1539 flow. Second operand 16 states and 382 transitions. [2024-01-27 15:18:33,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 430 transitions, 4304 flow [2024-01-27 15:18:33,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 430 transitions, 4055 flow, removed 122 selfloop flow, removed 1 redundant places. [2024-01-27 15:18:33,401 INFO L231 Difference]: Finished difference. Result has 121 places, 245 transitions, 2679 flow [2024-01-27 15:18:33,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2679, PETRI_PLACES=121, PETRI_TRANSITIONS=245} [2024-01-27 15:18:33,401 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 82 predicate places. [2024-01-27 15:18:33,401 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 245 transitions, 2679 flow [2024-01-27 15:18:33,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 13.0625) internal successors, (209), 16 states have internal predecessors, (209), 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) [2024-01-27 15:18:33,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:18:33,402 INFO L208 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, 1, 1, 1, 1] [2024-01-27 15:18:33,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:18:33,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:18:33,603 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 2 more)] === [2024-01-27 15:18:33,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:18:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1692635611, now seen corresponding path program 2 times [2024-01-27 15:18:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:18:33,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172294625] [2024-01-27 15:18:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:18:33,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:18:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:18:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:18:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:18:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172294625] [2024-01-27 15:18:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172294625] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:18:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596624900] [2024-01-27 15:18:33,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:18:33,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:18:33,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:18:33,973 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) [2024-01-27 15:18:33,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:18:34,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:18:34,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:18:34,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:18:34,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:20:08,409 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:21:07,706 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:21:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:21:20,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:22:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:22:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596624900] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:22:12,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:22:12,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2024-01-27 15:22:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321361286] [2024-01-27 15:22:12,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:22:12,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 15:22:12,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:22:12,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 15:22:12,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=177, Unknown=34, NotChecked=0, Total=272 [2024-01-27 15:22:12,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:22:12,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 245 transitions, 2679 flow. Second operand has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 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) [2024-01-27 15:22:12,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:22:12,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:22:12,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:22:22,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:22:28,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:22:32,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:22:36,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:22:38,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:22:54,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:22:58,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:02,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:04,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:10,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:24,122 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:23:28,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:32,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:37,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:47,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:51,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:52,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:23:53,273 INFO L124 PetriNetUnfolderBase]: 6631/9250 cut-off events. [2024-01-27 15:23:53,273 INFO L125 PetriNetUnfolderBase]: For 58355/58355 co-relation queries the response was YES. [2024-01-27 15:23:53,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55518 conditions, 9250 events. 6631/9250 cut-off events. For 58355/58355 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 48854 event pairs, 531 based on Foata normal form. 33/9272 useless extension candidates. Maximal degree in co-relation 54866. Up to 6995 conditions per place. [2024-01-27 15:23:53,341 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 391 selfloop transitions, 121 changer transitions 16/533 dead transitions. [2024-01-27 15:23:53,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 533 transitions, 6121 flow [2024-01-27 15:23:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 15:23:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 15:23:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 376 transitions. [2024-01-27 15:23:53,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2024-01-27 15:23:53,343 INFO L175 Difference]: Start difference. First operand has 121 places, 245 transitions, 2679 flow. Second operand 16 states and 376 transitions. [2024-01-27 15:23:53,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 533 transitions, 6121 flow [2024-01-27 15:23:53,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 533 transitions, 5762 flow, removed 177 selfloop flow, removed 1 redundant places. [2024-01-27 15:23:53,574 INFO L231 Difference]: Finished difference. Result has 146 places, 353 transitions, 4175 flow [2024-01-27 15:23:53,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2342, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4175, PETRI_PLACES=146, PETRI_TRANSITIONS=353} [2024-01-27 15:23:53,575 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-01-27 15:23:53,575 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 353 transitions, 4175 flow [2024-01-27 15:23:53,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.823529411764707) internal successors, (218), 17 states have internal predecessors, (218), 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) [2024-01-27 15:23:53,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:23:53,576 INFO L208 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, 1, 1, 1, 1] [2024-01-27 15:23:53,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:23:53,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-27 15:23:53,788 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 2 more)] === [2024-01-27 15:23:53,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:23:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash 121156333, now seen corresponding path program 2 times [2024-01-27 15:23:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:23:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575633904] [2024-01-27 15:23:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:23:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:23:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:23:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:23:54,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:23:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575633904] [2024-01-27 15:23:54,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575633904] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:23:54,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411444837] [2024-01-27 15:23:54,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:23:54,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:23:54,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:23:54,132 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) [2024-01-27 15:23:54,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-27 15:23:54,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:23:54,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:23:54,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:23:54,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:25:08,670 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:25:56,918 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:26:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:26:50,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:27:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:27:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411444837] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:27:42,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:27:42,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2024-01-27 15:27:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237127531] [2024-01-27 15:27:42,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:27:42,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 15:27:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:27:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 15:27:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=190, Unknown=30, NotChecked=0, Total=272 [2024-01-27 15:27:42,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-01-27 15:27:42,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 353 transitions, 4175 flow. Second operand has 17 states, 17 states have (on average 12.588235294117647) internal successors, (214), 17 states have internal predecessors, (214), 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) [2024-01-27 15:27:42,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:27:42,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-01-27 15:27:42,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:28:10,451 WARN L293 SmtUtils]: Spent 18.00s on a formula simplification. DAG size of input: 78 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:28:13,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:28:17,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) c_~x2~0)) (.cse8 (* 4294967296 (div c_~n~0 4294967296))) (.cse7 (* c_~x1~0 2)) (.cse6 (* (div c_~x2~0 4294967296) 4294967296))) (let ((.cse4 (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296)))) (.cse10 (+ .cse7 .cse6)) (.cse3 (mod c_~x1~0 4294967296)) (.cse0 (+ .cse7 .cse8)) (.cse9 (* (div (+ .cse7 .cse1) 4294967296) 4294967296)) (.cse5 (mod c_~n~0 4294967296)) (.cse11 (mod c_~x2~0 4294967296)) (.cse2 (mod c_~x3~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 (+ c_~x2~0 (* (div (+ (- 1) (* (div (+ (- 1) c_~x1~0 .cse1 c_~n~0) 2147483648) 2147483648) c_~x1~0) 4294967296) 4294967296))) (= .cse2 (mod c_~x4~0 4294967296)) (= (mod (* (div .cse1 2) 4294967295) 4294967296) .cse3) .cse4 (or (< .cse3 .cse5) (and .cse4 (= (+ c_~x1~0 .cse6) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)))) (<= (+ .cse7 2 .cse8) (+ .cse9 c_~x2~0 c_~n~0)) (<= .cse10 (+ (* (div (+ (- 1) (* (div (+ (- 1) c_~x1~0) 2147483648) 2147483648) c_~x1~0) 4294967296) 4294967296) c_~x2~0)) (<= 1 .cse3) (let ((.cse12 (+ .cse3 1))) (or (and .cse4 (= (+ (* (div c_~x1~0 2147483648) 4294967296) c_~x2~0) .cse10)) (< .cse11 .cse12) (< (* 2 (mod c_~x1~0 2147483648)) .cse12))) (<= .cse0 (+ .cse9 c_~n~0 .cse6 4294967293)) (<= .cse5 .cse11) (<= 1 .cse2)))) is different from false [2024-01-27 15:28:21,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:28:33,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15