./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fbcb9f20 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.2.3-?-fbcb9f2-m [2023-11-24 05:18:17,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 05:18:17,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-24 05:18:17,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 05:18:17,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 05:18:17,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 05:18:17,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 05:18:17,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 05:18:17,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 05:18:17,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 05:18:17,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 05:18:17,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 05:18:17,678 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 05:18:17,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 05:18:17,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 05:18:17,679 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 05:18:17,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 05:18:17,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 05:18:17,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 05:18:17,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 05:18:17,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 05:18:17,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 05:18:17,683 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 05:18:17,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 05:18:17,686 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 05:18:17,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 05:18:17,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 05:18:17,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 05:18:17,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 05:18:17,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 05:18:17,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 05:18:17,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 05:18:17,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 05:18:17,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 05:18:17,690 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-24 05:18:17,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 05:18:17,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 05:18:17,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 05:18:17,691 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 05:18:17,691 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 05:18:17,691 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 05:18:17,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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/UGemCutter-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 -> GemCutter 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 -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2023-11-24 05:18:17,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 05:18:17,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 05:18:17,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 05:18:17,902 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 05:18:17,902 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 05:18:17,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-11-24 05:18:18,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 05:18:19,075 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 05:18:19,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-11-24 05:18:19,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/51aa06183/32a5d7dd20794ed4977cae004ff8e150/FLAG4076aba63 [2023-11-24 05:18:19,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/51aa06183/32a5d7dd20794ed4977cae004ff8e150 [2023-11-24 05:18:19,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 05:18:19,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 05:18:19,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 05:18:19,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 05:18:19,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 05:18:19,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfc1888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19, skipping insertion in model container [2023-11-24 05:18:19,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,146 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 05:18:19,394 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2023-11-24 05:18:19,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2023-11-24 05:18:19,406 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2023-11-24 05:18:19,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 05:18:19,425 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 05:18:19,460 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2023-11-24 05:18:19,467 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2023-11-24 05:18:19,471 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2023-11-24 05:18:19,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 05:18:19,513 INFO L206 MainTranslator]: Completed translation [2023-11-24 05:18:19,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19 WrapperNode [2023-11-24 05:18:19,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 05:18:19,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 05:18:19,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 05:18:19,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 05:18:19,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,576 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-11-24 05:18:19,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 05:18:19,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 05:18:19,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 05:18:19,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 05:18:19,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 05:18:19,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 05:18:19,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 05:18:19,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 05:18:19,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (1/1) ... [2023-11-24 05:18:19,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 05:18:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:19,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 05:18:19,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 05:18:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 05:18:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-24 05:18:19,721 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-24 05:18:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-24 05:18:19,721 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 05:18:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 05:18:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-24 05:18:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 05:18:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 05:18:19,724 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 05:18:19,830 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 05:18:19,832 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 05:18:20,058 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 05:18:20,238 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 05:18:20,238 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 05:18:20,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:18:20 BoogieIcfgContainer [2023-11-24 05:18:20,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 05:18:20,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 05:18:20,241 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 05:18:20,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 05:18:20,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:18:19" (1/3) ... [2023-11-24 05:18:20,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38499ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:18:20, skipping insertion in model container [2023-11-24 05:18:20,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:18:19" (2/3) ... [2023-11-24 05:18:20,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38499ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:18:20, skipping insertion in model container [2023-11-24 05:18:20,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:18:20" (3/3) ... [2023-11-24 05:18:20,247 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2023-11-24 05:18:20,253 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 05:18:20,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 05:18:20,261 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-24 05:18:20,261 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 05:18:20,308 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-24 05:18:20,344 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 05:18:20,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 05:18:20,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:20,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 05:18:20,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 05:18:20,388 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 05:18:20,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2023-11-24 05:18:20,408 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65ba650e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 05:18:20,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-24 05:18:21,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:21,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:21,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1807394834, now seen corresponding path program 1 times [2023-11-24 05:18:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:21,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143313700] [2023-11-24 05:18:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:21,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:22,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:22,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143313700] [2023-11-24 05:18:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143313700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 05:18:22,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910334196] [2023-11-24 05:18:22,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:22,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:22,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:18:22,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 05:18:22,162 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:22,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1791929901, now seen corresponding path program 1 times [2023-11-24 05:18:22,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:22,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343229304] [2023-11-24 05:18:22,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-24 05:18:22,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343229304] [2023-11-24 05:18:22,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343229304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:22,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 05:18:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609983012] [2023-11-24 05:18:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:22,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:22,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:18:22,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 05:18:22,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:22,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:22,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2045830047, now seen corresponding path program 1 times [2023-11-24 05:18:22,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:22,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704828569] [2023-11-24 05:18:22,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:22,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704828569] [2023-11-24 05:18:22,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704828569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:22,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 05:18:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491748846] [2023-11-24 05:18:22,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:22,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 05:18:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:22,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 05:18:22,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 05:18:22,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,595 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:22,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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) [2023-11-24 05:18:22,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:22,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 05:18:22,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:22,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash 71512693, now seen corresponding path program 1 times [2023-11-24 05:18:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064456357] [2023-11-24 05:18:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064456357] [2023-11-24 05:18:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064456357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:22,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 05:18:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938560159] [2023-11-24 05:18:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:22,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:22,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:22,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:22,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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) [2023-11-24 05:18:22,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:22,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:22,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 05:18:22,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:22,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1077743245, now seen corresponding path program 1 times [2023-11-24 05:18:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648356382] [2023-11-24 05:18:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:22,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:22,949 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-24 05:18:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098448234] [2023-11-24 05:18:22,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:22,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 05:18:23,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 05:18:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:23,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 05:18:23,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 05:18:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-24 05:18:23,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 05:18:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648356382] [2023-11-24 05:18:23,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-24 05:18:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098448234] [2023-11-24 05:18:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098448234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:23,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 05:18:23,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707747132] [2023-11-24 05:18:23,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:23,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 05:18:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 05:18:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 05:18:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:23,264 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:18:23,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:23,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 05:18:23,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:23,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:23,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1915268919, now seen corresponding path program 1 times [2023-11-24 05:18:23,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413738154] [2023-11-24 05:18:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:23,564 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-24 05:18:23,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1196724583] [2023-11-24 05:18:23,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:23,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:23,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:23,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 05:18:23,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 05:18:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:23,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 05:18:23,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 05:18:23,787 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 [2023-11-24 05:18:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-24 05:18:23,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 05:18:23,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413738154] [2023-11-24 05:18:23,812 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-24 05:18:23,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196724583] [2023-11-24 05:18:23,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196724583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:23,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:23,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 05:18:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262576078] [2023-11-24 05:18:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:23,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:23,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:23,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:23,814 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:23,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:18:23,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:23,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:23,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 05:18:24,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:24,073 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:24,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -29667548, now seen corresponding path program 2 times [2023-11-24 05:18:24,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:24,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791396965] [2023-11-24 05:18:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:24,086 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-24 05:18:24,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488664222] [2023-11-24 05:18:24,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 05:18:24,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:24,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:24,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 05:18:24,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 05:18:24,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-24 05:18:24,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 05:18:24,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 05:18:24,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 05:18:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 05:18:24,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 05:18:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791396965] [2023-11-24 05:18:24,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-24 05:18:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488664222] [2023-11-24 05:18:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488664222] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 05:18:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536253226] [2023-11-24 05:18:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:24,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 05:18:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:24,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 05:18:24,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 05:18:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:24,215 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:24,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) [2023-11-24 05:18:24,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:24,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:24,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:24,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:24,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:24,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:24,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 05:18:28,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-24 05:18:28,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-24 05:18:28,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-24 05:18:28,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:28,936 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-24 05:18:28,937 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE,SAFE (1/3) [2023-11-24 05:18:28,939 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 05:18:28,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 05:18:28,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:28,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 05:18:28,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-11-24 05:18:28,946 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 05:18:28,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 05:18:28,947 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65ba650e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 05:18:28,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-24 05:18:31,249 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-24 05:18:31,249 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-11-24 05:18:31,250 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-11-24 05:18:31,250 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2023-11-24 05:18:31,251 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 05:18:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 05:18:31,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:31,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 05:18:31,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-11-24 05:18:31,257 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 05:18:31,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2023-11-24 05:18:31,258 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65ba650e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 05:18:31,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 05:18:32,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:32,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -815220810, now seen corresponding path program 1 times [2023-11-24 05:18:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:32,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632023170] [2023-11-24 05:18:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:32,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:32,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:32,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632023170] [2023-11-24 05:18:32,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632023170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:32,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 05:18:32,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748579484] [2023-11-24 05:18:32,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:32,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:32,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:32,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:32,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:32,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,512 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:32,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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) [2023-11-24 05:18:32,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 05:18:32,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:32,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash 186410603, now seen corresponding path program 1 times [2023-11-24 05:18:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258725578] [2023-11-24 05:18:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-24 05:18:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258725578] [2023-11-24 05:18:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258725578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:32,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:32,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 05:18:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521267791] [2023-11-24 05:18:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:32,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:32,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,680 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:32,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:18:32,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 05:18:32,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:32,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:32,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1467656430, now seen corresponding path program 1 times [2023-11-24 05:18:32,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:32,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805677683] [2023-11-24 05:18:32,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 05:18:32,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:32,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805677683] [2023-11-24 05:18:32,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805677683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:32,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:32,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 05:18:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932197912] [2023-11-24 05:18:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:32,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:32,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:32,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:18:32,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 05:18:32,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:32,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -725410803, now seen corresponding path program 1 times [2023-11-24 05:18:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248490822] [2023-11-24 05:18:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 05:18:32,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:32,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248490822] [2023-11-24 05:18:32,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248490822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:32,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:32,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 05:18:32,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990806427] [2023-11-24 05:18:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:32,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 05:18:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:32,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 05:18:32,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 05:18:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:32,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-11-24 05:18:32,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 05:18:32,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:32,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:32,932 INFO L85 PathProgramCache]: Analyzing trace with hash -137100289, now seen corresponding path program 1 times [2023-11-24 05:18:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598006116] [2023-11-24 05:18:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:32,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598006116] [2023-11-24 05:18:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598006116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:32,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 05:18:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582426111] [2023-11-24 05:18:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:32,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 05:18:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 05:18:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 05:18:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:32,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:32,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-11-24 05:18:32,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:32,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:33,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 05:18:33,048 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:33,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1125336516, now seen corresponding path program 1 times [2023-11-24 05:18:33,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:33,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771537439] [2023-11-24 05:18:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:33,059 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-24 05:18:33,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179675376] [2023-11-24 05:18:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:33,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:33,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:33,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 05:18:33,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-24 05:18:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:33,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-24 05:18:33,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 05:18:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:33,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 05:18:33,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:18:33,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771537439] [2023-11-24 05:18:33,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-24 05:18:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179675376] [2023-11-24 05:18:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179675376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 05:18:33,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 05:18:33,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 05:18:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928364425] [2023-11-24 05:18:33,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 05:18:33,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 05:18:33,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:18:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 05:18:33,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 05:18:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:33,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:18:33,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2023-11-24 05:18:33,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:33,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:18:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:18:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:18:33,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-24 05:18:33,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 05:18:33,505 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 05:18:33,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 05:18:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1664668833, now seen corresponding path program 1 times [2023-11-24 05:18:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 05:18:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490472124] [2023-11-24 05:18:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 05:18:33,518 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-24 05:18:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477781538] [2023-11-24 05:18:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 05:18:33,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 05:18:33,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 05:18:33,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 05:18:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-24 05:18:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 05:18:33,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-24 05:18:33,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 05:18:33,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 05:18:33,954 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 12 treesize of output 6 [2023-11-24 05:18:33,969 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 05:18:33,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-24 05:18:34,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-24 05:18:34,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-24 05:18:34,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-24 05:18:34,537 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 24 treesize of output 20 [2023-11-24 05:18:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:18:34,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 05:19:05,662 WARN L293 SmtUtils]: Spent 7.43s on a formula simplification. DAG size of input: 465 DAG size of output: 456 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:19:38,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse12 (mod c_~next~0 4294967296))) (or (let ((.cse45 (mod (mod (+ c_~next~0 1) 4294967296) .cse0))) (let ((.cse31 (mod (mod (mod (+ .cse45 1) 4294967296) .cse0) 4294967296)) (.cse7 (mod c_~first~0 4294967296))) (let ((.cse4 (< 2147483647 .cse7)) (.cse14 (< 2147483647 .cse12)) (.cse13 (< .cse12 2147483648)) (.cse21 (< .cse7 2147483648)) (.cse32 (<= 1 .cse31)) (.cse8 (mod .cse45 4294967296)) (.cse11 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse1 (+ .cse7 1))) (and (or (< .cse0 .cse1) (let ((.cse10 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse5 (< .cse10 2147483648)) (.cse18 (< 2147483647 .cse10)) (.cse25 (< .cse8 2147483648)) (.cse29 (< 2147483647 .cse8)) (.cse2 (mod .cse11 256))) (and (or (< .cse2 128) (let ((.cse30 (+ .cse10 1))) (let ((.cse23 (= (+ 2 |c_t1Thread1of1ForFork1_~i~0#1|) 0)) (.cse24 (and .cse32 (<= .cse30 .cse0))) (.cse3 (< .cse31 1)) (.cse9 (+ (- 256) .cse2)) (.cse22 (< .cse0 .cse30))) (and (or (and (or .cse3 (and (or .cse4 (and (or .cse5 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_24 Int) (|~#buffer~0.offset| Int)) (let ((.cse6 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_24))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse6 (+ |~#buffer~0.offset| .cse7)))) (= (select (store .cse6 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11)))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_25 Int) (|~#buffer~0.offset| Int)) (let ((.cse15 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_25))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse15 (+ |~#buffer~0.offset| .cse7)))) (= (select (store .cse15 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11))))))) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_22 Int) (|~#buffer~0.offset| Int)) (let ((.cse16 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_22))) (or (not (= (select .cse16 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse11 (select (store .cse16 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10))))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_23 Int) (|~#buffer~0.offset| Int)) (let ((.cse17 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_23))) (or (not (= (select .cse17 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse17 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10)) .cse11)))) .cse13)) .cse18))) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_26 Int)) (let ((.cse19 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_26))) (or (= (select (store .cse19 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse19 (+ |~#buffer~0.offset| .cse7 (- 4294967296))))))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_27 Int)) (let ((.cse20 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_27))) (or (not (= (select .cse20 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse11 (select (store .cse20 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))))))) .cse13)) .cse21)) .cse22) (or .cse23 (and (or .cse4 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_21 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_21) (+ |~#buffer~0.offset| .cse7))))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_20 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_20) (+ |~#buffer~0.offset| .cse7)))))))) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_18 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_18) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_19 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_19) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse13)) .cse21)) .cse24)) .cse25) (or (and (or .cse23 (and (or .cse4 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_16 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_16) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_15 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_15) (+ |~#buffer~0.offset| .cse7 (- 4294967296)))))) .cse21)) .cse24) (or .cse3 (and (or .cse5 (and (or .cse4 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_14 Int) (|~#buffer~0.offset| Int)) (let ((.cse26 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_14))) (or (not (= (select .cse26 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse26 (+ |~#buffer~0.offset| .cse8) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_12 Int) (|~#buffer~0.offset| Int)) (let ((.cse27 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_12))) (or (= (select (store .cse27 (+ |~#buffer~0.offset| .cse8) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse27 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse21))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_9 Int)) (let ((.cse28 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_9))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse28 (+ |~#buffer~0.offset| .cse7)))) (= (select (store .cse28 (+ |~#buffer~0.offset| .cse8) .cse9) (+ |~#buffer~0.offset| .cse10)) .cse11)))) .cse18)) .cse22)) .cse29))))) (or (let ((.cse36 (< 0 .cse31)) (.cse34 (< .cse10 .cse0))) (and (or .cse4 (and (or (and (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_44 Int) (|~#buffer~0.offset| Int)) (let ((.cse33 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_44))) (or (= .cse11 (select (store .cse33 (+ |~#buffer~0.offset| .cse8) .cse2) (+ |~#buffer~0.offset| .cse10))) (not (= (select .cse33 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse18) (or .cse34 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_49 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_49) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or .cse5 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_47 Int) (|~#buffer~0.offset| Int)) (let ((.cse35 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_47))) (or (not (= (select .cse35 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse35 (+ |~#buffer~0.offset| .cse8) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_45 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_45) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse36)) .cse29) (or .cse25 (and (or .cse36 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_41 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_41) (+ |~#buffer~0.offset| .cse7))))) .cse14) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_42 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_42) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse13))) (or .cse5 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_38 Int)) (let ((.cse37 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_38))) (or (= (select (store .cse37 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse37 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_37 Int)) (let ((.cse38 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_37))) (or (= (select (store .cse38 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse38 (+ |~#buffer~0.offset| .cse7)))))))))) (or (and (or .cse13 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_39 Int)) (let ((.cse39 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_39))) (or (not (= (select .cse39 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse39 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10)) .cse11))))) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_40 Int)) (let ((.cse40 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_40))) (or (= .cse11 (select (store .cse40 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10))) (not (= (select .cse40 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))))))) .cse18))))) (or (and (or .cse25 (and (or .cse34 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_33 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_33) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_32 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_32) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))))) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_29 Int)) (let ((.cse41 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_29))) (or (= .cse11 (select (store .cse41 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296)))) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse41 (+ |~#buffer~0.offset| .cse7 (- 4294967296))))))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_28 Int)) (let ((.cse42 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_28))) (or (= (select (store .cse42 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse42 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse13) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_30 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_30) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_31 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_31) (+ |~#buffer~0.offset| .cse7 (- 4294967296)))))) .cse13)) .cse36))) (or (and (or .cse34 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_34 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_34) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_36 Int) (|~#buffer~0.offset| Int)) (let ((.cse43 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_36))) (or (= (select (store .cse43 (+ |~#buffer~0.offset| .cse8) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse43 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))))) .cse29)) .cse21))) (< 127 .cse2))))) (< .cse8 1)) (let ((.cse44 (<= .cse1 .cse0))) (or (and (or .cse4 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_7 Int)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_7) (+ |~#buffer~0.offset| .cse8) 0) (+ |~#buffer~0.offset| .cse7)) 0)) .cse14) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_8 Int)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_8) (+ |~#buffer~0.offset| .cse8) 0) (+ |~#buffer~0.offset| .cse7)) 0)) .cse13))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_4 Int)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_4) (+ |~#buffer~0.offset| .cse8) 0) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) 0)) .cse21) .cse32 .cse44) (and (<= 1 .cse8) .cse44) (not (= .cse11 0)))))))) (< .cse0 (+ .cse12 1)) (= (mod c_~send~0 256) 0))) is different from false [2023-11-24 05:19:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 05:19:43,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 05:19:43,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490472124] [2023-11-24 05:19:43,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-24 05:19:43,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477781538] [2023-11-24 05:19:43,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477781538] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 05:19:43,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 05:19:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-11-24 05:19:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885767135] [2023-11-24 05:19:43,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 05:19:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-24 05:19:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 05:19:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-24 05:19:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=616, Unknown=1, NotChecked=52, Total=812 [2023-11-24 05:19:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:19:43,596 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 05:19:43,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 05:19:43,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:19:43,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:19:43,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:19:43,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:19:43,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 05:19:43,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-24 05:19:43,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 05:20:05,726 WARN L293 SmtUtils]: Spent 17.14s on a formula simplification. DAG size of input: 798 DAG size of output: 467 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:20:08,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:20:10,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:20:20,552 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 336 DAG size of output: 395 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:20:44,514 WARN L293 SmtUtils]: Spent 18.22s on a formula simplification. DAG size of input: 713 DAG size of output: 906 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:21:01,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:21:19,291 WARN L293 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 512 DAG size of output: 636 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:22:14,360 WARN L293 SmtUtils]: Spent 40.17s on a formula simplification. DAG size of input: 822 DAG size of output: 481 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:23:02,979 WARN L293 SmtUtils]: Spent 26.42s on a formula simplification. DAG size of input: 805 DAG size of output: 882 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:23:36,227 WARN L293 SmtUtils]: Spent 26.91s on a formula simplification. DAG size of input: 805 DAG size of output: 882 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:24:38,599 WARN L293 SmtUtils]: Spent 55.29s on a formula simplification. DAG size of input: 822 DAG size of output: 897 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:25:28,623 WARN L293 SmtUtils]: Spent 48.13s on a formula simplification. DAG size of input: 819 DAG size of output: 920 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:26:14,349 WARN L293 SmtUtils]: Spent 39.12s on a formula simplification. DAG size of input: 657 DAG size of output: 688 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:26:16,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:26:19,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:27:25,988 WARN L293 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 684 DAG size of output: 474 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:27:28,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:27:30,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:27:32,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:28:05,790 WARN L293 SmtUtils]: Spent 27.83s on a formula simplification. DAG size of input: 726 DAG size of output: 802 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:28:35,904 WARN L293 SmtUtils]: Spent 26.16s on a formula simplification. DAG size of input: 731 DAG size of output: 812 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:28:55,194 WARN L293 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 407 DAG size of output: 437 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:29:25,843 WARN L293 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 776 DAG size of output: 475 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:29:27,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:30:12,077 WARN L293 SmtUtils]: Spent 33.62s on a formula simplification. DAG size of input: 776 DAG size of output: 945 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:30:16,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:30:44,607 WARN L293 SmtUtils]: Spent 18.21s on a formula simplification. DAG size of input: 668 DAG size of output: 859 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:31:13,649 WARN L293 SmtUtils]: Spent 23.91s on a formula simplification. DAG size of input: 695 DAG size of output: 804 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:31:28,783 WARN L293 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 641 DAG size of output: 849 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:32:05,576 WARN L293 SmtUtils]: Spent 9.31s on a formula simplification. DAG size of input: 698 DAG size of output: 910 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-24 05:32:08,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-24 05:32:34,219 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 619 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15