./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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-bad-dot-product-alt.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 e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:07:19,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:07:19,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:07:19,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:07:19,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:07:19,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:07:19,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:07:19,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:07:19,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:07:19,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:07:19,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:07:19,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:07:19,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:07:19,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:07:19,689 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:07:19,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:07:19,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:07:19,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:07:19,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:07:19,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:07:19,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:07:19,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:07:19,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:07:19,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:07:19,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:07:19,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:07:19,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:07:19,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:07:19,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:07:19,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:07:19,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:07:19,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:07:19,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:07:19,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:07:19,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:07:19,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:07:19,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:07:19,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:07:19,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:07:19,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:07:19,697 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:07:19,698 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:07:19,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:07:19,698 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 -> e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:07:19,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:07:19,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:07:19,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:07:19,916 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:07:19,916 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:07:19,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-02-20 12:07:21,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:07:21,344 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:07:21,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-02-20 12:07:21,351 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c4da1c9/0b924fce3e9344cba66bfcd1e1d7cea4/FLAG2e9839e0e [2024-02-20 12:07:21,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03c4da1c9/0b924fce3e9344cba66bfcd1e1d7cea4 [2024-02-20 12:07:21,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:07:21,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:07:21,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:07:21,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:07:21,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:07:21,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7297c1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21, skipping insertion in model container [2024-02-20 12:07:21,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,400 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:07:21,563 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-bad-dot-product-alt.wvr.c[3182,3195] [2024-02-20 12:07:21,572 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:07:21,582 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:07:21,608 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-bad-dot-product-alt.wvr.c[3182,3195] [2024-02-20 12:07:21,615 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:07:21,636 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:07:21,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21 WrapperNode [2024-02-20 12:07:21,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:07:21,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:07:21,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:07:21,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:07:21,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,689 INFO L138 Inliner]: procedures = 28, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 375 [2024-02-20 12:07:21,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:07:21,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:07:21,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:07:21,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:07:21,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,747 INFO L175 MemorySlicer]: Split 36 memory accesses to 6 slices as follows [2, 2, 2, 2, 24, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 3, 1]. [2024-02-20 12:07:21,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:07:21,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:07:21,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:07:21,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:07:21,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (1/1) ... [2024-02-20 12:07:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:07:21,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:21,878 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-02-20 12:07:21,886 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-02-20 12:07:21,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:07:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-20 12:07:21,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-20 12:07:21,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-20 12:07:21,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-20 12:07:21,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-20 12:07:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-20 12:07:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:07:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:07:21,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:07:21,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:07:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:07:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 12:07:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-20 12:07:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:07:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:07:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:07:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:07:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 12:07:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-20 12:07:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-20 12:07:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-20 12:07:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-20 12:07:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-20 12:07:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-20 12:07:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-20 12:07:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:07:21,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:07:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:07:21,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:07:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:07:21,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:07:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:07:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:07:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:07:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:07:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 12:07:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-20 12:07:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:07:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:07:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:07:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:07:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:07:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:07:21,977 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:07:22,108 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:07:22,110 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:07:22,522 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:07:22,524 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:07:22,934 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:07:22,934 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-02-20 12:07:22,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:07:22 BoogieIcfgContainer [2024-02-20 12:07:22,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:07:22,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:07:22,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:07:22,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:07:22,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:07:21" (1/3) ... [2024-02-20 12:07:22,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593c5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:07:22, skipping insertion in model container [2024-02-20 12:07:22,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:07:21" (2/3) ... [2024-02-20 12:07:22,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1593c5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:07:22, skipping insertion in model container [2024-02-20 12:07:22,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:07:22" (3/3) ... [2024-02-20 12:07:22,999 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2024-02-20 12:07:23,014 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:07:23,015 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:07:23,015 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:07:23,095 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 12:07:23,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2024-02-20 12:07:23,153 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-02-20 12:07:23,153 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:07:23,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 7/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-02-20 12:07:23,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2024-02-20 12:07:23,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2024-02-20 12:07:23,168 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:07:23,174 INFO L369 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=All, 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;@192fb46d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:07:23,175 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 12:07:23,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:07:23,194 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-02-20 12:07:23,194 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:07:23,194 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:23,195 INFO L234 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] [2024-02-20 12:07:23,196 INFO L432 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-02-20 12:07:23,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1520528807, now seen corresponding path program 1 times [2024-02-20 12:07:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301907766] [2024-02-20 12:07:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:07:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301907766] [2024-02-20 12:07:23,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301907766] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:07:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666458296] [2024-02-20 12:07:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:23,928 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:07:23,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:07:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:07:23,967 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:07:23,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-20 12:07:23,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:23,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:07:23,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:24,520 INFO L124 PetriNetUnfolderBase]: 1240/1728 cut-off events. [2024-02-20 12:07:24,520 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-20 12:07:24,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1728 events. 1240/1728 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7505 event pairs, 206 based on Foata normal form. 1/1255 useless extension candidates. Maximal degree in co-relation 2979. Up to 1465 conditions per place. [2024-02-20 12:07:24,553 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 47 selfloop transitions, 4 changer transitions 1/56 dead transitions. [2024-02-20 12:07:24,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 249 flow [2024-02-20 12:07:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:07:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:07:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-20 12:07:24,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-02-20 12:07:24,569 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-20 12:07:24,569 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 56 transitions, 249 flow [2024-02-20 12:07:24,569 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-20 12:07:24,569 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:24,570 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:07:24,570 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:07:24,570 INFO L432 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-02-20 12:07:24,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:24,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1515677555, now seen corresponding path program 1 times [2024-02-20 12:07:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586642741] [2024-02-20 12:07:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:24,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:07:24,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586642741] [2024-02-20 12:07:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586642741] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:24,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:24,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:07:24,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282366927] [2024-02-20 12:07:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:24,854 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:24,857 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:07:24,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 56 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:07:24,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:24,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:07:24,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:25,235 INFO L124 PetriNetUnfolderBase]: 1246/1741 cut-off events. [2024-02-20 12:07:25,236 INFO L125 PetriNetUnfolderBase]: For 144/160 co-relation queries the response was YES. [2024-02-20 12:07:25,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5327 conditions, 1741 events. 1246/1741 cut-off events. For 144/160 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7478 event pairs, 206 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 4422. Up to 1715 conditions per place. [2024-02-20 12:07:25,248 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 49 selfloop transitions, 4 changer transitions 12/69 dead transitions. [2024-02-20 12:07:25,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 431 flow [2024-02-20 12:07:25,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:07:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:07:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-02-20 12:07:25,250 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-02-20 12:07:25,251 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-02-20 12:07:25,251 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 69 transitions, 431 flow [2024-02-20 12:07:25,251 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:07:25,251 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:25,252 INFO L234 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-02-20 12:07:25,252 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:07:25,252 INFO L432 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-02-20 12:07:25,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:25,253 INFO L85 PathProgramCache]: Analyzing trace with hash 392071675, now seen corresponding path program 1 times [2024-02-20 12:07:25,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:25,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866680552] [2024-02-20 12:07:25,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:25,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866680552] [2024-02-20 12:07:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866680552] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654064424] [2024-02-20 12:07:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:25,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:25,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:25,429 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-02-20 12:07:25,449 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-02-20 12:07:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:25,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-20 12:07:25,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:07:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:25,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:07:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654064424] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:25,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:07:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-20 12:07:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831971240] [2024-02-20 12:07:25,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:25,713 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:07:25,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:25,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:07:25,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:07:25,715 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-02-20 12:07:25,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 69 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-02-20 12:07:25,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:25,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-02-20 12:07:25,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:26,074 INFO L124 PetriNetUnfolderBase]: 1302/1822 cut-off events. [2024-02-20 12:07:26,074 INFO L125 PetriNetUnfolderBase]: For 528/552 co-relation queries the response was YES. [2024-02-20 12:07:26,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7237 conditions, 1822 events. 1302/1822 cut-off events. For 528/552 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7788 event pairs, 82 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 6891. Up to 1718 conditions per place. [2024-02-20 12:07:26,089 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 69 selfloop transitions, 5 changer transitions 16/93 dead transitions. [2024-02-20 12:07:26,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 758 flow [2024-02-20 12:07:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:07:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:07:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-02-20 12:07:26,091 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-02-20 12:07:26,091 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-02-20 12:07:26,092 INFO L507 AbstractCegarLoop]: Abstraction has has 50 places, 93 transitions, 758 flow [2024-02-20 12:07:26,092 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-02-20 12:07:26,092 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:26,092 INFO L234 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-02-20 12:07:26,113 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-02-20 12:07:26,309 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:26,310 INFO L432 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-02-20 12:07:26,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1165013571, now seen corresponding path program 1 times [2024-02-20 12:07:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188877287] [2024-02-20 12:07:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:07:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188877287] [2024-02-20 12:07:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188877287] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:26,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:07:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618263850] [2024-02-20 12:07:26,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:26,428 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:26,431 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-02-20 12:07:26,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 93 transitions, 758 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-02-20 12:07:26,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:26,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-02-20 12:07:26,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:26,890 INFO L124 PetriNetUnfolderBase]: 1395/1979 cut-off events. [2024-02-20 12:07:26,890 INFO L125 PetriNetUnfolderBase]: For 1491/1491 co-relation queries the response was YES. [2024-02-20 12:07:26,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9542 conditions, 1979 events. 1395/1979 cut-off events. For 1491/1491 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8117 event pairs, 96 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 9112. Up to 1800 conditions per place. [2024-02-20 12:07:26,912 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 97 selfloop transitions, 6 changer transitions 16/122 dead transitions. [2024-02-20 12:07:26,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 122 transitions, 1234 flow [2024-02-20 12:07:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:07:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:07:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-02-20 12:07:26,914 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-02-20 12:07:26,915 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2024-02-20 12:07:26,915 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 122 transitions, 1234 flow [2024-02-20 12:07:26,915 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-02-20 12:07:26,915 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:26,915 INFO L234 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, 1] [2024-02-20 12:07:26,916 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 12:07:26,916 INFO L432 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-02-20 12:07:26,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:26,917 INFO L85 PathProgramCache]: Analyzing trace with hash -386228097, now seen corresponding path program 1 times [2024-02-20 12:07:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:26,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277952932] [2024-02-20 12:07:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:07:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:27,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277952932] [2024-02-20 12:07:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277952932] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:07:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167234072] [2024-02-20 12:07:27,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:27,302 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:27,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:27,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:27,303 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:07:27,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 122 transitions, 1234 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-20 12:07:27,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:27,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:07:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:27,629 INFO L124 PetriNetUnfolderBase]: 1423/2044 cut-off events. [2024-02-20 12:07:27,629 INFO L125 PetriNetUnfolderBase]: For 3081/3094 co-relation queries the response was YES. [2024-02-20 12:07:27,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11695 conditions, 2044 events. 1423/2044 cut-off events. For 3081/3094 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8456 event pairs, 99 based on Foata normal form. 24/1700 useless extension candidates. Maximal degree in co-relation 10851. Up to 1838 conditions per place. [2024-02-20 12:07:27,651 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 3 changer transitions 44/153 dead transitions. [2024-02-20 12:07:27,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 153 transitions, 1857 flow [2024-02-20 12:07:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:07:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:07:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-02-20 12:07:27,653 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-02-20 12:07:27,654 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-02-20 12:07:27,654 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 153 transitions, 1857 flow [2024-02-20 12:07:27,654 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-20 12:07:27,654 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:27,654 INFO L234 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, 1, 1, 1] [2024-02-20 12:07:27,655 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:07:27,655 INFO L432 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-02-20 12:07:27,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671507, now seen corresponding path program 1 times [2024-02-20 12:07:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:27,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183524007] [2024-02-20 12:07:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:27,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:07:28,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:28,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183524007] [2024-02-20 12:07:28,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183524007] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:07:28,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:07:28,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:07:28,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922978612] [2024-02-20 12:07:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:07:28,012 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:07:28,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:07:28,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:07:28,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:07:28,013 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:07:28,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 153 transitions, 1857 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-02-20 12:07:28,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:07:28,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:07:28,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:07:28,387 INFO L124 PetriNetUnfolderBase]: 1473/2134 cut-off events. [2024-02-20 12:07:28,387 INFO L125 PetriNetUnfolderBase]: For 6501/6505 co-relation queries the response was YES. [2024-02-20 12:07:28,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14169 conditions, 2134 events. 1473/2134 cut-off events. For 6501/6505 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9161 event pairs, 90 based on Foata normal form. 32/1788 useless extension candidates. Maximal degree in co-relation 12770. Up to 1911 conditions per place. [2024-02-20 12:07:28,424 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 98 selfloop transitions, 9 changer transitions 79/190 dead transitions. [2024-02-20 12:07:28,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 190 transitions, 2688 flow [2024-02-20 12:07:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:07:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:07:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-02-20 12:07:28,427 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-02-20 12:07:28,429 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2024-02-20 12:07:28,429 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 190 transitions, 2688 flow [2024-02-20 12:07:28,430 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-02-20 12:07:28,430 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:07:28,430 INFO L234 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, 1, 1, 1, 1] [2024-02-20 12:07:28,430 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 12:07:28,433 INFO L432 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-02-20 12:07:28,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:07:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2089997866, now seen corresponding path program 1 times [2024-02-20 12:07:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:07:28,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993001856] [2024-02-20 12:07:28,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:07:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:07:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:07:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993001856] [2024-02-20 12:07:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993001856] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:07:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968451210] [2024-02-20 12:07:30,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:07:30,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:07:30,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:07:30,440 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-02-20 12:07:30,444 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-02-20 12:07:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:07:30,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 78 conjunts are in the unsatisfiable core [2024-02-20 12:07:30,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:07:30,740 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-02-20 12:07:30,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-02-20 12:07:30,827 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-02-20 12:07:30,828 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 19 treesize of output 16 [2024-02-20 12:07:30,874 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-20 12:07:30,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-20 12:07:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2024-02-20 12:07:30,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-02-20 12:07:31,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-02-20 12:07:31,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2024-02-20 12:07:31,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-02-20 12:07:31,644 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-02-20 12:07:31,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 29 treesize of output 25 [2024-02-20 12:07:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:07:31,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:07:32,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 119 treesize of output 115 [2024-02-20 12:07:32,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:07:32,664 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 418 treesize of output 390 [2024-02-20 12:07:32,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 370 treesize of output 354 [2024-02-20 12:07:32,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:07:32,692 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 1062 treesize of output 890 [2024-02-20 12:07:47,875 WARN L876 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse13 (select |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse14 (* |c_ULTIMATE.start_create_fresh_int_array_~i~4#1| 4))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse5 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse8 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse5))) (let ((.cse12 (select .cse8 c_~B~0.base))) (let ((.cse0 (select .cse12 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse10 (select .cse8 ~A~0.base))) (let ((.cse1 (select .cse10 ~A~0.offset))) (or (< .cse1 0) (forall ((~M~0 Int)) (let ((.cse11 (* ~M~0 4))) (let ((.cse2 (select .cse12 (+ .cse11 c_~B~0.offset))) (.cse3 (select .cse10 (+ ~A~0.offset .cse11)))) (or (< .cse2 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse2 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse3) (= .cse3 .cse1) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse6 (* .cse0 4))) (let ((.cse7 (+ (select (select .cse8 v_arrayElimCell_15) (+ .cse6 v_arrayElimCell_12)) c_~res1~0)) (.cse9 (* .cse2 4))) (or (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_11 Int)) (let ((.cse4 (+ c_~res2~0 (select (select .cse8 v_arrayElimCell_14) (+ .cse9 v_arrayElimCell_11))))) (or (= .cse4 (+ c_~res1~0 (select .cse5 (+ .cse6 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= .cse7 .cse4)))) (= .cse7 (+ c_~res2~0 (select .cse5 (+ .cse9 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< .cse3 0))))) (= |c_ULTIMATE.start_main_~i~3#1| .cse1) (< |c_ULTIMATE.start_main_~i~3#1| .cse1))))) (< .cse0 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse20 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse19 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse20))) (let ((.cse24 (select .cse19 c_~B~0.base))) (let ((.cse15 (select .cse24 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse15 1)) (forall ((~M~0 Int)) (let ((.cse18 (* ~M~0 4))) (let ((.cse23 (select .cse24 (+ .cse18 c_~B~0.offset)))) (let ((.cse21 (* .cse23 4)) (.cse22 (+ c_~res1~0 (select .cse20 (+ (* .cse15 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse17 (select .cse19 ~A~0.base))) (let ((.cse16 (select .cse17 (+ ~A~0.offset .cse18)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse16) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse17 ~A~0.offset))) (< .cse16 0))))) (= (+ c_~res2~0 (select .cse20 (+ .cse21 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse22) (< .cse23 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse23 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_12 Int)) (= (+ (select (select .cse19 v_arrayElimCell_14) (+ .cse21 v_arrayElimCell_12)) c_~res2~0) .cse22)) (< c_~N~0 (+ ~M~0 1))))))) (< .cse15 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse39 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse34 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse39))) (let ((.cse40 (select .cse34 c_~B~0.base))) (let ((.cse25 (select .cse40 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse25 1)) (< .cse25 0) (forall ((~M~0 Int)) (let ((.cse38 (* ~M~0 4))) (let ((.cse28 (select .cse40 (+ .cse38 c_~B~0.offset)))) (let ((.cse33 (* .cse28 4)) (.cse32 (* .cse25 4))) (let ((.cse27 (+ c_~res1~0 (select .cse39 (+ .cse32 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse26 (+ c_~res2~0 (select .cse39 (+ .cse33 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= .cse26 .cse27) (< .cse28 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse28 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse31 (select .cse34 v_arrayElimCell_15))) (let ((.cse30 (+ (select .cse31 (+ .cse33 v_arrayElimCell_11)) c_~res2~0)) (.cse29 (+ (select .cse31 (+ .cse32 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse29 .cse30) (= .cse30 .cse27) (= .cse29 .cse26))))) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse37 (select .cse34 ~A~0.base))) (let ((.cse36 (select .cse37 (+ ~A~0.offset .cse38))) (.cse35 (select .cse37 ~A~0.offset))) (or (< .cse35 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse36) (= .cse36 .cse35) (< .cse36 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse35))))))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse47 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse43 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse47))) (let ((.cse53 (select .cse43 c_~B~0.base))) (let ((.cse41 (select .cse53 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse41 1)) (forall ((~M~0 Int)) (let ((.cse51 (* ~M~0 4))) (let ((.cse52 (select .cse53 (+ .cse51 c_~B~0.offset)))) (let ((.cse44 (* .cse52 4))) (let ((.cse45 (+ c_~res2~0 (select .cse47 (+ .cse44 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse46 (* .cse41 4))) (or (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse42 (+ (select (select .cse43 v_arrayElimCell_15) (+ .cse46 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse42 (+ (select (select .cse43 v_arrayElimCell_14) (+ .cse44 v_arrayElimCell_12)) c_~res2~0)) (= .cse42 .cse45)))) (= .cse45 (+ c_~res1~0 (select .cse47 (+ .cse46 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse50 (select .cse43 ~A~0.base))) (let ((.cse49 (select .cse50 (+ ~A~0.offset .cse51))) (.cse48 (select .cse50 ~A~0.offset))) (or (< .cse48 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse49) (= .cse49 .cse48) (= |c_ULTIMATE.start_main_~i~3#1| .cse48) (< .cse49 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse48))))) (< .cse52 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse52 1)) (< c_~N~0 (+ ~M~0 1)))))))) (< .cse41 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse59 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse58 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse59))) (let ((.cse63 (select .cse58 c_~B~0.base))) (let ((.cse54 (select .cse63 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse54 1)) (< .cse54 0) (forall ((~M~0 Int)) (let ((.cse57 (* ~M~0 4))) (let ((.cse62 (select .cse63 (+ .cse57 c_~B~0.offset)))) (let ((.cse60 (* .cse62 4)) (.cse61 (+ c_~res1~0 (select .cse59 (+ (* .cse54 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse56 (select .cse58 ~A~0.base))) (let ((.cse55 (select .cse56 (+ ~A~0.offset .cse57)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse55) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse56 ~A~0.offset))) (< .cse55 0))))) (= (+ c_~res2~0 (select .cse59 (+ .cse60 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse61) (< .cse62 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse62 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_11 Int)) (= (+ c_~res2~0 (select (select .cse58 v_arrayElimCell_14) (+ .cse60 v_arrayElimCell_11))) .cse61))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse69 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse68 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse69))) (let ((.cse76 (select .cse68 c_~B~0.base))) (let ((.cse64 (select .cse76 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse64 1)) (< .cse64 0) (forall ((~M~0 Int)) (let ((.cse67 (* ~M~0 4))) (let ((.cse72 (select .cse76 (+ .cse67 c_~B~0.offset))) (.cse74 (* .cse64 4))) (let ((.cse71 (+ c_~res1~0 (select .cse69 (+ .cse74 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse70 (* .cse72 4))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse66 (select .cse68 ~A~0.base))) (let ((.cse65 (select .cse66 (+ ~A~0.offset .cse67)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse65) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse66 ~A~0.offset))) (< .cse65 0))))) (= (+ c_~res2~0 (select .cse69 (+ .cse70 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse71) (< .cse72 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse72 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse73 (select .cse68 v_arrayElimCell_15))) (let ((.cse75 (+ (select .cse73 (+ .cse70 v_arrayElimCell_11)) c_~res2~0))) (or (= (+ (select .cse73 (+ .cse74 v_arrayElimCell_12)) c_~res1~0) .cse75) (= .cse75 .cse71)))))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse82 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse80 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse82))) (let ((.cse87 (select .cse80 c_~B~0.base))) (let ((.cse77 (select .cse87 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse77 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse85 (select .cse80 ~A~0.base))) (let ((.cse78 (select .cse85 ~A~0.offset))) (or (< .cse78 0) (forall ((~M~0 Int)) (let ((.cse86 (* ~M~0 4))) (let ((.cse83 (select .cse87 (+ .cse86 c_~B~0.offset))) (.cse84 (select .cse85 (+ ~A~0.offset .cse86)))) (or (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse79 (+ (select (select .cse80 v_arrayElimCell_15) (+ (* .cse77 4) v_arrayElimCell_12)) c_~res1~0)) (.cse81 (* .cse83 4))) (or (= .cse79 (+ (select (select .cse80 v_arrayElimCell_14) (+ .cse81 v_arrayElimCell_12)) c_~res2~0)) (= .cse79 (+ c_~res2~0 (select .cse82 (+ .cse81 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< .cse83 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse83 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse84) (= .cse84 .cse78) (< c_~N~0 (+ ~M~0 1)) (< .cse84 0))))) (= |c_ULTIMATE.start_main_~i~3#1| .cse78) (< |c_ULTIMATE.start_main_~i~3#1| .cse78))))) (< .cse77 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse95 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse94 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse95))) (let ((.cse101 (select .cse94 c_~B~0.base))) (let ((.cse88 (select .cse101 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse88 1)) (forall ((~M~0 Int)) (let ((.cse99 (* ~M~0 4))) (let ((.cse100 (select .cse101 (+ .cse99 c_~B~0.offset)))) (let ((.cse91 (* .cse100 4))) (let ((.cse92 (+ c_~res2~0 (select .cse95 (+ .cse91 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse93 (* .cse88 4))) (or (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse90 (select .cse94 v_arrayElimCell_15))) (let ((.cse89 (+ (select .cse90 (+ .cse93 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse89 (+ (select .cse90 (+ .cse91 v_arrayElimCell_11)) c_~res2~0)) (= .cse89 .cse92))))) (= .cse92 (+ c_~res1~0 (select .cse95 (+ .cse93 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse98 (select .cse94 ~A~0.base))) (let ((.cse97 (select .cse98 (+ ~A~0.offset .cse99))) (.cse96 (select .cse98 ~A~0.offset))) (or (< .cse96 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse97) (= .cse97 .cse96) (= |c_ULTIMATE.start_main_~i~3#1| .cse96) (< .cse97 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse96))))) (< .cse100 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse100 1)) (< c_~N~0 (+ ~M~0 1)))))))) (< .cse88 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse108 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse110 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse108))) (let ((.cse112 (select .cse110 c_~B~0.base))) (let ((.cse102 (select .cse112 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse102 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse114 (select .cse110 ~A~0.base))) (let ((.cse103 (select .cse114 ~A~0.offset))) (or (< .cse103 0) (= |c_ULTIMATE.start_main_~i~3#1| .cse103) (forall ((~M~0 Int)) (let ((.cse113 (* ~M~0 4))) (let ((.cse105 (select .cse114 (+ ~A~0.offset .cse113))) (.cse104 (select .cse112 (+ .cse113 c_~B~0.offset)))) (or (< .cse104 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse104 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse105) (= .cse105 .cse103) (< c_~N~0 (+ ~M~0 1)) (< .cse105 0) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse109 (* .cse102 4))) (let ((.cse106 (+ (select (select .cse110 v_arrayElimCell_15) (+ .cse109 v_arrayElimCell_12)) c_~res1~0)) (.cse111 (* .cse104 4))) (or (forall ((v_arrayElimCell_14 Int)) (let ((.cse107 (+ (select (select .cse110 v_arrayElimCell_14) (+ .cse111 v_arrayElimCell_12)) c_~res2~0))) (or (= .cse106 .cse107) (= .cse107 (+ c_~res1~0 (select .cse108 (+ .cse109 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (= .cse106 (+ c_~res2~0 (select .cse108 (+ .cse111 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))))) (< |c_ULTIMATE.start_main_~i~3#1| .cse103))))) (< .cse102 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse116 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse121 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse116))) (let ((.cse122 (select .cse121 c_~B~0.base))) (let ((.cse115 (select .cse122 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse115 1)) (forall ((~M~0 Int)) (let ((.cse120 (* ~M~0 4))) (let ((.cse117 (select .cse122 (+ .cse120 c_~B~0.offset)))) (or (= (+ c_~res2~0 (select .cse116 (+ (* .cse117 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ c_~res1~0 (select .cse116 (+ (* .cse115 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< .cse117 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse117 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse119 (select .cse121 ~A~0.base))) (let ((.cse118 (select .cse119 ~A~0.offset))) (or (< .cse118 0) (not (= |c_ULTIMATE.start_main_~i~3#1| .cse118)) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse119 (+ ~A~0.offset .cse120)))))))))))) (< .cse115 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse128 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse130 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse128))) (let ((.cse134 (select .cse130 c_~B~0.base))) (let ((.cse123 (select .cse134 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse123 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse132 (select .cse130 ~A~0.base))) (let ((.cse124 (select .cse132 ~A~0.offset))) (or (< .cse124 0) (forall ((~M~0 Int)) (let ((.cse133 (* ~M~0 4))) (let ((.cse129 (select .cse134 (+ .cse133 c_~B~0.offset))) (.cse131 (select .cse132 (+ ~A~0.offset .cse133)))) (or (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse126 (select .cse130 v_arrayElimCell_15))) (let ((.cse125 (+ (select .cse126 (+ (* .cse123 4) v_arrayElimCell_12)) c_~res1~0)) (.cse127 (* .cse129 4))) (or (= .cse125 (+ (select .cse126 (+ .cse127 v_arrayElimCell_11)) c_~res2~0)) (= .cse125 (+ c_~res2~0 (select .cse128 (+ .cse127 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< .cse129 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse129 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse131) (= .cse131 .cse124) (< c_~N~0 (+ ~M~0 1)) (< .cse131 0))))) (= |c_ULTIMATE.start_main_~i~3#1| .cse124) (< |c_ULTIMATE.start_main_~i~3#1| .cse124))))) (< .cse123 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse146 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse139 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse146))) (let ((.cse147 (select .cse139 c_~B~0.base))) (let ((.cse135 (select .cse147 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse135 1)) (< .cse135 0) (forall ((~M~0 Int)) (let ((.cse138 (* ~M~0 4))) (let ((.cse142 (select .cse147 (+ .cse138 c_~B~0.offset)))) (let ((.cse144 (* .cse142 4)) (.cse145 (* .cse135 4))) (let ((.cse141 (+ c_~res1~0 (select .cse146 (+ .cse145 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse140 (+ c_~res2~0 (select .cse146 (+ .cse144 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse137 (select .cse139 ~A~0.base))) (let ((.cse136 (select .cse137 (+ ~A~0.offset .cse138)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse136) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse137 ~A~0.offset))) (< .cse136 0))))) (= .cse140 .cse141) (< .cse142 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse142 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse143 (select .cse139 v_arrayElimCell_15))) (or (= (+ c_~res2~0 (select .cse143 (+ .cse144 v_arrayElimCell_12))) .cse141) (= (+ (select .cse143 (+ .cse145 v_arrayElimCell_12)) c_~res1~0) .cse140)))))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse162 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse153 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse162))) (let ((.cse163 (select .cse153 c_~B~0.base))) (let ((.cse148 (select .cse163 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse148 1)) (forall ((~M~0 Int)) (let ((.cse152 (* ~M~0 4))) (let ((.cse156 (select .cse163 (+ .cse152 c_~B~0.offset)))) (let ((.cse161 (* .cse156 4)) (.cse160 (* .cse148 4))) (let ((.cse155 (+ c_~res1~0 (select .cse162 (+ .cse160 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse154 (+ c_~res2~0 (select .cse162 (+ .cse161 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse151 (select .cse153 ~A~0.base))) (let ((.cse150 (select .cse151 (+ ~A~0.offset .cse152))) (.cse149 (select .cse151 ~A~0.offset))) (or (< .cse149 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse150) (< .cse150 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse149))))) (= .cse154 .cse155) (< .cse156 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse156 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse159 (select .cse153 v_arrayElimCell_15))) (let ((.cse158 (+ c_~res2~0 (select .cse159 (+ .cse161 v_arrayElimCell_12)))) (.cse157 (+ (select .cse159 (+ .cse160 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse157 .cse158) (= .cse158 .cse155) (= .cse157 .cse154))))) (< c_~N~0 (+ ~M~0 1)))))))) (< .cse148 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse169 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse168 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse169))) (let ((.cse173 (select .cse168 c_~B~0.base))) (let ((.cse164 (select .cse173 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse164 1)) (forall ((~M~0 Int)) (let ((.cse167 (* ~M~0 4))) (let ((.cse172 (select .cse173 (+ .cse167 c_~B~0.offset)))) (let ((.cse170 (* .cse172 4)) (.cse171 (+ c_~res1~0 (select .cse169 (+ (* .cse164 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse166 (select .cse168 ~A~0.base))) (let ((.cse165 (select .cse166 (+ ~A~0.offset .cse167)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse165) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse166 ~A~0.offset))) (< .cse165 0))))) (= (+ c_~res2~0 (select .cse169 (+ .cse170 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse171) (< .cse172 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse172 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (= (+ (select (select .cse168 v_arrayElimCell_15) (+ .cse170 v_arrayElimCell_11)) c_~res2~0) .cse171))))))) (< .cse164 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse186 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse179 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse186))) (let ((.cse187 (select .cse179 c_~B~0.base))) (let ((.cse174 (select .cse187 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse174 1)) (< .cse174 0) (forall ((~M~0 Int)) (let ((.cse178 (* ~M~0 4))) (let ((.cse182 (select .cse187 (+ .cse178 c_~B~0.offset)))) (let ((.cse184 (* .cse182 4)) (.cse185 (* .cse174 4))) (let ((.cse181 (+ c_~res1~0 (select .cse186 (+ .cse185 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse180 (+ c_~res2~0 (select .cse186 (+ .cse184 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse177 (select .cse179 ~A~0.base))) (let ((.cse176 (select .cse177 ~A~0.offset)) (.cse175 (select .cse177 (+ ~A~0.offset .cse178)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse175) (not (= |c_ULTIMATE.start_main_~i~3#1| .cse176)) (= .cse175 .cse176) (< .cse175 0))))) (= .cse180 .cse181) (< .cse182 0) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse183 (select .cse179 v_arrayElimCell_15))) (or (= (+ (select .cse183 (+ .cse184 v_arrayElimCell_11)) c_~res2~0) .cse181) (= (+ (select .cse183 (+ .cse185 v_arrayElimCell_12)) c_~res1~0) .cse180)))) (< ~M~0 0) (< c_~maxB~0 (+ .cse182 1)) (< c_~N~0 (+ ~M~0 1)))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse196 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse193 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse196))) (let ((.cse198 (select .cse193 c_~B~0.base))) (let ((.cse188 (select .cse198 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse188 1)) (forall ((~M~0 Int)) (let ((.cse192 (* ~M~0 4))) (let ((.cse194 (select .cse198 (+ .cse192 c_~B~0.offset)))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse191 (select .cse193 ~A~0.base))) (let ((.cse190 (select .cse191 (+ ~A~0.offset .cse192))) (.cse189 (select .cse191 ~A~0.offset))) (or (< .cse189 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse190) (= .cse190 .cse189) (= |c_ULTIMATE.start_main_~i~3#1| .cse190) (< .cse190 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse189))))) (< .cse194 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse194 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse197 (* .cse188 4)) (.cse195 (+ c_~res2~0 (select (select .cse193 v_arrayElimCell_14) (+ (* .cse194 4) v_arrayElimCell_11))))) (or (= .cse195 (+ c_~res1~0 (select .cse196 (+ .cse197 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= (+ (select (select .cse193 v_arrayElimCell_15) (+ .cse197 v_arrayElimCell_12)) c_~res1~0) .cse195)))))))) (< .cse188 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse208 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse205 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse208))) (let ((.cse212 (select .cse205 c_~B~0.base))) (let ((.cse199 (select .cse212 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse199 1)) (< .cse199 0) (forall ((~M~0 Int)) (let ((.cse204 (* ~M~0 4))) (let ((.cse200 (select .cse212 (+ .cse204 c_~B~0.offset)))) (or (< .cse200 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse200 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse203 (select .cse205 ~A~0.base))) (let ((.cse202 (select .cse203 (+ ~A~0.offset .cse204))) (.cse201 (select .cse203 ~A~0.offset))) (or (< .cse201 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse202) (= |c_ULTIMATE.start_main_~i~3#1| .cse201) (< .cse202 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse201))))) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse209 (* .cse199 4)) (.cse211 (select .cse205 v_arrayElimCell_15)) (.cse210 (* .cse200 4))) (let ((.cse207 (+ c_~res2~0 (select .cse211 (+ .cse210 v_arrayElimCell_12)))) (.cse206 (+ (select .cse211 (+ .cse209 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse206 .cse207) (= .cse207 (+ c_~res1~0 (select .cse208 (+ .cse209 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (= .cse206 (+ c_~res2~0 (select .cse208 (+ .cse210 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< c_~N~0 (+ ~M~0 1)))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse224 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse218 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse224))) (let ((.cse225 (select .cse218 c_~B~0.base))) (let ((.cse213 (select .cse225 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse213 1)) (forall ((~M~0 Int)) (let ((.cse217 (* ~M~0 4))) (let ((.cse221 (select .cse225 (+ .cse217 c_~B~0.offset)))) (let ((.cse222 (* .cse221 4)) (.cse223 (* .cse213 4))) (let ((.cse220 (+ c_~res1~0 (select .cse224 (+ .cse223 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse219 (+ c_~res2~0 (select .cse224 (+ .cse222 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse216 (select .cse218 ~A~0.base))) (let ((.cse215 (select .cse216 ~A~0.offset)) (.cse214 (select .cse216 (+ ~A~0.offset .cse217)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse214) (not (= |c_ULTIMATE.start_main_~i~3#1| .cse215)) (= .cse214 .cse215) (< .cse214 0))))) (= .cse219 .cse220) (< .cse221 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse221 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (or (= (+ (select (select .cse218 v_arrayElimCell_14) (+ .cse222 v_arrayElimCell_12)) c_~res2~0) .cse220) (= (+ (select (select .cse218 v_arrayElimCell_15) (+ .cse223 v_arrayElimCell_12)) c_~res1~0) .cse219))))))))) (< .cse213 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse236 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse231 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse236))) (let ((.cse237 (select .cse231 c_~B~0.base))) (let ((.cse226 (select .cse237 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse226 1)) (forall ((~M~0 Int)) (let ((.cse230 (* ~M~0 4))) (let ((.cse232 (select .cse237 (+ .cse230 c_~B~0.offset)))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse229 (select .cse231 ~A~0.base))) (let ((.cse228 (select .cse229 (+ ~A~0.offset .cse230))) (.cse227 (select .cse229 ~A~0.offset))) (or (< .cse227 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse228) (= .cse228 .cse227) (= |c_ULTIMATE.start_main_~i~3#1| .cse228) (< .cse228 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse227))))) (< .cse232 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse232 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse233 (select .cse231 v_arrayElimCell_15))) (let ((.cse235 (+ (select .cse233 (+ (* .cse232 4) v_arrayElimCell_11)) c_~res2~0)) (.cse234 (* .cse226 4))) (or (= (+ (select .cse233 (+ .cse234 v_arrayElimCell_12)) c_~res1~0) .cse235) (= .cse235 (+ c_~res1~0 (select .cse236 (+ .cse234 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))))))) (< .cse226 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse244 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395)))) (let ((.cse245 (select .cse244 c_~B~0.base))) (let ((.cse238 (select .cse245 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse238 1)) (< .cse238 0) (forall ((~M~0 Int)) (let ((.cse243 (* ~M~0 4))) (let ((.cse239 (select .cse245 (+ .cse243 c_~B~0.offset)))) (or (< .cse239 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse239 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse242 (select .cse244 ~A~0.base))) (let ((.cse241 (select .cse242 (+ ~A~0.offset .cse243))) (.cse240 (select .cse242 ~A~0.offset))) (or (< .cse240 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse241) (= .cse241 .cse240) (= |c_ULTIMATE.start_main_~i~3#1| .cse240) (= |c_ULTIMATE.start_main_~i~3#1| .cse241) (< .cse241 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse240))))) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (= (+ (select (select .cse244 v_arrayElimCell_15) (+ (* .cse238 4) v_arrayElimCell_12)) c_~res1~0) (+ c_~res2~0 (select (select .cse244 v_arrayElimCell_14) (+ (* .cse239 4) v_arrayElimCell_11)))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse259 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse254 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse259))) (let ((.cse260 (select .cse254 c_~B~0.base))) (let ((.cse246 (select .cse260 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse246 1)) (forall ((~M~0 Int)) (let ((.cse253 (* ~M~0 4))) (let ((.cse249 (select .cse260 (+ .cse253 c_~B~0.offset)))) (let ((.cse258 (* .cse249 4)) (.cse257 (* .cse246 4))) (let ((.cse248 (+ c_~res1~0 (select .cse259 (+ .cse257 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse247 (+ c_~res2~0 (select .cse259 (+ .cse258 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= .cse247 .cse248) (< .cse249 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse249 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse252 (select .cse254 ~A~0.base))) (let ((.cse251 (select .cse252 (+ ~A~0.offset .cse253))) (.cse250 (select .cse252 ~A~0.offset))) (or (< .cse250 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse251) (= .cse251 .cse250) (< .cse251 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse250))))) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse256 (+ (select (select .cse254 v_arrayElimCell_14) (+ .cse258 v_arrayElimCell_12)) c_~res2~0)) (.cse255 (+ (select (select .cse254 v_arrayElimCell_15) (+ .cse257 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse255 .cse256) (= .cse256 .cse248) (= .cse255 .cse247)))))))))) (< .cse246 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse263 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse262 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse263))) (let ((.cse268 (select .cse262 c_~B~0.base))) (let ((.cse264 (select .cse268 c_~B~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse267 (* ~M~0 4))) (let ((.cse261 (select .cse268 (+ .cse267 c_~B~0.offset)))) (or (< .cse261 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse261 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_12 Int)) (= (+ (select (select .cse262 v_arrayElimCell_14) (+ (* .cse261 4) v_arrayElimCell_12)) c_~res2~0) (+ c_~res1~0 (select .cse263 (+ (* .cse264 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse266 (select .cse262 ~A~0.base))) (let ((.cse265 (select .cse266 (+ ~A~0.offset .cse267)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse265) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse266 ~A~0.offset))) (= |c_ULTIMATE.start_main_~i~3#1| .cse265) (< .cse265 0))))))))) (< c_~maxB~0 (+ .cse264 1)) (< .cse264 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse274 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse273 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse274))) (let ((.cse280 (select .cse273 c_~B~0.base))) (let ((.cse269 (select .cse280 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse269 1)) (< .cse269 0) (forall ((~M~0 Int)) (let ((.cse272 (* ~M~0 4))) (let ((.cse277 (select .cse280 (+ .cse272 c_~B~0.offset))) (.cse279 (* .cse269 4))) (let ((.cse276 (+ c_~res1~0 (select .cse274 (+ .cse279 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse275 (* .cse277 4))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse271 (select .cse273 ~A~0.base))) (let ((.cse270 (select .cse271 (+ ~A~0.offset .cse272)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse270) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse271 ~A~0.offset))) (< .cse270 0))))) (= (+ c_~res2~0 (select .cse274 (+ .cse275 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse276) (< .cse277 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse277 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse278 (+ c_~res2~0 (select (select .cse273 v_arrayElimCell_14) (+ .cse275 v_arrayElimCell_11))))) (or (= .cse278 .cse276) (= (+ (select (select .cse273 v_arrayElimCell_15) (+ .cse279 v_arrayElimCell_12)) c_~res1~0) .cse278))))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse284 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse282 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse284))) (let ((.cse288 (select .cse282 c_~B~0.base))) (let ((.cse281 (select .cse288 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse281 1)) (< .cse281 0) (forall ((~M~0 Int)) (let ((.cse287 (* ~M~0 4))) (let ((.cse283 (select .cse288 (+ .cse287 c_~B~0.offset)))) (or (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (= (+ c_~res2~0 (select (select .cse282 v_arrayElimCell_15) (+ (* .cse283 4) v_arrayElimCell_12))) (+ c_~res1~0 (select .cse284 (+ (* .cse281 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< .cse283 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse283 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse286 (select .cse282 ~A~0.base))) (let ((.cse285 (select .cse286 (+ ~A~0.offset .cse287)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse285) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse286 ~A~0.offset))) (= |c_ULTIMATE.start_main_~i~3#1| .cse285) (< .cse285 0))))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse294 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse298 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse294))) (let ((.cse302 (select .cse298 c_~B~0.base))) (let ((.cse289 (select .cse302 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse289 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse300 (select .cse298 ~A~0.base))) (let ((.cse290 (select .cse300 ~A~0.offset))) (or (< .cse290 0) (forall ((~M~0 Int)) (let ((.cse301 (* ~M~0 4))) (let ((.cse291 (select .cse302 (+ .cse301 c_~B~0.offset))) (.cse299 (select .cse300 (+ ~A~0.offset .cse301)))) (or (< .cse291 0) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse296 (select .cse298 v_arrayElimCell_15)) (.cse295 (* .cse289 4))) (let ((.cse292 (+ (select .cse296 (+ .cse295 v_arrayElimCell_12)) c_~res1~0)) (.cse297 (* .cse291 4))) (or (forall ((v_arrayElimCell_11 Int)) (let ((.cse293 (+ (select .cse296 (+ .cse297 v_arrayElimCell_11)) c_~res2~0))) (or (= .cse292 .cse293) (= .cse293 (+ c_~res1~0 (select .cse294 (+ .cse295 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (= .cse292 (+ c_~res2~0 (select .cse294 (+ .cse297 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< ~M~0 0) (< c_~maxB~0 (+ .cse291 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse299) (= .cse299 .cse290) (< c_~N~0 (+ ~M~0 1)) (< .cse299 0))))) (= |c_ULTIMATE.start_main_~i~3#1| .cse290) (< |c_ULTIMATE.start_main_~i~3#1| .cse290))))) (< .cse289 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse314 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse308 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse314))) (let ((.cse315 (select .cse308 c_~B~0.base))) (let ((.cse303 (select .cse315 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse303 1)) (< .cse303 0) (forall ((~M~0 Int)) (let ((.cse307 (* ~M~0 4))) (let ((.cse311 (select .cse315 (+ .cse307 c_~B~0.offset)))) (let ((.cse312 (* .cse303 4)) (.cse313 (* .cse311 4))) (let ((.cse309 (+ c_~res2~0 (select .cse314 (+ .cse313 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse310 (+ c_~res1~0 (select .cse314 (+ .cse312 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse306 (select .cse308 ~A~0.base))) (let ((.cse305 (select .cse306 ~A~0.offset)) (.cse304 (select .cse306 (+ ~A~0.offset .cse307)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse304) (not (= |c_ULTIMATE.start_main_~i~3#1| .cse305)) (= .cse304 .cse305) (< .cse304 0))))) (= .cse309 .cse310) (< .cse311 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse311 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (= (+ (select (select .cse308 v_arrayElimCell_15) (+ .cse312 v_arrayElimCell_12)) c_~res1~0) .cse309)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_11 Int)) (= (+ c_~res2~0 (select (select .cse308 v_arrayElimCell_14) (+ .cse313 v_arrayElimCell_11))) .cse310)))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse320 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse322 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse320))) (let ((.cse327 (select .cse322 c_~B~0.base))) (let ((.cse316 (select .cse327 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse316 1)) (< .cse316 0) (forall ((~M~0 Int)) (let ((.cse326 (* ~M~0 4))) (let ((.cse321 (select .cse327 (+ .cse326 c_~B~0.offset)))) (or (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse318 (select .cse322 v_arrayElimCell_15))) (let ((.cse317 (+ (select .cse318 (+ (* .cse316 4) v_arrayElimCell_12)) c_~res1~0)) (.cse319 (* .cse321 4))) (or (= .cse317 (+ c_~res2~0 (select .cse318 (+ .cse319 v_arrayElimCell_12)))) (= .cse317 (+ c_~res2~0 (select .cse320 (+ .cse319 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< .cse321 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse321 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse325 (select .cse322 ~A~0.base))) (let ((.cse324 (select .cse325 (+ ~A~0.offset .cse326))) (.cse323 (select .cse325 ~A~0.offset))) (or (< .cse323 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse324) (= |c_ULTIMATE.start_main_~i~3#1| .cse323) (< .cse324 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse323))))) (< c_~N~0 (+ ~M~0 1)))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse334 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse333 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse334))) (let ((.cse335 (select .cse333 c_~B~0.base))) (let ((.cse328 (select .cse335 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse328 1)) (forall ((~M~0 Int)) (let ((.cse332 (* ~M~0 4))) (let ((.cse329 (select .cse335 (+ .cse332 c_~B~0.offset)))) (or (< .cse329 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse329 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse331 (select .cse333 ~A~0.base))) (let ((.cse330 (select .cse331 (+ ~A~0.offset .cse332)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse330) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse331 ~A~0.offset))) (= |c_ULTIMATE.start_main_~i~3#1| .cse330) (< .cse330 0))))) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (= (+ (select (select .cse333 v_arrayElimCell_15) (+ (* .cse329 4) v_arrayElimCell_11)) c_~res2~0) (+ c_~res1~0 (select .cse334 (+ (* .cse328 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) (< .cse328 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse337 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395)))) (let ((.cse343 (select .cse337 c_~B~0.base))) (let ((.cse336 (select .cse343 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse336 1)) (< .cse336 0) (forall ((~M~0 Int)) (let ((.cse342 (* ~M~0 4))) (let ((.cse338 (select .cse343 (+ .cse342 c_~B~0.offset)))) (or (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (= (+ (select (select .cse337 v_arrayElimCell_15) (+ (* .cse336 4) v_arrayElimCell_12)) c_~res1~0) (+ (select (select .cse337 v_arrayElimCell_14) (+ (* .cse338 4) v_arrayElimCell_12)) c_~res2~0))) (< .cse338 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse338 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse341 (select .cse337 ~A~0.base))) (let ((.cse340 (select .cse341 (+ ~A~0.offset .cse342))) (.cse339 (select .cse341 ~A~0.offset))) (or (< .cse339 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse340) (= .cse340 .cse339) (= |c_ULTIMATE.start_main_~i~3#1| .cse339) (= |c_ULTIMATE.start_main_~i~3#1| .cse340) (< .cse340 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse339)))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse350 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse349 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse350))) (let ((.cse351 (select .cse349 c_~B~0.base))) (let ((.cse344 (select .cse351 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse344 1)) (< .cse344 0) (forall ((~M~0 Int)) (let ((.cse348 (* ~M~0 4))) (let ((.cse345 (select .cse351 (+ .cse348 c_~B~0.offset)))) (or (< .cse345 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse345 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse347 (select .cse349 ~A~0.base))) (let ((.cse346 (select .cse347 (+ ~A~0.offset .cse348)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse346) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse347 ~A~0.offset))) (= |c_ULTIMATE.start_main_~i~3#1| .cse346) (< .cse346 0))))) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_11 Int)) (= (+ c_~res2~0 (select (select .cse349 v_arrayElimCell_14) (+ (* .cse345 4) v_arrayElimCell_11))) (+ c_~res1~0 (select .cse350 (+ (* .cse344 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse359 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse353 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse359))) (let ((.cse361 (select .cse353 c_~B~0.base))) (let ((.cse352 (select .cse361 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse352 1)) (forall ((~M~0 Int)) (let ((.cse358 (* ~M~0 4))) (let ((.cse360 (select .cse361 (+ .cse358 c_~B~0.offset)))) (let ((.cse354 (* .cse360 4)) (.cse355 (+ c_~res1~0 (select .cse359 (+ (* .cse352 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (= (+ c_~res2~0 (select (select .cse353 v_arrayElimCell_15) (+ .cse354 v_arrayElimCell_12))) .cse355)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse357 (select .cse353 ~A~0.base))) (let ((.cse356 (select .cse357 (+ ~A~0.offset .cse358)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse356) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse357 ~A~0.offset))) (< .cse356 0))))) (= (+ c_~res2~0 (select .cse359 (+ .cse354 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse355) (< .cse360 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse360 1)) (< c_~N~0 (+ ~M~0 1))))))) (< .cse352 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse368 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse367 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse368))) (let ((.cse369 (select .cse367 c_~B~0.base))) (let ((.cse362 (select .cse369 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse362 1)) (forall ((~M~0 Int)) (let ((.cse366 (* ~M~0 4))) (let ((.cse363 (select .cse369 (+ .cse366 c_~B~0.offset)))) (or (< .cse363 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse363 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse365 (select .cse367 ~A~0.base))) (let ((.cse364 (select .cse365 ~A~0.offset))) (or (< .cse364 0) (= |c_ULTIMATE.start_main_~i~3#1| .cse364) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse365 (+ ~A~0.offset .cse366)))) (< |c_ULTIMATE.start_main_~i~3#1| .cse364))))) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (= (+ (select (select .cse367 v_arrayElimCell_15) (+ (* .cse362 4) v_arrayElimCell_12)) c_~res1~0) (+ c_~res2~0 (select .cse368 (+ (* .cse363 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< c_~N~0 (+ ~M~0 1)))))) (< .cse362 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse379 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse375 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse379))) (let ((.cse380 (select .cse375 c_~B~0.base))) (let ((.cse370 (select .cse380 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse370 1)) (forall ((~M~0 Int)) (let ((.cse374 (* ~M~0 4))) (let ((.cse376 (select .cse380 (+ .cse374 c_~B~0.offset)))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse373 (select .cse375 ~A~0.base))) (let ((.cse372 (select .cse373 (+ ~A~0.offset .cse374))) (.cse371 (select .cse373 ~A~0.offset))) (or (< .cse371 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse372) (= .cse372 .cse371) (= |c_ULTIMATE.start_main_~i~3#1| .cse372) (< .cse372 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse371))))) (< .cse376 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse376 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse378 (+ (select (select .cse375 v_arrayElimCell_14) (+ (* .cse376 4) v_arrayElimCell_12)) c_~res2~0)) (.cse377 (* .cse370 4))) (or (= (+ (select (select .cse375 v_arrayElimCell_15) (+ .cse377 v_arrayElimCell_12)) c_~res1~0) .cse378) (= .cse378 (+ c_~res1~0 (select .cse379 (+ .cse377 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))))) (< .cse370 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse384 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395)))) (let ((.cse389 (select .cse384 c_~B~0.base))) (let ((.cse381 (select .cse389 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse381 1)) (forall ((~M~0 Int)) (let ((.cse388 (* ~M~0 4))) (let ((.cse382 (select .cse389 (+ .cse388 c_~B~0.offset)))) (or (< .cse382 0) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse383 (select .cse384 v_arrayElimCell_15))) (= (+ (select .cse383 (+ (* .cse381 4) v_arrayElimCell_12)) c_~res1~0) (+ c_~res2~0 (select .cse383 (+ (* .cse382 4) v_arrayElimCell_12)))))) (< ~M~0 0) (< c_~maxB~0 (+ .cse382 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse387 (select .cse384 ~A~0.base))) (let ((.cse386 (select .cse387 (+ ~A~0.offset .cse388))) (.cse385 (select .cse387 ~A~0.offset))) (or (< .cse385 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse386) (= |c_ULTIMATE.start_main_~i~3#1| .cse385) (= |c_ULTIMATE.start_main_~i~3#1| .cse386) (< .cse386 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse385))))))))) (< .cse381 0)))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse393 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395)))) (let ((.cse398 (select .cse393 c_~B~0.base))) (let ((.cse390 (select .cse398 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse390 1)) (< .cse390 0) (forall ((~M~0 Int)) (let ((.cse397 (* ~M~0 4))) (let ((.cse392 (select .cse398 (+ .cse397 c_~B~0.offset)))) (or (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse391 (select .cse393 v_arrayElimCell_15))) (= (+ (select .cse391 (+ (* .cse390 4) v_arrayElimCell_12)) c_~res1~0) (+ (select .cse391 (+ (* .cse392 4) v_arrayElimCell_11)) c_~res2~0)))) (< .cse392 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse392 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse396 (select .cse393 ~A~0.base))) (let ((.cse395 (select .cse396 (+ ~A~0.offset .cse397))) (.cse394 (select .cse396 ~A~0.offset))) (or (< .cse394 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse395) (= .cse395 .cse394) (= |c_ULTIMATE.start_main_~i~3#1| .cse394) (= |c_ULTIMATE.start_main_~i~3#1| .cse395) (< .cse395 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse394)))))))))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse412 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse404 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse412))) (let ((.cse413 (select .cse404 c_~B~0.base))) (let ((.cse399 (select .cse413 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse399 1)) (forall ((~M~0 Int)) (let ((.cse411 (* ~M~0 4))) (let ((.cse407 (select .cse413 (+ .cse411 c_~B~0.offset)))) (let ((.cse405 (* .cse399 4)) (.cse406 (* .cse407 4))) (let ((.cse403 (+ c_~res2~0 (select .cse412 (+ .cse406 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse401 (+ c_~res1~0 (select .cse412 (+ .cse405 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse400 (+ c_~res2~0 (select (select .cse404 v_arrayElimCell_14) (+ .cse406 v_arrayElimCell_11)))) (.cse402 (+ (select (select .cse404 v_arrayElimCell_15) (+ .cse405 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse400 .cse401) (= .cse402 .cse400) (= .cse402 .cse403)))) (= .cse403 .cse401) (< .cse407 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse407 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse410 (select .cse404 ~A~0.base))) (let ((.cse409 (select .cse410 (+ ~A~0.offset .cse411))) (.cse408 (select .cse410 ~A~0.offset))) (or (< .cse408 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse409) (= .cse409 .cse408) (< .cse409 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse408))))))))))) (< .cse399 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse419 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse420 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse419))) (let ((.cse425 (select .cse420 c_~B~0.base))) (let ((.cse414 (select .cse425 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse414 1)) (forall ((~M~0 Int)) (let ((.cse424 (* ~M~0 4))) (let ((.cse415 (select .cse425 (+ .cse424 c_~B~0.offset)))) (or (< .cse415 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse415 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse416 (select .cse420 v_arrayElimCell_15))) (let ((.cse418 (+ c_~res2~0 (select .cse416 (+ (* .cse415 4) v_arrayElimCell_12)))) (.cse417 (* .cse414 4))) (or (= (+ (select .cse416 (+ .cse417 v_arrayElimCell_12)) c_~res1~0) .cse418) (= .cse418 (+ c_~res1~0 (select .cse419 (+ .cse417 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse423 (select .cse420 ~A~0.base))) (let ((.cse422 (select .cse423 (+ ~A~0.offset .cse424))) (.cse421 (select .cse423 ~A~0.offset))) (or (< .cse421 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse422) (= |c_ULTIMATE.start_main_~i~3#1| .cse422) (< .cse422 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse421))))))))) (< .cse414 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse428 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse431 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse428))) (let ((.cse435 (select .cse431 c_~B~0.base))) (let ((.cse426 (select .cse435 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse426 1)) (forall ((~M~0 Int)) (let ((.cse434 (* ~M~0 4))) (let ((.cse430 (select .cse435 (+ .cse434 c_~B~0.offset)))) (let ((.cse429 (* .cse426 4)) (.cse427 (+ c_~res2~0 (select .cse428 (+ (* .cse430 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (or (= .cse427 (+ c_~res1~0 (select .cse428 (+ .cse429 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< .cse430 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse430 1)) (forall ((v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (= (+ (select (select .cse431 v_arrayElimCell_15) (+ .cse429 v_arrayElimCell_12)) c_~res1~0) .cse427)) (< c_~N~0 (+ ~M~0 1)) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse433 (select .cse431 ~A~0.base))) (let ((.cse432 (select .cse433 ~A~0.offset))) (or (< .cse432 0) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse433 (+ ~A~0.offset .cse434)))) (< |c_ULTIMATE.start_main_~i~3#1| .cse432)))))))))) (< .cse426 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse438 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse444 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse438))) (let ((.cse448 (select .cse444 c_~B~0.base))) (let ((.cse436 (select .cse448 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse436 1)) (forall ((~M~0 Int)) (let ((.cse443 (* ~M~0 4))) (let ((.cse445 (select .cse448 (+ .cse443 c_~B~0.offset)))) (let ((.cse447 (* .cse445 4))) (let ((.cse437 (+ c_~res2~0 (select .cse438 (+ .cse447 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse439 (* .cse436 4))) (or (= .cse437 (+ c_~res1~0 (select .cse438 (+ .cse439 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse442 (select .cse444 ~A~0.base))) (let ((.cse441 (select .cse442 (+ ~A~0.offset .cse443))) (.cse440 (select .cse442 ~A~0.offset))) (or (< .cse440 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse441) (= .cse441 .cse440) (= |c_ULTIMATE.start_main_~i~3#1| .cse440) (< .cse441 0) (< |c_ULTIMATE.start_main_~i~3#1| .cse440))))) (< .cse445 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse445 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse446 (+ (select (select .cse444 v_arrayElimCell_15) (+ .cse439 v_arrayElimCell_12)) c_~res1~0))) (or (= .cse446 (+ c_~res2~0 (select (select .cse444 v_arrayElimCell_14) (+ .cse447 v_arrayElimCell_11)))) (= .cse446 .cse437)))))))))) (< .cse436 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse454 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse453 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse454))) (let ((.cse460 (select .cse453 c_~B~0.base))) (let ((.cse449 (select .cse460 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse449 1)) (forall ((~M~0 Int)) (let ((.cse452 (* ~M~0 4))) (let ((.cse457 (select .cse460 (+ .cse452 c_~B~0.offset))) (.cse458 (* .cse449 4))) (let ((.cse456 (+ c_~res1~0 (select .cse454 (+ .cse458 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (.cse455 (* .cse457 4))) (or (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse451 (select .cse453 ~A~0.base))) (let ((.cse450 (select .cse451 (+ ~A~0.offset .cse452)))) (or (< |c_ULTIMATE.start_main_~i~3#1| .cse450) (not (= |c_ULTIMATE.start_main_~i~3#1| (select .cse451 ~A~0.offset))) (< .cse450 0))))) (= (+ c_~res2~0 (select .cse454 (+ .cse455 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) .cse456) (< .cse457 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse457 1)) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int)) (let ((.cse459 (+ (select (select .cse453 v_arrayElimCell_14) (+ .cse455 v_arrayElimCell_12)) c_~res2~0))) (or (= (+ (select (select .cse453 v_arrayElimCell_15) (+ .cse458 v_arrayElimCell_12)) c_~res1~0) .cse459) (= .cse459 .cse456))))))))) (< .cse449 0))))))) (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| Int) (v_ArrVal_395 Int)) (let ((.cse468 (store .cse13 (+ .cse14 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_395))) (let ((.cse466 (store |c_#memory_int#4| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse468))) (let ((.cse471 (select .cse466 c_~B~0.base))) (let ((.cse461 (select .cse471 c_~B~0.offset))) (or (< c_~maxB~0 (+ .cse461 1)) (< .cse461 0) (forall ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse469 (select .cse466 ~A~0.base))) (let ((.cse462 (select .cse469 ~A~0.offset))) (or (< .cse462 0) (= |c_ULTIMATE.start_main_~i~3#1| .cse462) (forall ((~M~0 Int)) (let ((.cse470 (* ~M~0 4))) (let ((.cse463 (select .cse471 (+ .cse470 c_~B~0.offset))) (.cse464 (select .cse469 (+ ~A~0.offset .cse470)))) (or (< .cse463 0) (< ~M~0 0) (< c_~maxB~0 (+ .cse463 1)) (< |c_ULTIMATE.start_main_~i~3#1| .cse464) (= .cse464 .cse462) (< c_~N~0 (+ ~M~0 1)) (forall ((v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_arrayElimCell_12 Int) (v_arrayElimCell_11 Int)) (let ((.cse465 (+ (select (select .cse466 v_arrayElimCell_15) (+ (* .cse461 4) v_arrayElimCell_12)) c_~res1~0)) (.cse467 (* .cse463 4))) (or (= .cse465 (+ c_~res2~0 (select (select .cse466 v_arrayElimCell_14) (+ .cse467 v_arrayElimCell_11)))) (= .cse465 (+ c_~res2~0 (select .cse468 (+ .cse467 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< .cse464 0))))) (< |c_ULTIMATE.start_main_~i~3#1| .cse462)))))))))))))) is different from true [2024-02-20 12:08:37,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:08:37,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 2848 treesize of output 2904 [2024-02-20 12:09:15,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:09:15,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 5059 treesize of output 4911 [2024-02-20 12:09:36,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:09:36,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 6981 treesize of output 6797 [2024-02-20 12:11:48,989 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-02-20 12:11:48,991 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-20 12:11:48,998 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-02-20 12:11:49,015 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-02-20 12:11:49,192 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-20 12:11:49,193 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:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) 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:609) 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:133) 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$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$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:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:527) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) 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) ... 78 more [2024-02-20 12:11:49,199 INFO L158 Benchmark]: Toolchain (without parser) took 267826.63ms. Allocated memory was 209.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 138.3MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-02-20 12:11:49,199 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-20 12:11:49,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.34ms. Allocated memory is still 209.7MB. Free memory was 138.1MB in the beginning and 124.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-20 12:11:49,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.44ms. Allocated memory is still 209.7MB. Free memory was 124.8MB in the beginning and 121.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-20 12:11:49,200 INFO L158 Benchmark]: Boogie Preprocessor took 107.72ms. Allocated memory is still 209.7MB. Free memory was 121.6MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-20 12:11:49,200 INFO L158 Benchmark]: RCFGBuilder took 1136.28ms. Allocated memory is still 209.7MB. Free memory was 117.4MB in the beginning and 62.3MB in the end (delta: 55.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-02-20 12:11:49,200 INFO L158 Benchmark]: TraceAbstraction took 266261.08ms. Allocated memory was 209.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 62.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-02-20 12:11:49,201 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.18ms. Allocated memory is still 209.7MB. Free memory is still 168.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.34ms. Allocated memory is still 209.7MB. Free memory was 138.1MB in the beginning and 124.8MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.44ms. Allocated memory is still 209.7MB. Free memory was 124.8MB in the beginning and 121.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.72ms. Allocated memory is still 209.7MB. Free memory was 121.6MB in the beginning and 117.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1136.28ms. Allocated memory is still 209.7MB. Free memory was 117.4MB in the beginning and 62.3MB in the end (delta: 55.1MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * TraceAbstraction took 266261.08ms. Allocated memory was 209.7MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 62.3MB in the beginning and 1.6GB in the end (delta: -1.5GB). 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-bad-dot-product-alt.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 e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:11:51,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:11:51,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-20 12:11:51,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:11:51,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:11:51,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:11:51,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:11:51,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:11:51,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:11:51,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:11:51,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:11:51,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:11:51,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:11:51,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:11:51,595 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:11:51,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:11:51,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:11:51,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:11:51,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:11:51,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:11:51,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:11:51,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:11:51,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:11:51,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-20 12:11:51,598 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-20 12:11:51,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:11:51,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-20 12:11:51,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:11:51,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:11:51,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:11:51,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:11:51,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:11:51,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:11:51,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:11:51,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:11:51,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:11:51,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:11:51,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:11:51,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-20 12:11:51,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-20 12:11:51,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:11:51,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:11:51,604 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:11:51,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:11:51,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:11:51,604 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-20 12:11:51,605 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 -> e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:11:51,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:11:51,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:11:51,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:11:51,969 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:11:51,970 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:11:51,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-02-20 12:11:53,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:11:53,766 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:11:53,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-dot-product-alt.wvr.c [2024-02-20 12:11:53,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5f8c4cd/76408e1a95864f368dcccdf5c95f6403/FLAG2986cfd61 [2024-02-20 12:11:53,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c5f8c4cd/76408e1a95864f368dcccdf5c95f6403 [2024-02-20 12:11:53,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:11:53,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:11:53,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:11:53,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:11:53,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:11:53,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:11:53" (1/1) ... [2024-02-20 12:11:53,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd917cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:53, skipping insertion in model container [2024-02-20 12:11:53,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:11:53" (1/1) ... [2024-02-20 12:11:53,845 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:11:54,042 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-bad-dot-product-alt.wvr.c[3182,3195] [2024-02-20 12:11:54,063 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:11:54,078 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-20 12:11:54,086 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:11:54,114 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-bad-dot-product-alt.wvr.c[3182,3195] [2024-02-20 12:11:54,124 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:11:54,131 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:11:54,166 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-bad-dot-product-alt.wvr.c[3182,3195] [2024-02-20 12:11:54,173 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:11:54,191 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:11:54,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54 WrapperNode [2024-02-20 12:11:54,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:11:54,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:11:54,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:11:54,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:11:54,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,260 INFO L138 Inliner]: procedures = 30, calls = 74, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 365 [2024-02-20 12:11:54,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:11:54,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:11:54,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:11:54,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:11:54,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,315 INFO L175 MemorySlicer]: Split 36 memory accesses to 6 slices as follows [2, 2, 2, 2, 24, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 1, 1, 3, 1]. [2024-02-20 12:11:54,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:11:54,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:11:54,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:11:54,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:11:54,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (1/1) ... [2024-02-20 12:11:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:11:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:11:54,404 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-02-20 12:11:54,418 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-02-20 12:11:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:11:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-20 12:11:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-20 12:11:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-20 12:11:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-20 12:11:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-02-20 12:11:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-02-20 12:11:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-02-20 12:11:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-02-20 12:11:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-02-20 12:11:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-02-20 12:11:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-02-20 12:11:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-02-20 12:11:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:11:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-20 12:11:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-20 12:11:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-20 12:11:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-20 12:11:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-02-20 12:11:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-02-20 12:11:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-02-20 12:11:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-02-20 12:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-02-20 12:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-02-20 12:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-02-20 12:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-02-20 12:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:11:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:11:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:11:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:11:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:11:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:11:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:11:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-20 12:11:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-20 12:11:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-20 12:11:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-20 12:11:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-02-20 12:11:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-02-20 12:11:54,473 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:11:54,631 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:11:54,632 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:11:55,085 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:11:55,086 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:11:55,464 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:11:55,465 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-02-20 12:11:55,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:11:55 BoogieIcfgContainer [2024-02-20 12:11:55,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:11:55,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:11:55,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:11:55,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:11:55,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:11:53" (1/3) ... [2024-02-20 12:11:55,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d2ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:11:55, skipping insertion in model container [2024-02-20 12:11:55,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:11:54" (2/3) ... [2024-02-20 12:11:55,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564d2ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:11:55, skipping insertion in model container [2024-02-20 12:11:55,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:11:55" (3/3) ... [2024-02-20 12:11:55,471 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2024-02-20 12:11:55,486 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:11:55,486 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:11:55,487 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:11:55,580 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 12:11:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 103 flow [2024-02-20 12:11:55,699 INFO L124 PetriNetUnfolderBase]: 7/38 cut-off events. [2024-02-20 12:11:55,699 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:11:55,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 7/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-02-20 12:11:55,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 41 transitions, 103 flow [2024-02-20 12:11:55,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 92 flow [2024-02-20 12:11:55,722 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:11:55,729 INFO L369 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=All, 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;@7bdfa53b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:11:55,729 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 12:11:55,751 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:11:55,751 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-02-20 12:11:55,752 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:11:55,752 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:11:55,753 INFO L234 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] [2024-02-20 12:11:55,754 INFO L432 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-02-20 12:11:55,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:11:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1595342277, now seen corresponding path program 1 times [2024-02-20 12:11:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:11:55,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692120509] [2024-02-20 12:11:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:11:55,773 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-02-20 12:11:55,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:11:55,776 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-02-20 12:11:55,810 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-02-20 12:11:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:11:56,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-20 12:11:56,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:11:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:11:56,149 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:11:56,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:11:56,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692120509] [2024-02-20 12:11:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692120509] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:11:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:11:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:11:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363295392] [2024-02-20 12:11:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:11:56,160 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:11:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:11:56,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:11:56,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:11:56,189 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:11:56,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-20 12:11:56,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:11:56,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:11:56,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:11:56,869 INFO L124 PetriNetUnfolderBase]: 1240/1728 cut-off events. [2024-02-20 12:11:56,870 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-20 12:11:56,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 1728 events. 1240/1728 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7419 event pairs, 206 based on Foata normal form. 1/1263 useless extension candidates. Maximal degree in co-relation 2979. Up to 1465 conditions per place. [2024-02-20 12:11:56,885 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 47 selfloop transitions, 4 changer transitions 1/56 dead transitions. [2024-02-20 12:11:56,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 249 flow [2024-02-20 12:11:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:11:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:11:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-20 12:11:56,897 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6016260162601627 [2024-02-20 12:11:56,901 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-20 12:11:56,901 INFO L507 AbstractCegarLoop]: Abstraction has has 42 places, 56 transitions, 249 flow [2024-02-20 12:11:56,902 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-02-20 12:11:56,902 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:11:56,902 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:11:56,912 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-02-20 12:11:57,108 WARN L489 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-02-20 12:11:57,109 INFO L432 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-02-20 12:11:57,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:11:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash -392382451, now seen corresponding path program 1 times [2024-02-20 12:11:57,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:11:57,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084374792] [2024-02-20 12:11:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:11:57,112 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-02-20 12:11:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:11:57,153 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-02-20 12:11:57,186 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-02-20 12:11:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:11:57,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 12:11:57,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:11:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:11:57,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:11:57,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:11:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084374792] [2024-02-20 12:11:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084374792] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:11:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:11:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:11:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411124211] [2024-02-20 12:11:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:11:57,467 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:11:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:11:57,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:11:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:11:57,470 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-02-20 12:11:57,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 56 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-02-20 12:11:57,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:11:57,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-02-20 12:11:57,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:11:58,290 INFO L124 PetriNetUnfolderBase]: 1615/2243 cut-off events. [2024-02-20 12:11:58,291 INFO L125 PetriNetUnfolderBase]: For 120/130 co-relation queries the response was YES. [2024-02-20 12:11:58,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6784 conditions, 2243 events. 1615/2243 cut-off events. For 120/130 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9640 event pairs, 166 based on Foata normal form. 0/1753 useless extension candidates. Maximal degree in co-relation 6557. Up to 1986 conditions per place. [2024-02-20 12:11:58,303 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 70 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2024-02-20 12:11:58,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 484 flow [2024-02-20 12:11:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:11:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:11:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-02-20 12:11:58,306 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3951219512195122 [2024-02-20 12:11:58,307 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-02-20 12:11:58,307 INFO L507 AbstractCegarLoop]: Abstraction has has 46 places, 77 transitions, 484 flow [2024-02-20 12:11:58,307 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-02-20 12:11:58,307 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:11:58,307 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:11:58,313 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 (3)] Forceful destruction successful, exit code 0 [2024-02-20 12:11:58,512 WARN L489 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-02-20 12:11:58,513 INFO L432 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-02-20 12:11:58,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:11:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1441443141, now seen corresponding path program 1 times [2024-02-20 12:11:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:11:58,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376954144] [2024-02-20 12:11:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:11:58,514 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-02-20 12:11:58,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:11:58,517 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-02-20 12:11:58,518 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-02-20 12:11:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:11:58,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:11:58,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:11:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:11:58,977 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:11:58,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:11:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376954144] [2024-02-20 12:11:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376954144] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:11:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:11:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:11:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123676386] [2024-02-20 12:11:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:11:58,978 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:11:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:11:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:11:58,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:11:58,982 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 41 [2024-02-20 12:11:58,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 77 transitions, 484 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-02-20 12:11:58,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:11:58,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 41 [2024-02-20 12:11:58,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:11:59,716 INFO L124 PetriNetUnfolderBase]: 1849/2598 cut-off events. [2024-02-20 12:11:59,716 INFO L125 PetriNetUnfolderBase]: For 633/635 co-relation queries the response was YES. [2024-02-20 12:11:59,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10238 conditions, 2598 events. 1849/2598 cut-off events. For 633/635 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12004 event pairs, 141 based on Foata normal form. 2/2158 useless extension candidates. Maximal degree in co-relation 9956. Up to 2155 conditions per place. [2024-02-20 12:11:59,732 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 88 selfloop transitions, 7 changer transitions 0/97 dead transitions. [2024-02-20 12:11:59,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 97 transitions, 790 flow [2024-02-20 12:11:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:11:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:11:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-02-20 12:11:59,734 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-02-20 12:11:59,734 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-02-20 12:11:59,734 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 97 transitions, 790 flow [2024-02-20 12:11:59,735 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-02-20 12:11:59,735 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:11:59,735 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:11:59,758 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-02-20 12:11:59,959 WARN L489 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-02-20 12:11:59,962 INFO L432 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-02-20 12:11:59,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:11:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash 87317073, now seen corresponding path program 2 times [2024-02-20 12:11:59,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:11:59,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968658732] [2024-02-20 12:11:59,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:11:59,967 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-02-20 12:11:59,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:11:59,968 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-02-20 12:12:00,016 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-02-20 12:12:00,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 12:12:00,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:12:00,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 12:12:00,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:12:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:12:00,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:12:00,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:12:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968658732] [2024-02-20 12:12:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968658732] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:12:00,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:12:00,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:12:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814878706] [2024-02-20 12:12:00,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:12:00,190 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:12:00,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:12:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:12:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:12:00,192 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:12:00,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 97 transitions, 790 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:12:00,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:12:00,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:12:00,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:12:00,770 INFO L124 PetriNetUnfolderBase]: 1852/2606 cut-off events. [2024-02-20 12:12:00,771 INFO L125 PetriNetUnfolderBase]: For 1108/1108 co-relation queries the response was YES. [2024-02-20 12:12:00,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12683 conditions, 2606 events. 1852/2606 cut-off events. For 1108/1108 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 11787 event pairs, 163 based on Foata normal form. 0/2161 useless extension candidates. Maximal degree in co-relation 12300. Up to 2405 conditions per place. [2024-02-20 12:12:00,791 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 90 selfloop transitions, 4 changer transitions 6/105 dead transitions. [2024-02-20 12:12:00,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 1054 flow [2024-02-20 12:12:00,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:12:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:12:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2024-02-20 12:12:00,794 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3804878048780488 [2024-02-20 12:12:00,796 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-02-20 12:12:00,796 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 105 transitions, 1054 flow [2024-02-20 12:12:00,796 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:12:00,796 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:12:00,796 INFO L234 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-02-20 12:12:00,803 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-02-20 12:12:01,002 WARN L489 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-02-20 12:12:01,004 INFO L432 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-02-20 12:12:01,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:12:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash -749488637, now seen corresponding path program 1 times [2024-02-20 12:12:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:12:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364707664] [2024-02-20 12:12:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:12:01,005 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-02-20 12:12:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:12:01,011 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-02-20 12:12:01,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 (6)] Waiting until timeout for monitored process [2024-02-20 12:12:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:12:01,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 12:12:01,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:12:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:12:01,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:12:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:12:01,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:12:01,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364707664] [2024-02-20 12:12:01,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364707664] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:12:01,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 12:12:01,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-02-20 12:12:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894483043] [2024-02-20 12:12:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:12:01,387 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:12:01,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:12:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:12:01,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:12:01,389 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 41 [2024-02-20 12:12:01,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 105 transitions, 1054 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-02-20 12:12:01,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:12:01,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 41 [2024-02-20 12:12:01,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:12:02,110 INFO L124 PetriNetUnfolderBase]: 2026/2848 cut-off events. [2024-02-20 12:12:02,111 INFO L125 PetriNetUnfolderBase]: For 2341/2341 co-relation queries the response was YES. [2024-02-20 12:12:02,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16652 conditions, 2848 events. 2026/2848 cut-off events. For 2341/2341 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 12456 event pairs, 168 based on Foata normal form. 0/2387 useless extension candidates. Maximal degree in co-relation 16173. Up to 2645 conditions per place. [2024-02-20 12:12:02,132 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 119 selfloop transitions, 8 changer transitions 6/136 dead transitions. [2024-02-20 12:12:02,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 136 transitions, 1636 flow [2024-02-20 12:12:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:12:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:12:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-02-20 12:12:02,134 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2024-02-20 12:12:02,134 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-02-20 12:12:02,134 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 136 transitions, 1636 flow [2024-02-20 12:12:02,135 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-02-20 12:12:02,135 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:12:02,135 INFO L234 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, 1] [2024-02-20 12:12:02,151 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 (6)] Ended with exit code 0 [2024-02-20 12:12:02,340 WARN L489 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-02-20 12:12:02,343 INFO L432 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-02-20 12:12:02,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:12:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1654963449, now seen corresponding path program 1 times [2024-02-20 12:12:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:12:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413444474] [2024-02-20 12:12:02,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:12:02,344 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-02-20 12:12:02,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:12:02,350 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-02-20 12:12:02,351 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-02-20 12:12:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:12:02,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:12:02,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:12:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:12:02,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:12:02,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:12:02,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413444474] [2024-02-20 12:12:02,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413444474] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:12:02,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:12:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:12:02,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226712216] [2024-02-20 12:12:02,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:12:02,736 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:12:02,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:12:02,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:12:02,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:12:02,737 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:12:02,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 136 transitions, 1636 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-20 12:12:02,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:12:02,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:12:02,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:12:03,396 INFO L124 PetriNetUnfolderBase]: 2055/2915 cut-off events. [2024-02-20 12:12:03,396 INFO L125 PetriNetUnfolderBase]: For 5142/5142 co-relation queries the response was YES. [2024-02-20 12:12:03,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19694 conditions, 2915 events. 2055/2915 cut-off events. For 5142/5142 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12977 event pairs, 159 based on Foata normal form. 30/2481 useless extension candidates. Maximal degree in co-relation 18753. Up to 2686 conditions per place. [2024-02-20 12:12:03,416 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 125 selfloop transitions, 3 changer transitions 29/162 dead transitions. [2024-02-20 12:12:03,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 162 transitions, 2277 flow [2024-02-20 12:12:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:12:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:12:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-02-20 12:12:03,417 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4573170731707317 [2024-02-20 12:12:03,418 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-02-20 12:12:03,418 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 162 transitions, 2277 flow [2024-02-20 12:12:03,418 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-20 12:12:03,418 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:12:03,419 INFO L234 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, 1, 1, 1] [2024-02-20 12:12:03,439 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-02-20 12:12:03,625 WARN L489 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-02-20 12:12:03,626 INFO L432 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-02-20 12:12:03,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:12:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1997926557, now seen corresponding path program 1 times [2024-02-20 12:12:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:12:03,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578207458] [2024-02-20 12:12:03,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:12:03,628 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-02-20 12:12:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:12:03,645 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-02-20 12:12:03,649 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-02-20 12:12:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:12:04,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:12:04,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:12:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:12:04,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:12:04,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:12:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578207458] [2024-02-20 12:12:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578207458] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:12:04,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:12:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:12:04,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722311374] [2024-02-20 12:12:04,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:12:04,089 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:12:04,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:12:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:12:04,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:12:04,091 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-02-20 12:12:04,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 162 transitions, 2277 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-02-20 12:12:04,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:12:04,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-02-20 12:12:04,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:12:04,986 INFO L124 PetriNetUnfolderBase]: 2086/2988 cut-off events. [2024-02-20 12:12:04,987 INFO L125 PetriNetUnfolderBase]: For 7569/7569 co-relation queries the response was YES. [2024-02-20 12:12:04,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22872 conditions, 2988 events. 2086/2988 cut-off events. For 7569/7569 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13336 event pairs, 170 based on Foata normal form. 30/2549 useless extension candidates. Maximal degree in co-relation 21333. Up to 2730 conditions per place. [2024-02-20 12:12:05,012 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 124 selfloop transitions, 6 changer transitions 59/194 dead transitions. [2024-02-20 12:12:05,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 194 transitions, 3118 flow [2024-02-20 12:12:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:12:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:12:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-02-20 12:12:05,013 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4097560975609756 [2024-02-20 12:12:05,014 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-02-20 12:12:05,016 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 194 transitions, 3118 flow [2024-02-20 12:12:05,016 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-02-20 12:12:05,016 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:12:05,016 INFO L234 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, 1, 1, 1, 1] [2024-02-20 12:12:05,023 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-02-20 12:12:05,222 WARN L489 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-02-20 12:12:05,223 INFO L432 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-02-20 12:12:05,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:12:05,223 INFO L85 PathProgramCache]: Analyzing trace with hash -352285018, now seen corresponding path program 1 times [2024-02-20 12:12:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:12:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813705719] [2024-02-20 12:12:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:12:05,227 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-02-20 12:12:05,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:12:05,229 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-02-20 12:12:05,252 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-02-20 12:12:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:12:05,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 50 conjunts are in the unsatisfiable core [2024-02-20 12:12:05,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:12:06,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-02-20 12:12:07,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:07,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:12:14,133 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 605 DAG size of output: 357 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-20 12:12:14,133 INFO L349 Elim1Store]: treesize reduction 1056, result has 54.2 percent of original size [2024-02-20 12:12:14,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 24 disjoint index pairs (out of 276 index pairs), introduced 34 new quantified variables, introduced 276 case distinctions, treesize of input 1037 treesize of output 1539 [2024-02-20 12:12:14,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-02-20 12:12:14,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:12:14,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 4356 treesize of output 3224 [2024-02-20 12:12:14,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:12:14,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3331 treesize of output 2107 Killed by 15