./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 IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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 IA --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET -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-18 12:43:47,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 12:43:47,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 12:43:47,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 12:43:47,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 12:43:47,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 12:43:47,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 12:43:47,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 12:43:47,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 12:43:47,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 12:43:47,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 12:43:47,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 12:43:47,241 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 12:43:47,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 12:43:47,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 12:43:47,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 12:43:47,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 12:43:47,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 12:43:47,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 12:43:47,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 12:43:47,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 12:43:47,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 12:43:47,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 12:43:47,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 12:43:47,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 12:43:47,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 12:43:47,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 12:43:47,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 12:43:47,249 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 12:43:47,250 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-18 12:43:47,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 12:43:47,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 12:43:47,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 12:43:47,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 12:43:47,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 12:43:47,438 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-18 12:43:48,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 12:43:48,832 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 12:43:48,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-18 12:43:48,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d605a009e/4cd3f9090dd64c70808e9f836a2e759c/FLAGbc93e3a0d [2024-10-18 12:43:49,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d605a009e/4cd3f9090dd64c70808e9f836a2e759c [2024-10-18 12:43:49,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 12:43:49,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 12:43:49,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 12:43:49,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 12:43:49,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 12:43:49,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18038eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49, skipping insertion in model container [2024-10-18 12:43:49,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 12:43:49,586 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-18 12:43:49,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 12:43:49,627 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 12:43:49,665 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-18 12:43:49,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 12:43:49,721 INFO L204 MainTranslator]: Completed translation [2024-10-18 12:43:49,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49 WrapperNode [2024-10-18 12:43:49,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 12:43:49,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 12:43:49,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 12:43:49,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 12:43:49,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,775 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-10-18 12:43:49,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 12:43:49,778 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 12:43:49,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 12:43:49,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 12:43:49,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 12:43:49,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 12:43:49,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 12:43:49,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 12:43:49,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (1/1) ... [2024-10-18 12:43:49,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 12:43:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:43:49,855 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-18 12:43:49,857 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-18 12:43:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 12:43:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 12:43:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-18 12:43:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 12:43:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 12:43:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-18 12:43:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 12:43:49,892 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-18 12:43:49,893 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-18 12:43:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 12:43:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 12:43:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 12:43:49,895 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 12:43:50,032 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 12:43:50,035 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 12:43:50,328 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 12:43:50,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 12:43:50,459 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 12:43:50,463 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-18 12:43:50,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 12:43:50 BoogieIcfgContainer [2024-10-18 12:43:50,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 12:43:50,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 12:43:50,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 12:43:50,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 12:43:50,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 12:43:49" (1/3) ... [2024-10-18 12:43:50,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e146314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 12:43:50, skipping insertion in model container [2024-10-18 12:43:50,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 12:43:49" (2/3) ... [2024-10-18 12:43:50,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e146314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 12:43:50, skipping insertion in model container [2024-10-18 12:43:50,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 12:43:50" (3/3) ... [2024-10-18 12:43:50,471 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-18 12:43:50,484 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 12:43:50,484 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-18 12:43:50,485 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 12:43:50,547 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-18 12:43:50,607 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 12:43:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 12:43:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:43:50,609 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-18 12:43:50,613 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-18 12:43:50,694 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 12:43:50,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:43:50,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-18 12:43:50,714 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;@687e04cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 12:43:50,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 12:43:51,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:43:51,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:43:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-10-18 12:43:51,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:43:51,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379062728] [2024-10-18 12:43:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:43:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:43:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:43:51,298 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-18 12:43:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:43:51,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379062728] [2024-10-18 12:43:51,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379062728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 12:43:51,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 12:43:51,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-18 12:43:51,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077075549] [2024-10-18 12:43:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 12:43:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-18 12:43:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:43:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-18 12:43:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-18 12:43:51,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:43:51,328 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:43:51,328 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-18 12:43:51,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:43:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:43:51,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-18 12:43:51,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:43:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:43:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-10-18 12:43:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:43:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697259132] [2024-10-18 12:43:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:43:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:43:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:43:51,458 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-18 12:43:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:43:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697259132] [2024-10-18 12:43:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697259132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:43:51,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380884492] [2024-10-18 12:43:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:43:51,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:43:51,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:43:51,480 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-18 12:43:51,481 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-18 12:43:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:43:51,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 12:43:51,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:43:51,572 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-18 12:43:51,573 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:43:51,590 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-18 12:43:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380884492] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:43:51,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:43:51,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-18 12:43:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340200169] [2024-10-18 12:43:51,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:43:51,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 12:43:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:43:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 12:43:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 12:43:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:43:51,595 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:43:51,595 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-18 12:43:51,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:43:51,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:43:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:43:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:43:51,705 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-18 12:43:51,896 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-18 12:43:51,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:43:51,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:43:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-10-18 12:43:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:43:51,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75676306] [2024-10-18 12:43:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:43:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:43:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:43:52,041 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-18 12:43:52,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:43:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75676306] [2024-10-18 12:43:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75676306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:43:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914422592] [2024-10-18 12:43:52,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 12:43:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:43:52,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:43:52,045 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-18 12:43:52,046 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-18 12:43:52,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 12:43:52,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 12:43:52,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 12:43:52,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:43:52,137 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-18 12:43:52,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:43:52,198 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-18 12:43:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914422592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:43:52,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:43:52,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-18 12:43:52,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422214016] [2024-10-18 12:43:52,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:43:52,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 12:43:52,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:43:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 12:43:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-18 12:43:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:43:52,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:43:52,204 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-18 12:43:52,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:43:52,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:43:52,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:43:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:43:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:43:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:43:52,280 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-18 12:43:52,467 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-18 12:43:52,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:43:52,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:43:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-10-18 12:43:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:43:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367187876] [2024-10-18 12:43:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:43:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:43:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:43:52,722 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-18 12:43:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:43:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367187876] [2024-10-18 12:43:52,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367187876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:43:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810618961] [2024-10-18 12:43:52,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 12:43:52,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:43:52,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:43:52,725 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-18 12:43:52,726 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-18 12:43:52,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-18 12:43:52,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 12:43:52,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-18 12:43:52,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:43:52,829 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-18 12:43:52,907 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 12:43:52,908 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-18 12:43:52,932 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-18 12:43:52,992 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-18 12:43:53,032 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-18 12:43:53,054 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-18 12:43:53,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:43:59,117 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-18 12:44:01,136 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-18 12:44:01,231 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-18 12:44:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810618961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:44:01,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:44:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-18 12:44:01,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766458587] [2024-10-18 12:44:01,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:44:01,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-18 12:44:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:44:01,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-18 12:44:01,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=122, Unknown=4, NotChecked=46, Total=210 [2024-10-18 12:44:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:01,237 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:44:01,237 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-18 12:44:01,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:01,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:01,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:01,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:01,393 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-18 12:44:01,580 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-18 12:44:01,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:44:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:44:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-10-18 12:44:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:44:01,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995993276] [2024-10-18 12:44:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:44:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:44:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:44:02,116 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-18 12:44:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:44:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995993276] [2024-10-18 12:44:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995993276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:44:02,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849480195] [2024-10-18 12:44:02,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:44:02,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:44:02,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:44:02,118 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-18 12:44:02,119 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-18 12:44:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:44:02,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-18 12:44:02,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:44:02,219 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-18 12:44:02,270 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 12:44:02,270 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-18 12:44:02,286 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-18 12:44:02,339 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-18 12:44:02,380 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-18 12:44:02,417 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-18 12:44:02,498 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-18 12:44:02,516 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-18 12:44:02,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:44:12,613 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-18 12:44:16,662 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-18 12:44:16,759 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-18 12:44:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849480195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:44:16,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:44:16,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-18 12:44:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286213971] [2024-10-18 12:44:16,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:44:16,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-18 12:44:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:44:16,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-18 12:44:16,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=5, NotChecked=78, Total=506 [2024-10-18 12:44:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:16,767 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:44:16,767 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-18 12:44:16,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:16,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:16,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:16,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:16,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:44:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:44:18,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-18 12:44:18,858 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-18 12:44:18,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:44:18,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:44:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash -912837368, now seen corresponding path program 1 times [2024-10-18 12:44:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:44:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788079693] [2024-10-18 12:44:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:44:18,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:44:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:44:18,929 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-18 12:44:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:44:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788079693] [2024-10-18 12:44:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788079693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:44:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813575728] [2024-10-18 12:44:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:44:18,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:44:18,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:44:18,932 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-18 12:44:18,932 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-18 12:44:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:44:19,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-18 12:44:19,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:44:19,085 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-18 12:44:19,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:44:19,103 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-18 12:44:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813575728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:44:19,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:44:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-18 12:44:19,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082895142] [2024-10-18 12:44:19,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:44:19,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-18 12:44:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:44:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-18 12:44:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-18 12:44:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:19,187 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:44:19,187 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-18 12:44:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:44:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:44:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:44:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:44:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 12:44:19,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-18 12:44:19,568 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-18 12:44:19,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:44:19,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:44:19,569 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-10-18 12:44:19,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:44:19,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098107668] [2024-10-18 12:44:19,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:44:19,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:44:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:44:19,961 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-18 12:44:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:44:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098107668] [2024-10-18 12:44:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098107668] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:44:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536458468] [2024-10-18 12:44:19,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-18 12:44:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:44:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:44:19,964 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-18 12:44:19,964 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-18 12:44:20,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-18 12:44:20,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 12:44:20,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-18 12:44:20,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:44:20,069 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-18 12:44:20,175 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-18 12:44:20,175 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-18 12:44:20,214 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-18 12:44:20,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 22 treesize of output 17 [2024-10-18 12:44:20,449 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-18 12:44:20,498 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-18 12:44:23,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-18 12:44:23,690 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-18 12:44:23,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:44:34,901 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-18 12:44:36,415 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-18 12:44:37,902 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-18 12:44:39,930 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-18 12:44:41,994 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-18 12:44:44,013 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-18 12:44:44,163 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-18 12:44:44,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536458468] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:44:44,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:44:44,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-18 12:44:44,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469684509] [2024-10-18 12:44:44,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:44:44,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-18 12:44:44,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:44:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-18 12:44:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=364, Unknown=15, NotChecked=270, Total=756 [2024-10-18 12:44:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:44,191 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:44:44,191 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-18 12:44:44,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:44,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:44,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:44,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:44:44,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:44:44,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 12:44:44,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:44:50,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:44:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:44:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:44:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:44:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:44:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 12:44:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 12:44:50,908 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-18 12:44:51,095 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-18 12:44:51,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:44:51,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:44:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-10-18 12:44:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:44:51,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655898203] [2024-10-18 12:44:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:44:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:44:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:44:52,154 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-18 12:44:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:44:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655898203] [2024-10-18 12:44:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655898203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:44:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972373754] [2024-10-18 12:44:52,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-18 12:44:52,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:44:52,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:44:52,156 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-18 12:44:52,157 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-18 12:44:52,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-18 12:44:52,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 12:44:52,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-18 12:44:52,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:44:52,306 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-18 12:44:52,422 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-18 12:44:52,423 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-18 12:44:52,451 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-18 12:44:52,593 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-18 12:44:52,675 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-18 12:44:55,421 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-18 12:44:58,881 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-18 12:45:05,496 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-18 12:45:23,591 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-18 12:45:23,639 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-18 12:45:23,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:45:47,107 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-18 12:45:48,954 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-18 12:45:50,824 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-18 12:45:52,873 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-18 12:45:54,928 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-18 12:45:54,947 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-18 12:45:57,052 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-18 12:45:59,130 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-18 12:46:01,236 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-18 12:46:03,274 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-18 12:46:03,525 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-18 12:46:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972373754] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:46:03,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:46:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-18 12:46:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257938024] [2024-10-18 12:46:03,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:46:03,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-18 12:46:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:46:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-18 12:46:03,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=40, NotChecked=650, Total=1560 [2024-10-18 12:46:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:46:03,549 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:46:03,549 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-18 12:46:03,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-18 12:46:03,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:46:05,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:06,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:10,926 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-18 12:46:12,945 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-18 12:46:14,989 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-18 12:46:18,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:20,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:21,619 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-18 12:46:22,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:36,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:38,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:39,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:40,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-18 12:46:55,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-18 12:46:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 12:46:55,401 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-18 12:46:55,591 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-18 12:46:55,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 12:46:55,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 12:46:55,592 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-10-18 12:46:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 12:46:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740023208] [2024-10-18 12:46:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 12:46:55,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 12:46:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 12:47:11,493 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-18 12:47:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 12:47:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740023208] [2024-10-18 12:47:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740023208] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 12:47:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94899431] [2024-10-18 12:47:11,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-18 12:47:11,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 12:47:11,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 12:47:11,496 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-18 12:47:11,497 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-18 12:47:11,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-18 12:47:11,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-18 12:47:11,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-18 12:47:11,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 12:47:11,821 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-18 12:47:11,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 12:47:11,872 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-18 12:47:11,912 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-18 12:47:12,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 22 treesize of output 17 [2024-10-18 12:47:12,130 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-18 12:47:15,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-18 12:47:18,720 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-18 12:47:37,502 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-18 12:47:46,069 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-18 12:48:22,919 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 224 treesize of output 191 [2024-10-18 12:48:44,909 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 848 treesize of output 723 [2024-10-18 12:49:05,989 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 857 treesize of output 730 [2024-10-18 12:51:11,269 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 978 treesize of output 794 [2024-10-18 12:51:12,289 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-18 12:51:12,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 12:51:42,538 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-18 12:51:44,571 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-18 12:51:46,614 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-18 12:51:46,626 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-18 12:51:46,676 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-18 12:51:46,691 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-18 12:51:48,780 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-18 12:51:50,847 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-18 12:51:52,934 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-18 12:51:54,966 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-18 12:51:57,073 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-18 12:51:59,156 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-18 12:52:01,278 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-18 12:52:03,316 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-18 12:52:05,457 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-18 12:52:07,576 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-18 12:52:09,731 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-18 12:52:11,795 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-18 12:52:13,065 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-18 12:52:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94899431] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 12:52:13,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 12:52:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 62 [2024-10-18 12:52:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275620956] [2024-10-18 12:52:13,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 12:52:13,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-10-18 12:52:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 12:52:13,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-10-18 12:52:13,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1566, Unknown=121, NotChecked=1854, Total=3906 [2024-10-18 12:52:13,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:52:13,088 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 12:52:13,088 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-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-18 12:52:13,088 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 12:52:15,536 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-18 12:52:17,001 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-18 12:52:19,005 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-18 12:52:21,012 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-18 12:52:22,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:52:35,314 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-18 12:52:37,358 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-18 12:52:39,392 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-18 12:52:41,406 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-18 12:52:43,415 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-18 12:52:45,431 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-18 12:52:47,435 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-18 12:53:06,996 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-18 12:53:09,018 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-18 12:53:10,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:53:12,354 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-18 12:53:14,361 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-18 12:53:16,377 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-18 12:53:17,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:53:25,000 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-18 12:53:27,019 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-18 12:53:28,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:53:30,351 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-18 12:53:32,357 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-18 12:53:34,369 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-18 12:53:36,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:53:45,741 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-18 12:53:47,790 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-18 12:53:49,804 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-18 12:53:51,817 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-18 12:53:53,882 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-18 12:54:12,806 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-18 12:54:14,825 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-18 12:54:16,830 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-18 12:54:18,846 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-18 12:54:20,859 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-18 12:54:22,866 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-18 12:54:24,877 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-18 12:54:26,889 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-18 12:54:28,898 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-18 12:54:58,907 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-18 12:55:00,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:02,631 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-18 12:55:04,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:24,407 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-18 12:55:26,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:28,106 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-18 12:55:29,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:31,689 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-18 12:55:33,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:35,665 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-18 12:55:37,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:39,505 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-18 12:55:41,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:43,190 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-18 12:55:44,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:46,790 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-18 12:55:48,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:50,491 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-18 12:55:52,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:54,144 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-18 12:55:55,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:55:57,884 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-18 12:55:59,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-18 12:56:01,544 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-18 12:56:03,573 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-18 12:56:05,592 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] Killed by 15