./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking NONE -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 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/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking NONE -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 21:24:41,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 21:24:41,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 21:24:41,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 21:24:41,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 21:24:41,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 21:24:41,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 21:24:41,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 21:24:41,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 21:24:41,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 21:24:41,957 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 21:24:41,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 21:24:41,957 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 21:24:41,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 21:24:41,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 21:24:41,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 21:24:41,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 21:24:41,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 21:24:41,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 21:24:41,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 21:24:41,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 21:24:41,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 21:24:41,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 21:24:41,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 21:24:41,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 21:24:41,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 21:24:41,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 21:24:41,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 21:24:41,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 21:24:41,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 21:24:41,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 21:24:41,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 21:24:41,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 21:24:41,966 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 21:24:41,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 21:24:41,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 21:24:41,966 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 21:24:41,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 21:24:41,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 21:24:41,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 21:24:41,967 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 21:24:41,967 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> NONE [2024-10-16 21:24:42,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 21:24:42,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 21:24:42,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 21:24:42,240 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 21:24:42,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 21:24:42,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-16 21:24:43,628 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 21:24:43,909 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 21:24:43,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-16 21:24:43,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6e5e6994/fb8d023634de4dd5a3614a38952d1cb0/FLAG8ef6f6cf3 [2024-10-16 21:24:43,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c6e5e6994/fb8d023634de4dd5a3614a38952d1cb0 [2024-10-16 21:24:43,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 21:24:43,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 21:24:43,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 21:24:43,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 21:24:43,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 21:24:43,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 09:24:43" (1/1) ... [2024-10-16 21:24:43,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33fd1be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:43, skipping insertion in model container [2024-10-16 21:24:43,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 09:24:43" (1/1) ... [2024-10-16 21:24:44,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 21:24:44,456 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-10-16 21:24:44,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 21:24:44,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 21:24:44,560 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-10-16 21:24:44,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 21:24:44,648 INFO L204 MainTranslator]: Completed translation [2024-10-16 21:24:44,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44 WrapperNode [2024-10-16 21:24:44,648 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 21:24:44,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 21:24:44,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 21:24:44,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 21:24:44,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,724 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-10-16 21:24:44,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 21:24:44,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 21:24:44,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 21:24:44,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 21:24:44,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 21:24:44,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 21:24:44,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 21:24:44,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 21:24:44,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (1/1) ... [2024-10-16 21:24:44,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 21:24:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:24:44,808 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) [2024-10-16 21:24:44,812 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 [2024-10-16 21:24:44,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 21:24:44,852 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-16 21:24:44,852 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-16 21:24:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 21:24:44,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 21:24:44,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 21:24:44,855 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 21:24:45,009 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 21:24:45,028 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 21:24:45,375 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 21:24:45,375 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 21:24:45,552 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 21:24:45,552 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-16 21:24:45,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 09:24:45 BoogieIcfgContainer [2024-10-16 21:24:45,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 21:24:45,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 21:24:45,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 21:24:45,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 21:24:45,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 09:24:43" (1/3) ... [2024-10-16 21:24:45,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a934db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 09:24:45, skipping insertion in model container [2024-10-16 21:24:45,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 09:24:44" (2/3) ... [2024-10-16 21:24:45,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a934db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 09:24:45, skipping insertion in model container [2024-10-16 21:24:45,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 09:24:45" (3/3) ... [2024-10-16 21:24:45,565 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-16 21:24:45,584 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 21:24:45,584 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-16 21:24:45,584 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 21:24:45,635 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-16 21:24:45,689 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 21:24:45,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 21:24:45,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:24:45,693 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) [2024-10-16 21:24:45,694 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 [2024-10-16 21:24:45,804 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 21:24:45,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-16 21:24:45,828 INFO L333 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, 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;@6802cb53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=NONE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 21:24:45,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 21:24:46,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:24:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:24:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-10-16 21:24:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:24:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858384110] [2024-10-16 21:24:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:24:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:24:46,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858384110] [2024-10-16 21:24:46,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858384110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 21:24:46,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 21:24:46,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 21:24:46,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021240247] [2024-10-16 21:24:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 21:24:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 21:24:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:24:46,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 21:24:46,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 21:24:46,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:46,636 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:24:46,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:24:46,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:46,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-16 21:24:46,711 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:24:46,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:24:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-10-16 21:24:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:24:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754362997] [2024-10-16 21:24:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:24:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:46,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:24:46,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754362997] [2024-10-16 21:24:46,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754362997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:24:46,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516610325] [2024-10-16 21:24:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:46,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:24:46,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:24:46,834 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) [2024-10-16 21:24:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-16 21:24:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:46,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 21:24:46,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:24:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:46,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:24:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516610325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:24:46,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:24:46,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-16 21:24:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021542178] [2024-10-16 21:24:46,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:24:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-16 21:24:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:24:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-16 21:24:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-16 21:24:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:46,978 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:24:46,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:24:46,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:46,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:47,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:47,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:24:47,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-16 21:24:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-16 21:24:47,277 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:24:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:24:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-10-16 21:24:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:24:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366117947] [2024-10-16 21:24:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:24:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:24:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366117947] [2024-10-16 21:24:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366117947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:24:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851443216] [2024-10-16 21:24:47,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 21:24:47,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:24:47,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:24:47,558 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) [2024-10-16 21:24:47,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-16 21:24:47,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-16 21:24:47,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 21:24:47,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-16 21:24:47,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:24:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:47,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:24:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-16 21:24:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851443216] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:24:47,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:24:47,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-16 21:24:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497049375] [2024-10-16 21:24:47,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:24:47,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-16 21:24:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:24:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-16 21:24:47,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-16 21:24:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:47,770 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:24:47,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:24:47,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:47,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:24:47,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:47,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:24:47,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:24:47,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-16 21:24:48,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:24:48,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:24:48,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:24:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-10-16 21:24:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:24:48,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402995738] [2024-10-16 21:24:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:48,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:24:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:24:48,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:24:48,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402995738] [2024-10-16 21:24:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402995738] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:24:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715205850] [2024-10-16 21:24:48,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-16 21:24:48,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:24:48,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:24:48,450 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) [2024-10-16 21:24:48,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-16 21:24:48,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-16 21:24:48,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 21:24:48,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-16 21:24:48,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:24:48,570 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 7 treesize of output 6 [2024-10-16 21:24:48,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 21:24:48,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-16 21:24:48,689 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 [2024-10-16 21:24:48,748 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 [2024-10-16 21:24:48,792 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 31 treesize of output 25 [2024-10-16 21:24:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:24:48,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:24:52,881 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-16 21:24:54,898 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-16 21:24:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-16 21:24:55,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715205850] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:24:55,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:24:55,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-16 21:24:55,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303202606] [2024-10-16 21:24:55,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:24:55,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-16 21:24:55,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:24:55,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-16 21:24:55,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=122, Unknown=4, NotChecked=46, Total=210 [2024-10-16 21:24:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:55,044 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:24:55,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:24:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:24:55,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:24:55,045 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:24:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:24:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:24:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:24:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:24:55,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-16 21:24:55,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:24:55,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:24:55,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:24:55,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-10-16 21:24:55,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:24:55,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188395392] [2024-10-16 21:24:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:24:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:24:56,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:24:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188395392] [2024-10-16 21:24:56,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188395392] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:24:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975157790] [2024-10-16 21:24:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:24:56,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:24:56,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:24:56,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 21:24:56,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-16 21:24:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:24:56,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-16 21:24:56,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:24:56,271 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 7 treesize of output 6 [2024-10-16 21:24:56,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 21:24:56,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-16 21:24:56,367 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 [2024-10-16 21:24:56,438 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 [2024-10-16 21:24:56,500 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 24 treesize of output 17 [2024-10-16 21:24:56,551 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 32 treesize of output 25 [2024-10-16 21:24:56,677 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 37 treesize of output 31 [2024-10-16 21:24:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:24:56,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:25:02,806 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-16 21:25:08,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-16 21:25:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-16 21:25:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975157790] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:25:09,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:25:09,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-16 21:25:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920343053] [2024-10-16 21:25:09,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:25:09,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-16 21:25:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:25:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-16 21:25:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=327, Unknown=3, NotChecked=78, Total=506 [2024-10-16 21:25:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:25:09,013 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:25:09,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:25:09,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:25:09,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:09,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:25:09,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:09,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:25:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:25:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:25:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:25:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:25:11,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-16 21:25:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:25:11,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:25:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:25:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -912837368, now seen corresponding path program 1 times [2024-10-16 21:25:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:25:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105146523] [2024-10-16 21:25:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:25:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:25:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:25:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-16 21:25:11,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:25:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105146523] [2024-10-16 21:25:11,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105146523] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:25:11,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211605794] [2024-10-16 21:25:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:25:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:25:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:25:11,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 21:25:11,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-16 21:25:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:25:11,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 21:25:11,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:25:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-16 21:25:11,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:25:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-16 21:25:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211605794] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:25:12,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:25:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-16 21:25:12,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283336084] [2024-10-16 21:25:12,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:25:12,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-16 21:25:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:25:12,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-16 21:25:12,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-16 21:25:12,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:25:12,023 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:25:12,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:25:12,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:25:12,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:12,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:25:12,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:25:12,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:25:12,024 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:25:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:25:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:25:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:25:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:25:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 21:25:12,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-16 21:25:12,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:25:12,454 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:25:12,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:25:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-10-16 21:25:12,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:25:12,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749205163] [2024-10-16 21:25:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:25:12,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:25:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:25:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:25:13,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:25:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749205163] [2024-10-16 21:25:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749205163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:25:13,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292718671] [2024-10-16 21:25:13,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-16 21:25:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:25:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:25:13,082 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) [2024-10-16 21:25:13,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-16 21:25:13,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-16 21:25:13,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 21:25:13,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-16 21:25:13,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:25:13,276 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 7 treesize of output 6 [2024-10-16 21:25:13,426 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-16 21:25:13,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-16 21:25:13,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2024-10-16 21:25:13,671 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 [2024-10-16 21:25:13,802 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 31 treesize of output 22 [2024-10-16 21:25:13,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-16 21:25:17,067 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 38 treesize of output 30 [2024-10-16 21:25:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:25:17,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:25:28,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:25:30,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:25:31,562 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:25:33,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:25:35,664 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_510 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)))) is different from false [2024-10-16 21:25:37,703 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_507 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_510 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_506) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_507 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_510) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-16 21:25:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-16 21:25:37,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292718671] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:25:37,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:25:37,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-16 21:25:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200240418] [2024-10-16 21:25:37,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:25:37,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-16 21:25:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:25:37,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-16 21:25:37,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=364, Unknown=15, NotChecked=270, Total=756 [2024-10-16 21:25:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:25:37,916 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:25:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.75) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 21:25:37,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:25:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:25:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:25:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:25:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:25:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:25:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 21:25:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 21:25:44,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-16 21:25:45,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-16 21:25:45,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:25:45,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:25:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-10-16 21:25:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:25:45,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274068056] [2024-10-16 21:25:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:25:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:25:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:25:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:25:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:25:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274068056] [2024-10-16 21:25:46,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274068056] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:25:46,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362884922] [2024-10-16 21:25:46,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-16 21:25:46,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:25:46,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:25:46,677 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) [2024-10-16 21:25:46,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-16 21:25:46,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-16 21:25:46,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 21:25:46,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-16 21:25:46,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:25:46,865 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 7 treesize of output 6 [2024-10-16 21:25:47,008 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-16 21:25:47,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-16 21:25:47,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2024-10-16 21:25:47,200 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 [2024-10-16 21:25:47,305 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 31 treesize of output 22 [2024-10-16 21:25:50,192 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 29 treesize of output 22 [2024-10-16 21:25:54,357 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 72 treesize of output 57 [2024-10-16 21:26:01,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-10-16 21:26:19,540 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 76 treesize of output 62 [2024-10-16 21:26:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:26:19,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:26:43,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:26:45,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-16 21:26:47,790 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:26:49,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-16 21:26:51,915 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|)))) is different from false [2024-10-16 21:26:51,938 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (or (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-16 21:26:54,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse0)) (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|))))) is different from false [2024-10-16 21:26:56,182 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_~i~0#1_33| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_33| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_640 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0) (< (+ |c_~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|) (< |v_t_funThread1of1ForFork0_~i~0#1_33| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 28 |c_~#cache~0.offset| .cse1))))) is different from false [2024-10-16 21:26:58,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_640 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-16 21:27:00,356 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_638) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| (+ v_ArrVal_640 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| (+ v_ArrVal_642 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_645) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_42|) 0))) is different from false [2024-10-16 21:27:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-16 21:27:00,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362884922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:27:00,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:27:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-16 21:27:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445269320] [2024-10-16 21:27:00,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:27:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-16 21:27:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:27:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-16 21:27:00,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=40, NotChecked=650, Total=1560 [2024-10-16 21:27:00,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:27:00,693 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:27:00,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 21:27:00,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:27:01,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:03,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:08,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:10,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:15,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:16,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:17,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:19,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:35,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:36,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:38,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:39,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:46,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:27:48,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:28:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:28:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:28:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:28:04,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:28:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:28:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 21:28:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-16 21:28:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-16 21:28:04,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-16 21:28:04,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:28:04,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 21:28:04,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 21:28:04,780 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-10-16 21:28:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 21:28:04,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3658332] [2024-10-16 21:28:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 21:28:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 21:28:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 21:28:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:28:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 21:28:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3658332] [2024-10-16 21:28:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3658332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 21:28:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893532] [2024-10-16 21:28:25,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-16 21:28:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 21:28:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 21:28:25,509 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 21:28:25,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-16 21:28:25,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-16 21:28:25,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-16 21:28:25,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-16 21:28:25,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 21:28:25,859 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 7 treesize of output 6 [2024-10-16 21:28:25,919 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 21:28:25,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-16 21:28:25,973 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 [2024-10-16 21:28:26,176 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 [2024-10-16 21:28:26,288 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 31 treesize of output 22 [2024-10-16 21:28:30,504 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 29 treesize of output 22 [2024-10-16 21:28:34,039 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 72 treesize of output 57 [2024-10-16 21:28:54,359 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 83 treesize of output 70 [2024-10-16 21:29:03,139 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 208 treesize of output 173 [2024-10-16 21:29:44,217 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 253 treesize of output 212 [2024-10-16 21:30:07,511 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 1087 treesize of output 916 [2024-10-16 21:30:29,269 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 1096 treesize of output 923 [2024-10-16 21:33:19,586 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 1829 treesize of output 1477 [2024-10-16 21:33:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-16 21:33:22,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 21:33:52,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-10-16 21:33:54,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-10-16 21:33:54,326 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-10-16 21:33:54,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2024-10-16 21:33:54,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2024-10-16 21:33:54,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse0))))))) is different from false [2024-10-16 21:33:56,887 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ |c_~#cache~0.offset| .cse2) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse2))))) is different from false [2024-10-16 21:33:59,092 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse0)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_845 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)))) is different from false [2024-10-16 21:34:01,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)))) is different from false [2024-10-16 21:34:03,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-10-16 21:34:05,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse2 (+ |c_~#cache~0.offset| .cse3))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse3)) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-10-16 21:34:08,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse1 (+ |c_~#cache~0.offset| .cse2))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_841 (- 1)))))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse2)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-10-16 21:34:10,466 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-10-16 21:34:12,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-10-16 21:34:14,958 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))))) is different from false [2024-10-16 21:34:17,290 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_838 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse0 (+ |c_~#cache~0.offset| .cse1))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 28 |c_~#cache~0.offset| .cse1)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_838 (- 1)))))) (store .cse2 |c_~#cache~0.base| (store (store (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)))))) is different from false [2024-10-16 21:34:19,783 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_838 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ v_ArrVal_838 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| 28)))) is different from false [2024-10-16 21:34:22,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_841 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_837 (Array Int Int)) (v_ArrVal_838 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_847 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_845 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_837) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ v_ArrVal_838 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ v_ArrVal_841 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ v_ArrVal_845 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_849) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| 28)))) is different from false [2024-10-16 21:34:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-16 21:34:24,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 21:34:24,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 21:34:24,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 62 [2024-10-16 21:34:24,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672467093] [2024-10-16 21:34:24,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 21:34:24,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-16 21:34:24,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 21:34:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-16 21:34:24,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1567, Unknown=120, NotChecked=1854, Total=3906 [2024-10-16 21:34:24,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:34:24,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 21:34:24,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.492063492063492) internal successors, (283), 62 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 21:34:24,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 21:34:24,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 21:34:24,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-16 21:34:24,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-16 21:34:24,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-16 21:34:24,500 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-16 21:34:24,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-16 21:34:24,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-16 21:34:24,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 21:34:28,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:30,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:32,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:34,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:36,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:50,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:52,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:54,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:56,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:34:58,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:00,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:02,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:22,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:24,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:26,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:28,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:30,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:32,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:34,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:44,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:46,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:48,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:50,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:52,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:54,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:35:56,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:15,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:17,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:19,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:21,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:23,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:25,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:50,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:52,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:54,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:56,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:36:58,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:00,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:02,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:04,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:06,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:08,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:34,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:36,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:38,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:37:40,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:03,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:05,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:07,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:09,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:11,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:13,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:15,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:17,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:19,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:21,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:23,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:25,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:27,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:29,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:31,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:33,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:35,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:37,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:39,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:41,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:43,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:45,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:47,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-16 21:38:54,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15