./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.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/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:49:28,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:49:28,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:49:28,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:49:28,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:49:28,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:49:28,317 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:49:28,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:49:28,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:49:28,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:49:28,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:49:28,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:49:28,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:49:28,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:49:28,320 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:49:28,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:49:28,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:49:28,326 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:49:28,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:49:28,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:49:28,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:49:28,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:49:28,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:49:28,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:49:28,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:49:28,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:49:28,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:49:28,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:49:28,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:49:28,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:49:28,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:49:28,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:49:28,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:49:28,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:49:28,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:49:28,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:49:28,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:49:28,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:49:28,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:49:28,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:49:28,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:49:28,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:49:28,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:49:28,331 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-01-27 15:49:28,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:49:28,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:49:28,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:49:28,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:49:28,550 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:49:28,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-01-27 15:49:29,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:49:29,871 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:49:29,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-01-27 15:49:29,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97602afd/91e0d1328330455a9e4de72e0a523893/FLAG01af6d23f [2024-01-27 15:49:29,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97602afd/91e0d1328330455a9e4de72e0a523893 [2024-01-27 15:49:29,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:49:29,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:49:29,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:49:29,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:49:29,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:49:29,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:49:29" (1/1) ... [2024-01-27 15:49:29,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b6c2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:29, skipping insertion in model container [2024-01-27 15:49:29,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:49:29" (1/1) ... [2024-01-27 15:49:29,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:49:30,109 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/popl20-more-vector-add.wvr.c[2637,2650] [2024-01-27 15:49:30,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:49:30,124 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:49:30,144 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/popl20-more-vector-add.wvr.c[2637,2650] [2024-01-27 15:49:30,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:49:30,166 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:49:30,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30 WrapperNode [2024-01-27 15:49:30,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:49:30,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:49:30,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:49:30,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:49:30,175 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:49:30" (1/1) ... [2024-01-27 15:49:30,182 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:49:30" (1/1) ... [2024-01-27 15:49:30,201 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 203 [2024-01-27 15:49:30,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:49:30,206 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:49:30,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:49:30,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:49:30,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,232 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 15, 2, 2, 2]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2024-01-27 15:49:30,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:49:30,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:49:30,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:49:30,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:49:30,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (1/1) ... [2024-01-27 15:49:30,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:49:30,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:30,308 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:49:30,318 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:49:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:49:30,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:49:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:49:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:49:30,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:49:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:49:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:49:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:49:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:49:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:49:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:49:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:49:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:49:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:49:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:49:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:49:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:49:30,366 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:49:30,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:49:30,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:49:30,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:49:30,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:49:30,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:49:30,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:49:30,374 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:49:30,486 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:49:30,487 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:49:30,820 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:49:30,820 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:49:31,127 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:49:31,127 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-27 15:49:31,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:49:31 BoogieIcfgContainer [2024-01-27 15:49:31,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:49:31,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:49:31,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:49:31,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:49:31,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:49:29" (1/3) ... [2024-01-27 15:49:31,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7246fdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:49:31, skipping insertion in model container [2024-01-27 15:49:31,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:49:30" (2/3) ... [2024-01-27 15:49:31,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7246fdd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:49:31, skipping insertion in model container [2024-01-27 15:49:31,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:49:31" (3/3) ... [2024-01-27 15:49:31,139 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-01-27 15:49:31,150 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:49:31,161 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:49:31,162 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:49:31,162 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:49:31,211 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:49:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2024-01-27 15:49:31,304 INFO L124 PetriNetUnfolderBase]: 7/32 cut-off events. [2024-01-27 15:49:31,304 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:49:31,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 7/32 cut-off events. For 3/3 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/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-01-27 15:49:31,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2024-01-27 15:49:31,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 80 flow [2024-01-27 15:49:31,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:49:31,324 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;@22e59c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:49:31,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:49:31,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:49:31,335 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2024-01-27 15:49:31,335 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:49:31,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:31,335 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] [2024-01-27 15:49:31,336 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:31,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1834515043, now seen corresponding path program 1 times [2024-01-27 15:49:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:31,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290456855] [2024-01-27 15:49:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:31,911 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:49:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:31,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290456855] [2024-01-27 15:49:31,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290456855] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:49:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:49:31,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:49:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773185429] [2024-01-27 15:49:31,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:49:31,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:49:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:31,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:49:31,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:49:31,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:31,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:49:31,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:31,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:31,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:32,243 INFO L124 PetriNetUnfolderBase]: 447/668 cut-off events. [2024-01-27 15:49:32,244 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-01-27 15:49:32,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 668 events. 447/668 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1883 event pairs, 276 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 534. Up to 334 conditions per place. [2024-01-27 15:49:32,252 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 26 selfloop transitions, 8 changer transitions 27/62 dead transitions. [2024-01-27 15:49:32,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 282 flow [2024-01-27 15:49:32,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:49:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:49:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-01-27 15:49:32,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-01-27 15:49:32,266 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 5 states and 85 transitions. [2024-01-27 15:49:32,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 282 flow [2024-01-27 15:49:32,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 62 transitions, 258 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:49:32,276 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 120 flow [2024-01-27 15:49:32,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2024-01-27 15:49:32,281 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-01-27 15:49:32,281 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 35 transitions, 120 flow [2024-01-27 15:49:32,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:49:32,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:32,282 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:49:32,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:49:32,282 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:32,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:32,283 INFO L85 PathProgramCache]: Analyzing trace with hash 731932584, now seen corresponding path program 1 times [2024-01-27 15:49:32,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895560392] [2024-01-27 15:49:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:32,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895560392] [2024-01-27 15:49:32,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895560392] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:32,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777387560] [2024-01-27 15:49:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:32,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:32,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:32,480 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:49:32,505 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:49:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:32,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:49:32,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:32,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:49:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:32,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777387560] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:32,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:49:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-01-27 15:49:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508052190] [2024-01-27 15:49:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:49:32,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:49:32,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:49:32,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:49:32,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:32,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 35 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:49:32,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:32,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:32,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:32,856 INFO L124 PetriNetUnfolderBase]: 283/423 cut-off events. [2024-01-27 15:49:32,856 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-27 15:49:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 423 events. 283/423 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1110 event pairs, 138 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 880. Up to 336 conditions per place. [2024-01-27 15:49:32,860 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2024-01-27 15:49:32,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 238 flow [2024-01-27 15:49:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:49:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:49:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2024-01-27 15:49:32,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3657142857142857 [2024-01-27 15:49:32,868 INFO L175 Difference]: Start difference. First operand has 35 places, 35 transitions, 120 flow. Second operand 5 states and 64 transitions. [2024-01-27 15:49:32,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 238 flow [2024-01-27 15:49:32,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 220 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-27 15:49:32,872 INFO L231 Difference]: Finished difference. Result has 35 places, 36 transitions, 118 flow [2024-01-27 15:49:32,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=36} [2024-01-27 15:49:32,873 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-01-27 15:49:32,873 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 118 flow [2024-01-27 15:49:32,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:49:32,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:32,874 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, 1] [2024-01-27 15:49:32,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 15:49:33,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:33,087 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:33,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1001289756, now seen corresponding path program 1 times [2024-01-27 15:49:33,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:33,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519443527] [2024-01-27 15:49:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:33,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:33,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519443527] [2024-01-27 15:49:33,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519443527] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:33,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216446873] [2024-01-27 15:49:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:33,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:33,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:33,224 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:49:33,243 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:49:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:33,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:49:33,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:33,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:49:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216446873] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:49:33,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:49:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-01-27 15:49:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269512165] [2024-01-27 15:49:33,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:49:33,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 15:49:33,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 15:49:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:49:33,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:33,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 118 flow. Second operand has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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:49:33,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:33,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:33,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:33,820 INFO L124 PetriNetUnfolderBase]: 481/718 cut-off events. [2024-01-27 15:49:33,820 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-01-27 15:49:33,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 718 events. 481/718 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2297 event pairs, 183 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 1653. Up to 410 conditions per place. [2024-01-27 15:49:33,824 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 67 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2024-01-27 15:49:33,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 76 transitions, 386 flow [2024-01-27 15:49:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:49:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:49:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-01-27 15:49:33,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3607142857142857 [2024-01-27 15:49:33,826 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 118 flow. Second operand 8 states and 101 transitions. [2024-01-27 15:49:33,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 76 transitions, 386 flow [2024-01-27 15:49:33,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 76 transitions, 366 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-01-27 15:49:33,830 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 152 flow [2024-01-27 15:49:33,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=152, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2024-01-27 15:49:33,831 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2024-01-27 15:49:33,831 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 152 flow [2024-01-27 15:49:33,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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:49:33,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:33,832 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, 1] [2024-01-27 15:49:33,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:49:34,044 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,SelfDestructingSolverStorable2 [2024-01-27 15:49:34,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:34,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash -294290082, now seen corresponding path program 2 times [2024-01-27 15:49:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:34,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305685975] [2024-01-27 15:49:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:34,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305685975] [2024-01-27 15:49:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305685975] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024173736] [2024-01-27 15:49:34,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:49:34,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:34,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:34,230 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:49:34,258 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:49:34,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-27 15:49:34,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:49:34,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:49:34,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:49:34,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:49:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024173736] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:49:34,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:49:34,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-01-27 15:49:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902257596] [2024-01-27 15:49:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:49:34,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:49:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:34,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:49:34,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:49:34,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:34,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:49:34,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:34,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:34,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:34,711 INFO L124 PetriNetUnfolderBase]: 757/1131 cut-off events. [2024-01-27 15:49:34,712 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2024-01-27 15:49:34,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1131 events. 757/1131 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4027 event pairs, 315 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 3213. Up to 701 conditions per place. [2024-01-27 15:49:34,720 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 72 selfloop transitions, 7 changer transitions 11/91 dead transitions. [2024-01-27 15:49:34,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 91 transitions, 506 flow [2024-01-27 15:49:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:49:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:49:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-01-27 15:49:34,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-01-27 15:49:34,722 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 152 flow. Second operand 6 states and 98 transitions. [2024-01-27 15:49:34,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 91 transitions, 506 flow [2024-01-27 15:49:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 483 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-27 15:49:34,727 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 190 flow [2024-01-27 15:49:34,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2024-01-27 15:49:34,728 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2024-01-27 15:49:34,728 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 190 flow [2024-01-27 15:49:34,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:49:34,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:34,729 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, 1] [2024-01-27 15:49:34,746 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:49:34,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:34,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:34,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash -881909060, now seen corresponding path program 3 times [2024-01-27 15:49:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:34,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816197094] [2024-01-27 15:49:34,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:35,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816197094] [2024-01-27 15:49:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816197094] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:35,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029652721] [2024-01-27 15:49:35,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:49:35,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:35,109 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:49:35,110 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:49:35,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:49:35,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:49:35,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:49:35,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:35,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:49:35,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029652721] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:49:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:49:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-01-27 15:49:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145908270] [2024-01-27 15:49:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:49:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:49:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:49:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:49:35,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:35,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:49:35,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:35,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:35,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:35,537 INFO L124 PetriNetUnfolderBase]: 819/1215 cut-off events. [2024-01-27 15:49:35,537 INFO L125 PetriNetUnfolderBase]: For 1410/1410 co-relation queries the response was YES. [2024-01-27 15:49:35,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 1215 events. 819/1215 cut-off events. For 1410/1410 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4397 event pairs, 403 based on Foata normal form. 1/1028 useless extension candidates. Maximal degree in co-relation 4030. Up to 915 conditions per place. [2024-01-27 15:49:35,543 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 67 selfloop transitions, 11 changer transitions 11/90 dead transitions. [2024-01-27 15:49:35,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 546 flow [2024-01-27 15:49:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:49:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:49:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-01-27 15:49:35,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-01-27 15:49:35,546 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 190 flow. Second operand 6 states and 97 transitions. [2024-01-27 15:49:35,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 546 flow [2024-01-27 15:49:35,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 520 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-01-27 15:49:35,553 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 261 flow [2024-01-27 15:49:35,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-01-27 15:49:35,555 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2024-01-27 15:49:35,555 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 261 flow [2024-01-27 15:49:35,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:49:35,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:35,555 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, 1] [2024-01-27 15:49:35,591 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:49:35,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:35,768 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:35,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1110106466, now seen corresponding path program 4 times [2024-01-27 15:49:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335399786] [2024-01-27 15:49:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335399786] [2024-01-27 15:49:35,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335399786] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905682288] [2024-01-27 15:49:35,927 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:49:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:35,941 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:49:35,984 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:49:36,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:49:36,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:49:36,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:49:36,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:36,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:49:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:36,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905682288] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:49:36,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:49:36,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-01-27 15:49:36,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071068086] [2024-01-27 15:49:36,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:49:36,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 15:49:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 15:49:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:49:36,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:36,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 261 flow. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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:49:36,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:36,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:36,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:36,677 INFO L124 PetriNetUnfolderBase]: 819/1227 cut-off events. [2024-01-27 15:49:36,677 INFO L125 PetriNetUnfolderBase]: For 2507/2507 co-relation queries the response was YES. [2024-01-27 15:49:36,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 1227 events. 819/1227 cut-off events. For 2507/2507 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4722 event pairs, 155 based on Foata normal form. 12/1049 useless extension candidates. Maximal degree in co-relation 4450. Up to 378 conditions per place. [2024-01-27 15:49:36,685 INFO L140 encePairwiseOnDemand]: 18/35 looper letters, 101 selfloop transitions, 61 changer transitions 0/163 dead transitions. [2024-01-27 15:49:36,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 163 transitions, 1144 flow [2024-01-27 15:49:36,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 15:49:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 15:49:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 207 transitions. [2024-01-27 15:49:36,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3112781954887218 [2024-01-27 15:49:36,686 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 261 flow. Second operand 19 states and 207 transitions. [2024-01-27 15:49:36,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 163 transitions, 1144 flow [2024-01-27 15:49:36,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 163 transitions, 1058 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-01-27 15:49:36,694 INFO L231 Difference]: Finished difference. Result has 74 places, 89 transitions, 689 flow [2024-01-27 15:49:36,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=689, PETRI_PLACES=74, PETRI_TRANSITIONS=89} [2024-01-27 15:49:36,695 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2024-01-27 15:49:36,695 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 689 flow [2024-01-27 15:49:36,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 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:49:36,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:36,695 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, 1] [2024-01-27 15:49:36,711 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:49:36,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:36,911 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:36,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:36,912 INFO L85 PathProgramCache]: Analyzing trace with hash -922043104, now seen corresponding path program 5 times [2024-01-27 15:49:36,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:36,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443141127] [2024-01-27 15:49:36,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:36,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:37,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443141127] [2024-01-27 15:49:37,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443141127] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679230008] [2024-01-27 15:49:37,073 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:49:37,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:37,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:37,077 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:49:37,107 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:49:37,197 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:49:37,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:49:37,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:49:37,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:37,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:49:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:37,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679230008] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:49:37,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:49:37,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-01-27 15:49:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135753807] [2024-01-27 15:49:37,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:49:37,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 15:49:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 15:49:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-01-27 15:49:37,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:37,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 689 flow. Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 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:49:37,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:37,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:37,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:37,796 INFO L124 PetriNetUnfolderBase]: 805/1198 cut-off events. [2024-01-27 15:49:37,817 INFO L125 PetriNetUnfolderBase]: For 4131/4131 co-relation queries the response was YES. [2024-01-27 15:49:37,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5155 conditions, 1198 events. 805/1198 cut-off events. For 4131/4131 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4498 event pairs, 197 based on Foata normal form. 10/1096 useless extension candidates. Maximal degree in co-relation 5087. Up to 490 conditions per place. [2024-01-27 15:49:37,824 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 87 selfloop transitions, 59 changer transitions 0/147 dead transitions. [2024-01-27 15:49:37,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 147 transitions, 1235 flow [2024-01-27 15:49:37,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-01-27 15:49:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-01-27 15:49:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 156 transitions. [2024-01-27 15:49:37,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3183673469387755 [2024-01-27 15:49:37,826 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 689 flow. Second operand 14 states and 156 transitions. [2024-01-27 15:49:37,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 147 transitions, 1235 flow [2024-01-27 15:49:37,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1142 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-01-27 15:49:37,840 INFO L231 Difference]: Finished difference. Result has 82 places, 104 transitions, 849 flow [2024-01-27 15:49:37,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=849, PETRI_PLACES=82, PETRI_TRANSITIONS=104} [2024-01-27 15:49:37,840 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2024-01-27 15:49:37,840 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 104 transitions, 849 flow [2024-01-27 15:49:37,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 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:49:37,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:37,841 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, 1] [2024-01-27 15:49:37,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:49:38,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:38,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:38,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1908067698, now seen corresponding path program 6 times [2024-01-27 15:49:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:38,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53263304] [2024-01-27 15:49:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:38,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:49:38,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:38,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53263304] [2024-01-27 15:49:38,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53263304] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578042493] [2024-01-27 15:49:38,189 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:49:38,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:38,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:38,190 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:49:38,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 15:49:38,312 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-01-27 15:49:38,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:49:38,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:49:38,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:49:38,365 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:49:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578042493] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:49:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:49:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-01-27 15:49:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564491138] [2024-01-27 15:49:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:49:38,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:49:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:49:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:49:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:49:38,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:49:38,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 104 transitions, 849 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:49:38,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:49:38,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:49:38,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:49:38,594 INFO L124 PetriNetUnfolderBase]: 805/1196 cut-off events. [2024-01-27 15:49:38,594 INFO L125 PetriNetUnfolderBase]: For 4865/4865 co-relation queries the response was YES. [2024-01-27 15:49:38,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5308 conditions, 1196 events. 805/1196 cut-off events. For 4865/4865 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4366 event pairs, 297 based on Foata normal form. 1/1085 useless extension candidates. Maximal degree in co-relation 5242. Up to 899 conditions per place. [2024-01-27 15:49:38,600 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 88 selfloop transitions, 32 changer transitions 12/133 dead transitions. [2024-01-27 15:49:38,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 133 transitions, 1206 flow [2024-01-27 15:49:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:49:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:49:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-01-27 15:49:38,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2024-01-27 15:49:38,602 INFO L175 Difference]: Start difference. First operand has 82 places, 104 transitions, 849 flow. Second operand 6 states and 95 transitions. [2024-01-27 15:49:38,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 133 transitions, 1206 flow [2024-01-27 15:49:38,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 1119 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-01-27 15:49:38,615 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 786 flow [2024-01-27 15:49:38,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=786, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2024-01-27 15:49:38,617 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2024-01-27 15:49:38,617 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 786 flow [2024-01-27 15:49:38,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:49:38,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:49:38,617 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, 1, 1] [2024-01-27 15:49:38,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-27 15:49:38,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:38,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:49:38,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:49:38,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1955482542, now seen corresponding path program 1 times [2024-01-27 15:49:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:49:38,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283044034] [2024-01-27 15:49:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:49:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:40,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:49:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283044034] [2024-01-27 15:49:40,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283044034] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:49:40,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218815095] [2024-01-27 15:49:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:49:40,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:49:40,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:49:40,270 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:49:40,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-27 15:49:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:49:40,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 57 conjunts are in the unsatisfiable core [2024-01-27 15:49:40,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:49:40,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-01-27 15:49:40,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:49:40,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:49:40,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:49:40,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:49:40,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:49:40,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:49:40,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:49:40,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:49:40,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:49:40,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:49:40,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:49:40,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:49:40,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:49:40,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:49:40,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:49:40,671 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-01-27 15:49:40,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-01-27 15:49:40,734 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-01-27 15:49:40,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-01-27 15:49:40,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2024-01-27 15:49:41,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:49:41,229 INFO L349 Elim1Store]: treesize reduction 50, result has 40.5 percent of original size [2024-01-27 15:49:41,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 50 [2024-01-27 15:49:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:49:41,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:49:42,662 INFO L349 Elim1Store]: treesize reduction 118, result has 70.9 percent of original size [2024-01-27 15:49:42,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3950 treesize of output 2125 [2024-01-27 15:49:42,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:49:42,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1799 treesize of output 1709 [2024-01-27 15:49:43,049 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-27 15:49:43,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2024-01-27 15:49:43,678 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-27 15:49:43,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2024-01-27 15:49:43,773 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-27 15:49:43,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2024-01-27 15:49:43,876 INFO L349 Elim1Store]: treesize reduction 64, result has 1.5 percent of original size [2024-01-27 15:49:43,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 25 [2024-01-27 15:49:50,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:49:50,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 659 treesize of output 639 [2024-01-27 15:50:09,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 218 [2024-01-27 15:50:09,908 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-01-27 15:50:09,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 122 [2024-01-27 15:50:19,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:50:19,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1454 treesize of output 1314 [2024-01-27 15:52:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:52:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218815095] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:52:21,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:52:21,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-01-27 15:52:21,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495291711] [2024-01-27 15:52:21,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:52:21,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-01-27 15:52:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:52:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-01-27 15:52:21,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2024-01-27 15:52:21,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:52:21,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 786 flow. Second operand has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 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:52:21,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:52:21,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:52:21,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:52:25,930 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 [1] [2024-01-27 15:52:31,882 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 [1] [2024-01-27 15:52:36,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-27 15:52:36,945 INFO L124 PetriNetUnfolderBase]: 2552/3741 cut-off events. [2024-01-27 15:52:36,945 INFO L125 PetriNetUnfolderBase]: For 11257/11257 co-relation queries the response was YES. [2024-01-27 15:52:36,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 3741 events. 2552/3741 cut-off events. For 11257/11257 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17045 event pairs, 535 based on Foata normal form. 5/3258 useless extension candidates. Maximal degree in co-relation 15554. Up to 1164 conditions per place. [2024-01-27 15:52:36,970 INFO L140 encePairwiseOnDemand]: 19/35 looper letters, 293 selfloop transitions, 112 changer transitions 52/458 dead transitions. [2024-01-27 15:52:36,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 458 transitions, 4320 flow [2024-01-27 15:52:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-27 15:52:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-27 15:52:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 307 transitions. [2024-01-27 15:52:36,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3813664596273292 [2024-01-27 15:52:36,973 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 786 flow. Second operand 23 states and 307 transitions. [2024-01-27 15:52:36,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 458 transitions, 4320 flow [2024-01-27 15:52:37,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 458 transitions, 4054 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-01-27 15:52:37,008 INFO L231 Difference]: Finished difference. Result has 110 places, 214 transitions, 2137 flow [2024-01-27 15:52:37,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2137, PETRI_PLACES=110, PETRI_TRANSITIONS=214} [2024-01-27 15:52:37,009 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2024-01-27 15:52:37,009 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 214 transitions, 2137 flow [2024-01-27 15:52:37,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.71875) internal successors, (215), 32 states have internal predecessors, (215), 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:52:37,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:52:37,010 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, 1, 1] [2024-01-27 15:52:37,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-27 15:52:37,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-01-27 15:52:37,217 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:52:37,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:52:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1425322640, now seen corresponding path program 2 times [2024-01-27 15:52:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:52:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338175917] [2024-01-27 15:52:37,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:52:37,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:52:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:52:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:52:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:52:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338175917] [2024-01-27 15:52:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338175917] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:52:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927750852] [2024-01-27 15:52:38,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:52:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:52:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:52:38,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:52:38,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-27 15:52:38,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:52:38,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:52:38,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 59 conjunts are in the unsatisfiable core [2024-01-27 15:52:38,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:52:38,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-01-27 15:52:38,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:52:38,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:52:38,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:52:38,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:52:38,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:52:38,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:52:38,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:52:38,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:52:38,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:52:38,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:52:38,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:52:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:52:38,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:52:38,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:52:38,685 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-01-27 15:52:38,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-01-27 15:52:38,738 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-01-27 15:52:38,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 25 [2024-01-27 15:52:38,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:52:38,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 42 [2024-01-27 15:52:39,177 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-01-27 15:52:39,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 46 [2024-01-27 15:52:40,551 INFO L349 Elim1Store]: treesize reduction 644, result has 32.4 percent of original size [2024-01-27 15:52:40,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 179 treesize of output 408 [2024-01-27 15:54:26,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:54:26,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:54:27,443 INFO L349 Elim1Store]: treesize reduction 102, result has 71.5 percent of original size [2024-01-27 15:54:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 2080 treesize of output 1135 [2024-01-27 15:54:27,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:54:27,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1137 treesize of output 1077 [2024-01-27 15:54:27,679 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-27 15:54:27,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2024-01-27 15:54:27,934 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-27 15:54:27,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2024-01-27 15:54:28,019 INFO L349 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2024-01-27 15:54:28,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 25 [2024-01-27 15:54:28,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:54:28,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 265 treesize of output 337 [2024-01-27 15:54:31,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:54:31,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 251 [2024-01-27 15:54:33,716 INFO L349 Elim1Store]: treesize reduction 16, result has 85.8 percent of original size [2024-01-27 15:54:33,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 204 [2024-01-27 15:54:38,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 426 [2024-01-27 15:54:38,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:54:38,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 243 [2024-01-27 15:54:43,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 474 treesize of output 426 [2024-01-27 15:54:57,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:54:57,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 4957 treesize of output 4329 [2024-01-27 15:56:11,540 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-27 15:56:11,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-01-27 15:56:11,543 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:56:11,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-01-27 15:56:11,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 15:56:11,745 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 77 more [2024-01-27 15:56:11,749 INFO L158 Benchmark]: Toolchain (without parser) took 401842.58ms. Allocated memory was 148.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 82.7MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-27 15:56:11,749 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:56:11,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.28ms. Allocated memory is still 148.9MB. Free memory was 82.5MB in the beginning and 114.0MB in the end (delta: -31.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-01-27 15:56:11,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.48ms. Allocated memory is still 148.9MB. Free memory was 114.0MB in the beginning and 111.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:56:11,749 INFO L158 Benchmark]: Boogie Preprocessor took 57.23ms. Allocated memory is still 148.9MB. Free memory was 111.3MB in the beginning and 108.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:56:11,749 INFO L158 Benchmark]: RCFGBuilder took 864.24ms. Allocated memory is still 148.9MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2024-01-27 15:56:11,749 INFO L158 Benchmark]: TraceAbstraction took 400616.79ms. Allocated memory was 148.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 105.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-27 15:56:11,751 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 67.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.28ms. Allocated memory is still 148.9MB. Free memory was 82.5MB in the beginning and 114.0MB in the end (delta: -31.5MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.48ms. Allocated memory is still 148.9MB. Free memory was 114.0MB in the beginning and 111.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.23ms. Allocated memory is still 148.9MB. Free memory was 111.3MB in the beginning and 108.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 864.24ms. Allocated memory is still 148.9MB. Free memory was 108.1MB in the beginning and 106.0MB in the end (delta: 2.1MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. * TraceAbstraction took 400616.79ms. Allocated memory was 148.9MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 105.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/popl20-more-vector-add.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:56:13,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:56:13,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:56:13,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:56:13,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:56:13,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:56:13,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:56:13,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:56:13,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:56:13,753 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:56:13,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:56:13,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:56:13,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:56:13,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:56:13,755 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:56:13,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:56:13,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:56:13,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:56:13,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:56:13,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:56:13,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:56:13,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:56:13,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:56:13,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:56:13,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:56:13,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:56:13,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:56:13,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:56:13,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:56:13,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:56:13,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:56:13,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:56:13,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:56:13,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:56:13,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:56:13,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:56:13,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:56:13,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:56:13,761 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:56:13,761 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:56:13,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:56:13,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:56:13,762 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:56:13,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:56:13,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:56:13,762 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:56:13,762 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-01-27 15:56:14,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:56:14,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:56:14,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:56:14,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:56:14,037 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:56:14,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-01-27 15:56:15,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:56:15,320 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:56:15,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2024-01-27 15:56:15,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f58b5a2/9db04cd6fa084964a91df66abe24fe07/FLAGf63683378 [2024-01-27 15:56:15,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f58b5a2/9db04cd6fa084964a91df66abe24fe07 [2024-01-27 15:56:15,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:56:15,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:56:15,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:56:15,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:56:15,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:56:15,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48eb0550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15, skipping insertion in model container [2024-01-27 15:56:15,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,377 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:56:15,565 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/popl20-more-vector-add.wvr.c[2637,2650] [2024-01-27 15:56:15,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:56:15,596 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:56:15,604 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:56:15,627 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/popl20-more-vector-add.wvr.c[2637,2650] [2024-01-27 15:56:15,634 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:56:15,639 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:56:15,670 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/popl20-more-vector-add.wvr.c[2637,2650] [2024-01-27 15:56:15,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:56:15,690 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:56:15,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15 WrapperNode [2024-01-27 15:56:15,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:56:15,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:56:15,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:56:15,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:56:15,697 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:56:15" (1/1) ... [2024-01-27 15:56:15,711 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:56:15" (1/1) ... [2024-01-27 15:56:15,741 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 200 [2024-01-27 15:56:15,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:56:15,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:56:15,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:56:15,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:56:15,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,791 INFO L175 MemorySlicer]: Split 23 memory accesses to 5 slices as follows [2, 2, 2, 15, 2]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 7, 1]. [2024-01-27 15:56:15,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:56:15,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:56:15,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:56:15,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:56:15,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (1/1) ... [2024-01-27 15:56:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:56:15,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:56:15,842 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:56:15,853 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:56:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:56:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:56:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:56:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:56:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:56:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-01-27 15:56:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:56:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:56:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:56:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:56:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:56:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:56:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:56:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:56:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:56:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:56:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:56:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:56:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:56:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:56:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-01-27 15:56:15,889 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:56:16,015 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:56:16,017 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:56:16,456 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:56:16,456 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:56:16,731 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:56:16,731 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-01-27 15:56:16,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:56:16 BoogieIcfgContainer [2024-01-27 15:56:16,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:56:16,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:56:16,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:56:16,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:56:16,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:56:15" (1/3) ... [2024-01-27 15:56:16,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf8dc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:56:16, skipping insertion in model container [2024-01-27 15:56:16,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:56:15" (2/3) ... [2024-01-27 15:56:16,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf8dc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:56:16, skipping insertion in model container [2024-01-27 15:56:16,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:56:16" (3/3) ... [2024-01-27 15:56:16,739 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-01-27 15:56:16,746 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:56:16,753 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:56:16,754 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:56:16,754 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:56:16,795 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:56:16,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 91 flow [2024-01-27 15:56:16,837 INFO L124 PetriNetUnfolderBase]: 7/32 cut-off events. [2024-01-27 15:56:16,837 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:56:16,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 7/32 cut-off events. For 3/3 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/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-01-27 15:56:16,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 91 flow [2024-01-27 15:56:16,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 31 transitions, 80 flow [2024-01-27 15:56:16,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:56:16,873 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;@1ef39864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:56:16,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:56:16,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:56:16,883 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2024-01-27 15:56:16,883 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:56:16,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:16,884 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] [2024-01-27 15:56:16,884 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:16,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1186016925, now seen corresponding path program 1 times [2024-01-27 15:56:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463280300] [2024-01-27 15:56:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:16,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:16,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:16,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:16,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-01-27 15:56:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:17,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:56:17,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:17,128 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:56:17,129 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:56:17,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463280300] [2024-01-27 15:56:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463280300] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:17,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:17,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:56:17,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804722271] [2024-01-27 15:56:17,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:17,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:56:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:56:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:56:17,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:17,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:56:17,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:17,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:17,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:17,611 INFO L124 PetriNetUnfolderBase]: 384/571 cut-off events. [2024-01-27 15:56:17,611 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-01-27 15:56:17,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 571 events. 384/571 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1733 event pairs, 138 based on Foata normal form. 1/418 useless extension candidates. Maximal degree in co-relation 890. Up to 333 conditions per place. [2024-01-27 15:56:17,615 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 3 changer transitions 17/60 dead transitions. [2024-01-27 15:56:17,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 277 flow [2024-01-27 15:56:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:56:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:56:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-01-27 15:56:17,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-01-27 15:56:17,626 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 80 flow. Second operand 5 states and 80 transitions. [2024-01-27 15:56:17,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 60 transitions, 277 flow [2024-01-27 15:56:17,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 251 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:56:17,632 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 84 flow [2024-01-27 15:56:17,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-01-27 15:56:17,636 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2024-01-27 15:56:17,636 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 84 flow [2024-01-27 15:56:17,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:56:17,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:17,636 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] [2024-01-27 15:56:17,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-01-27 15:56:17,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:17,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:17,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:17,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1464066879, now seen corresponding path program 1 times [2024-01-27 15:56:17,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:17,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920910089] [2024-01-27 15:56:17,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:17,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:17,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:17,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:17,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-01-27 15:56:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:18,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:56:18,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:18,066 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:56:18,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:56:18,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920910089] [2024-01-27 15:56:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920910089] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:18,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:18,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:56:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420308833] [2024-01-27 15:56:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:18,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:56:18,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:56:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:56:18,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:18,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:56:18,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:18,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:18,523 INFO L124 PetriNetUnfolderBase]: 379/575 cut-off events. [2024-01-27 15:56:18,524 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-01-27 15:56:18,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 575 events. 379/575 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1595 event pairs, 203 based on Foata normal form. 26/469 useless extension candidates. Maximal degree in co-relation 1329. Up to 419 conditions per place. [2024-01-27 15:56:18,527 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 27 selfloop transitions, 8 changer transitions 31/67 dead transitions. [2024-01-27 15:56:18,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 67 transitions, 294 flow [2024-01-27 15:56:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:56:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:56:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-01-27 15:56:18,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-01-27 15:56:18,529 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 84 flow. Second operand 6 states and 93 transitions. [2024-01-27 15:56:18,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 67 transitions, 294 flow [2024-01-27 15:56:18,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 67 transitions, 285 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-27 15:56:18,531 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 130 flow [2024-01-27 15:56:18,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2024-01-27 15:56:18,532 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2024-01-27 15:56:18,532 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 130 flow [2024-01-27 15:56:18,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:56:18,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:18,533 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, 1] [2024-01-27 15:56:18,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-01-27 15:56:18,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:18,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:18,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1452745672, now seen corresponding path program 1 times [2024-01-27 15:56:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367075006] [2024-01-27 15:56:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:18,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:18,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:18,740 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:18,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-01-27 15:56:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:18,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:56:18,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:56:19,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:56:19,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:19,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367075006] [2024-01-27 15:56:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367075006] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:56:19,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:56:19,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-01-27 15:56:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702479651] [2024-01-27 15:56:19,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:56:19,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:56:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:56:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:56:19,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:19,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 130 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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:56:19,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:19,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:19,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:20,767 INFO L124 PetriNetUnfolderBase]: 961/1437 cut-off events. [2024-01-27 15:56:20,767 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2024-01-27 15:56:20,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 1437 events. 961/1437 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5253 event pairs, 366 based on Foata normal form. 2/1089 useless extension candidates. Maximal degree in co-relation 1669. Up to 418 conditions per place. [2024-01-27 15:56:20,775 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 119 selfloop transitions, 32 changer transitions 0/152 dead transitions. [2024-01-27 15:56:20,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 152 transitions, 802 flow [2024-01-27 15:56:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-01-27 15:56:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-01-27 15:56:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 208 transitions. [2024-01-27 15:56:20,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961904761904762 [2024-01-27 15:56:20,781 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 130 flow. Second operand 15 states and 208 transitions. [2024-01-27 15:56:20,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 152 transitions, 802 flow [2024-01-27 15:56:20,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 152 transitions, 736 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-01-27 15:56:20,785 INFO L231 Difference]: Finished difference. Result has 54 places, 59 transitions, 318 flow [2024-01-27 15:56:20,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=318, PETRI_PLACES=54, PETRI_TRANSITIONS=59} [2024-01-27 15:56:20,787 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2024-01-27 15:56:20,787 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 318 flow [2024-01-27 15:56:20,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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:56:20,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:20,788 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, 1] [2024-01-27 15:56:20,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:20,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:20,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:20,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 562440152, now seen corresponding path program 2 times [2024-01-27 15:56:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:20,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189757] [2024-01-27 15:56:20,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:56:20,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:20,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:20,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:21,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-01-27 15:56:21,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-27 15:56:21,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:56:21,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:56:21,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:56:21,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:56:21,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189757] [2024-01-27 15:56:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189757] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:21,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 15:56:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954090991] [2024-01-27 15:56:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:21,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:56:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:56:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:56:21,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:21,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 318 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:56:21,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:21,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:21,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:22,779 INFO L124 PetriNetUnfolderBase]: 1513/2263 cut-off events. [2024-01-27 15:56:22,779 INFO L125 PetriNetUnfolderBase]: For 1802/1802 co-relation queries the response was YES. [2024-01-27 15:56:22,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7309 conditions, 2263 events. 1513/2263 cut-off events. For 1802/1802 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9102 event pairs, 630 based on Foata normal form. 2/1793 useless extension candidates. Maximal degree in co-relation 3667. Up to 1377 conditions per place. [2024-01-27 15:56:22,789 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 90 selfloop transitions, 15 changer transitions 12/118 dead transitions. [2024-01-27 15:56:22,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 118 transitions, 781 flow [2024-01-27 15:56:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:56:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:56:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-01-27 15:56:22,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2024-01-27 15:56:22,792 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 318 flow. Second operand 8 states and 106 transitions. [2024-01-27 15:56:22,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 118 transitions, 781 flow [2024-01-27 15:56:22,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 730 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-01-27 15:56:22,799 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 371 flow [2024-01-27 15:56:22,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-01-27 15:56:22,799 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2024-01-27 15:56:22,800 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 371 flow [2024-01-27 15:56:22,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:56:22,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:22,800 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, 1] [2024-01-27 15:56:22,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:23,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:23,004 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:23,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash -25178826, now seen corresponding path program 3 times [2024-01-27 15:56:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615276335] [2024-01-27 15:56:23,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:56:23,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:23,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:23,008 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:23,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-01-27 15:56:23,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:56:23,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:56:23,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:56:23,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:56:23,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:23,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615276335] [2024-01-27 15:56:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615276335] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:56:23,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:56:23,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-01-27 15:56:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040828182] [2024-01-27 15:56:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:23,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:56:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:56:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:56:23,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:23,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:56:23,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:23,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:23,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:24,512 INFO L124 PetriNetUnfolderBase]: 1693/2537 cut-off events. [2024-01-27 15:56:24,513 INFO L125 PetriNetUnfolderBase]: For 5026/5026 co-relation queries the response was YES. [2024-01-27 15:56:24,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9469 conditions, 2537 events. 1693/2537 cut-off events. For 5026/5026 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10771 event pairs, 602 based on Foata normal form. 2/2163 useless extension candidates. Maximal degree in co-relation 9412. Up to 1334 conditions per place. [2024-01-27 15:56:24,528 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 90 selfloop transitions, 19 changer transitions 11/121 dead transitions. [2024-01-27 15:56:24,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 121 transitions, 845 flow [2024-01-27 15:56:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:56:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:56:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-01-27 15:56:24,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-27 15:56:24,530 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 371 flow. Second operand 6 states and 105 transitions. [2024-01-27 15:56:24,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 121 transitions, 845 flow [2024-01-27 15:56:24,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 121 transitions, 797 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-01-27 15:56:24,539 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 471 flow [2024-01-27 15:56:24,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2024-01-27 15:56:24,540 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2024-01-27 15:56:24,540 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 471 flow [2024-01-27 15:56:24,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:56:24,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:24,540 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, 1] [2024-01-27 15:56:24,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:24,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:24,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1089109816, now seen corresponding path program 4 times [2024-01-27 15:56:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493501951] [2024-01-27 15:56:24,746 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:56:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:24,747 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:24,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-01-27 15:56:24,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:56:24,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:56:24,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:56:24,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:25,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:25,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:25,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493501951] [2024-01-27 15:56:25,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493501951] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:56:25,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:56:25,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-01-27 15:56:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355409622] [2024-01-27 15:56:25,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:56:25,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:56:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:56:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:56:25,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:25,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 471 flow. Second operand has 16 states, 16 states have (on average 7.25) internal successors, (116), 16 states have internal predecessors, (116), 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:56:25,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:25,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:25,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:27,865 INFO L124 PetriNetUnfolderBase]: 1637/2455 cut-off events. [2024-01-27 15:56:27,865 INFO L125 PetriNetUnfolderBase]: For 6977/6977 co-relation queries the response was YES. [2024-01-27 15:56:27,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9612 conditions, 2455 events. 1637/2455 cut-off events. For 6977/6977 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10296 event pairs, 610 based on Foata normal form. 24/2106 useless extension candidates. Maximal degree in co-relation 9552. Up to 718 conditions per place. [2024-01-27 15:56:27,878 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 148 selfloop transitions, 54 changer transitions 0/203 dead transitions. [2024-01-27 15:56:27,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 203 transitions, 1446 flow [2024-01-27 15:56:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 15:56:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 15:56:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 242 transitions. [2024-01-27 15:56:27,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38412698412698415 [2024-01-27 15:56:27,881 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 471 flow. Second operand 18 states and 242 transitions. [2024-01-27 15:56:27,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 203 transitions, 1446 flow [2024-01-27 15:56:27,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 203 transitions, 1398 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-01-27 15:56:27,896 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 792 flow [2024-01-27 15:56:27,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=792, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2024-01-27 15:56:27,899 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 53 predicate places. [2024-01-27 15:56:27,899 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 792 flow [2024-01-27 15:56:27,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 16 states have internal predecessors, (116), 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:56:27,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:27,900 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, 1] [2024-01-27 15:56:27,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:28,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:28,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:28,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1929418372, now seen corresponding path program 5 times [2024-01-27 15:56:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:28,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575439411] [2024-01-27 15:56:28,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:56:28,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:28,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:28,107 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:28,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-01-27 15:56:28,314 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:56:28,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:56:28,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:56:28,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:28,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:28,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575439411] [2024-01-27 15:56:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575439411] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:56:28,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:56:28,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-01-27 15:56:28,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244768415] [2024-01-27 15:56:28,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:56:28,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:56:28,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:28,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:56:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:56:28,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:28,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 792 flow. Second operand has 16 states, 16 states have (on average 7.25) internal successors, (116), 16 states have internal predecessors, (116), 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:56:28,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:28,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:28,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:33,906 INFO L124 PetriNetUnfolderBase]: 5839/8499 cut-off events. [2024-01-27 15:56:33,907 INFO L125 PetriNetUnfolderBase]: For 41359/41359 co-relation queries the response was YES. [2024-01-27 15:56:33,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37331 conditions, 8499 events. 5839/8499 cut-off events. For 41359/41359 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 44274 event pairs, 796 based on Foata normal form. 40/6966 useless extension candidates. Maximal degree in co-relation 31391. Up to 2165 conditions per place. [2024-01-27 15:56:33,961 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 470 selfloop transitions, 219 changer transitions 0/690 dead transitions. [2024-01-27 15:56:33,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 690 transitions, 7861 flow [2024-01-27 15:56:33,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-01-27 15:56:33,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-01-27 15:56:33,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 378 transitions. [2024-01-27 15:56:33,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38571428571428573 [2024-01-27 15:56:33,965 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 792 flow. Second operand 28 states and 378 transitions. [2024-01-27 15:56:33,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 690 transitions, 7861 flow [2024-01-27 15:56:34,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 690 transitions, 7122 flow, removed 352 selfloop flow, removed 6 redundant places. [2024-01-27 15:56:34,065 INFO L231 Difference]: Finished difference. Result has 127 places, 356 transitions, 4237 flow [2024-01-27 15:56:34,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4237, PETRI_PLACES=127, PETRI_TRANSITIONS=356} [2024-01-27 15:56:34,066 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 93 predicate places. [2024-01-27 15:56:34,066 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 356 transitions, 4237 flow [2024-01-27 15:56:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.25) internal successors, (116), 16 states have internal predecessors, (116), 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:56:34,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:34,066 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, 1] [2024-01-27 15:56:34,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:34,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:34,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:34,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1459673130, now seen corresponding path program 6 times [2024-01-27 15:56:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:34,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482822469] [2024-01-27 15:56:34,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:56:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:34,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:34,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:34,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-01-27 15:56:34,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-01-27 15:56:34,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:56:34,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:56:34,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:56:34,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:56:34,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:34,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482822469] [2024-01-27 15:56:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482822469] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:56:34,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:56:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 15:56:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868573093] [2024-01-27 15:56:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:56:34,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:56:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:56:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:56:34,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:34,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 356 transitions, 4237 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:56:34,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:34,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:34,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:36,950 INFO L124 PetriNetUnfolderBase]: 5837/8485 cut-off events. [2024-01-27 15:56:36,950 INFO L125 PetriNetUnfolderBase]: For 76724/76724 co-relation queries the response was YES. [2024-01-27 15:56:36,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46400 conditions, 8485 events. 5837/8485 cut-off events. For 76724/76724 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 43262 event pairs, 1744 based on Foata normal form. 8/7385 useless extension candidates. Maximal degree in co-relation 44364. Up to 5963 conditions per place. [2024-01-27 15:56:37,021 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 192 selfloop transitions, 249 changer transitions 22/464 dead transitions. [2024-01-27 15:56:37,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 464 transitions, 5907 flow [2024-01-27 15:56:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:56:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:56:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-01-27 15:56:37,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3678571428571429 [2024-01-27 15:56:37,025 INFO L175 Difference]: Start difference. First operand has 127 places, 356 transitions, 4237 flow. Second operand 8 states and 103 transitions. [2024-01-27 15:56:37,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 464 transitions, 5907 flow [2024-01-27 15:56:37,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 464 transitions, 5532 flow, removed 175 selfloop flow, removed 4 redundant places. [2024-01-27 15:56:37,343 INFO L231 Difference]: Finished difference. Result has 132 places, 374 transitions, 4783 flow [2024-01-27 15:56:37,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4026, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4783, PETRI_PLACES=132, PETRI_TRANSITIONS=374} [2024-01-27 15:56:37,344 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 98 predicate places. [2024-01-27 15:56:37,344 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 374 transitions, 4783 flow [2024-01-27 15:56:37,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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:56:37,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:37,345 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, 1] [2024-01-27 15:56:37,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:37,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:37,549 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:37,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:37,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1584665592, now seen corresponding path program 7 times [2024-01-27 15:56:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022025342] [2024-01-27 15:56:37,550 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:56:37,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:37,551 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:37,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-01-27 15:56:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:37,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:56:37,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:37,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:56:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:56:38,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:56:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022025342] [2024-01-27 15:56:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022025342] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:56:38,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:56:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-01-27 15:56:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795597714] [2024-01-27 15:56:38,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:56:38,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:56:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:56:38,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:56:38,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:56:38,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2024-01-27 15:56:38,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 374 transitions, 4783 flow. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 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:56:38,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:56:38,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2024-01-27 15:56:38,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:56:40,797 INFO L124 PetriNetUnfolderBase]: 5587/8017 cut-off events. [2024-01-27 15:56:40,797 INFO L125 PetriNetUnfolderBase]: For 80581/80581 co-relation queries the response was YES. [2024-01-27 15:56:40,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43258 conditions, 8017 events. 5587/8017 cut-off events. For 80581/80581 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 39656 event pairs, 1478 based on Foata normal form. 96/7205 useless extension candidates. Maximal degree in co-relation 43123. Up to 2353 conditions per place. [2024-01-27 15:56:40,859 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 473 selfloop transitions, 193 changer transitions 0/667 dead transitions. [2024-01-27 15:56:40,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 667 transitions, 7382 flow [2024-01-27 15:56:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-01-27 15:56:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-01-27 15:56:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 236 transitions. [2024-01-27 15:56:40,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746031746031746 [2024-01-27 15:56:40,862 INFO L175 Difference]: Start difference. First operand has 132 places, 374 transitions, 4783 flow. Second operand 18 states and 236 transitions. [2024-01-27 15:56:40,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 667 transitions, 7382 flow [2024-01-27 15:56:41,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 667 transitions, 6866 flow, removed 71 selfloop flow, removed 10 redundant places. [2024-01-27 15:56:41,257 INFO L231 Difference]: Finished difference. Result has 139 places, 382 transitions, 4873 flow [2024-01-27 15:56:41,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4223, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4873, PETRI_PLACES=139, PETRI_TRANSITIONS=382} [2024-01-27 15:56:41,258 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 105 predicate places. [2024-01-27 15:56:41,259 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 382 transitions, 4873 flow [2024-01-27 15:56:41,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 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:56:41,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:56:41,259 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, 1, 1] [2024-01-27 15:56:41,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-01-27 15:56:41,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:41,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:56:41,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:56:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1843906638, now seen corresponding path program 1 times [2024-01-27 15:56:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:56:41,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228871333] [2024-01-27 15:56:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:56:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-27 15:56:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:56:41,466 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-27 15:56:41,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-01-27 15:56:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:56:41,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjunts are in the unsatisfiable core [2024-01-27 15:56:41,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:56:42,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2024-01-27 15:56:42,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:56:42,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:56:42,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:56:42,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:56:42,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:56:42,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:56:42,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:56:42,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-01-27 15:56:42,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-01-27 15:56:42,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:56:42,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:56:42,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-01-27 15:56:42,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:42,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-01-27 15:56:42,355 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-01-27 15:56:42,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-01-27 15:56:42,440 INFO L349 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2024-01-27 15:56:42,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 32 [2024-01-27 15:56:42,548 INFO L349 Elim1Store]: treesize reduction 48, result has 21.3 percent of original size [2024-01-27 15:56:42,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 31 [2024-01-27 15:56:42,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 15:56:43,015 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-01-27 15:56:43,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 334 treesize of output 187 [2024-01-27 15:56:43,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:56:43,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:43,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:43,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:56:43,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:43,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:43,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:56:43,472 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:56:43,473 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-27 15:56:43,658 INFO L349 Elim1Store]: treesize reduction 244, result has 37.9 percent of original size [2024-01-27 15:56:43,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 10 disjoint index pairs (out of 190 index pairs), introduced 12 new quantified variables, introduced 80 case distinctions, treesize of input 551 treesize of output 351 [2024-01-27 16:00:38,537 WARN L293 SmtUtils]: Spent 54.44s on a formula simplification that was a NOOP. DAG size: 4421 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15