./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 COUNTEREXAMPLE --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 COUNTEREXAMPLE --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-17 11:41:16,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 11:41:16,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 11:41:16,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 11:41:16,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 11:41:16,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 11:41:16,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 11:41:16,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 11:41:16,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 11:41:16,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 11:41:16,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 11:41:16,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 11:41:16,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 11:41:16,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 11:41:16,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 11:41:16,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 11:41:16,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 11:41:16,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 11:41:16,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 11:41:16,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 11:41:16,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 11:41:16,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 11:41:16,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 11:41:16,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 11:41:16,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 11:41:16,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 11:41:16,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 11:41:16,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 11:41:16,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 11:41:16,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 11:41:16,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 11:41:16,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 11:41:16,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 11:41:16,986 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 11:41:16,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 11:41:16,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 11:41:16,987 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 11:41:16,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 11:41:16,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 11:41:16,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 11:41:16,988 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 11:41:16,988 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 -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET [2024-10-17 11:41:17,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 11:41:17,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 11:41:17,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 11:41:17,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 11:41:17,321 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 11:41:17,322 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-17 11:41:18,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 11:41:18,965 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 11:41:18,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-17 11:41:18,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b53453dab/db1899931012484eb0932f82f761acc9/FLAG0fc6e4a44 [2024-10-17 11:41:19,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b53453dab/db1899931012484eb0932f82f761acc9 [2024-10-17 11:41:19,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 11:41:19,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 11:41:19,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 11:41:19,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 11:41:19,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 11:41:19,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579300de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19, skipping insertion in model container [2024-10-17 11:41:19,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 11:41:19,551 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-17 11:41:19,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 11:41:19,617 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 11:41:19,669 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-17 11:41:19,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 11:41:19,744 INFO L204 MainTranslator]: Completed translation [2024-10-17 11:41:19,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19 WrapperNode [2024-10-17 11:41:19,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 11:41:19,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 11:41:19,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 11:41:19,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 11:41:19,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,813 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-10-17 11:41:19,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 11:41:19,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 11:41:19,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 11:41:19,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 11:41:19,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 11:41:19,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 11:41:19,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 11:41:19,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 11:41:19,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (1/1) ... [2024-10-17 11:41:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 11:41:19,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:19,900 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-17 11:41:19,904 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-17 11:41:19,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 11:41:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 11:41:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 11:41:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 11:41:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 11:41:19,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 11:41:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 11:41:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 11:41:19,963 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 11:41:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 11:41:19,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 11:41:19,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 11:41:19,965 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 11:41:20,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 11:41:20,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 11:41:20,455 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 11:41:20,456 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 11:41:20,618 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 11:41:20,619 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-17 11:41:20,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:41:20 BoogieIcfgContainer [2024-10-17 11:41:20,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 11:41:20,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 11:41:20,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 11:41:20,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 11:41:20,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 11:41:19" (1/3) ... [2024-10-17 11:41:20,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698e0007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:41:20, skipping insertion in model container [2024-10-17 11:41:20,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 11:41:19" (2/3) ... [2024-10-17 11:41:20,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698e0007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 11:41:20, skipping insertion in model container [2024-10-17 11:41:20,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 11:41:20" (3/3) ... [2024-10-17 11:41:20,629 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-17 11:41:20,646 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 11:41:20,646 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-17 11:41:20,646 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 11:41:20,695 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 11:41:20,748 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 11:41:20,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 11:41:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:20,751 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-17 11:41:20,752 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-17 11:41:20,841 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 11:41:20,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:20,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 11:41:20,861 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;@2ec1af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 11:41:20,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 11:41:21,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:21,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:21,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-10-17 11:41:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:41:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946586939] [2024-10-17 11:41:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:21,603 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-17 11:41:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:41:21,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946586939] [2024-10-17 11:41:21,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946586939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 11:41:21,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 11:41:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 11:41:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403790973] [2024-10-17 11:41:21,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 11:41:21,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 11:41:21,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:41:21,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 11:41:21,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 11:41:21,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:21,638 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:41:21,639 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-17 11:41:21,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:21,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 11:41:21,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:21,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-10-17 11:41:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:41:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353000564] [2024-10-17 11:41:21,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:21,787 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-17 11:41:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:41:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353000564] [2024-10-17 11:41:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353000564] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:41:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977514525] [2024-10-17 11:41:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:21,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:41:21,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:21,791 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-17 11:41:21,792 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-17 11:41:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:21,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 11:41:21,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:41:21,941 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-17 11:41:21,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:41:21,966 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-17 11:41:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977514525] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:41:21,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:41:21,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 11:41:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416169647] [2024-10-17 11:41:21,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:41:21,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 11:41:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:41:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 11:41:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 11:41:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:21,972 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:41:21,972 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-17 11:41:21,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:21,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:22,058 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-17 11:41:22,242 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-17 11:41:22,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-10-17 11:41:22,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:41:22,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900253425] [2024-10-17 11:41:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:22,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:22,432 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-17 11:41:22,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:41:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900253425] [2024-10-17 11:41:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900253425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:41:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690485217] [2024-10-17 11:41:22,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:41:22,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:41:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:22,437 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-17 11:41:22,438 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-17 11:41:22,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:41:22,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:41:22,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 11:41:22,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:41:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 11:41:22,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:41:22,615 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-17 11:41:22,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690485217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:41:22,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:41:22,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 11:41:22,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470647054] [2024-10-17 11:41:22,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:41:22,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 11:41:22,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:41:22,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 11:41:22,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 11:41:22,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:22,619 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:41:22,619 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-17 11:41:22,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:22,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:22,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:22,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-17 11:41:22,906 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-17 11:41:22,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:22,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:22,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-10-17 11:41:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:41:22,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313037863] [2024-10-17 11:41:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:22,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:23,294 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-17 11:41:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:41:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313037863] [2024-10-17 11:41:23,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313037863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:41:23,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317856802] [2024-10-17 11:41:23,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 11:41:23,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:41:23,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:23,298 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-17 11:41:23,300 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-17 11:41:23,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 11:41:23,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:41:23,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 11:41:23,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:41:23,436 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-17 11:41:23,526 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:41:23,526 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-17 11:41:23,555 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-17 11:41:23,619 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-17 11:41:23,683 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-17 11:41:23,707 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-17 11:41:23,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:41:31,786 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-17 11:41:31,800 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-17 11:41:31,914 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-17 11:41:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317856802] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:41:31,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:41:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 11:41:31,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005312148] [2024-10-17 11:41:31,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:41:31,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 11:41:31,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:41:31,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 11:41:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-17 11:41:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:31,919 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:41:31,919 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-17 11:41:31,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:31,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:31,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:31,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:32,120 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-17 11:41:32,302 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-17 11:41:32,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-10-17 11:41:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:41:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216970972] [2024-10-17 11:41:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:33,020 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-17 11:41:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:41:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216970972] [2024-10-17 11:41:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216970972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:41:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903213996] [2024-10-17 11:41:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:41:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:33,023 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-17 11:41:33,025 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-17 11:41:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:33,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 11:41:33,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:41:33,160 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-17 11:41:33,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:41:33,235 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-17 11:41:33,280 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-17 11:41:33,354 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-17 11:41:33,415 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-17 11:41:33,467 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-17 11:41:33,570 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-17 11:41:33,593 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-17 11:41:33,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:41:45,700 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-17 11:41:49,766 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-17 11:41:49,874 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-17 11:41:49,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903213996] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:41:49,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:41:49,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-17 11:41:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112118373] [2024-10-17 11:41:49,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:41:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-17 11:41:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:41:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-17 11:41:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=5, NotChecked=78, Total=506 [2024-10-17 11:41:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:49,881 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:41:49,882 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-17 11:41:49,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:49,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:49,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:49,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:49,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:41:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:41:56,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-17 11:41:56,387 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-17 11:41:56,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:56,474 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:41:56,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2024-10-17 11:41:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash 88156749, now seen corresponding path program 1 times [2024-10-17 11:41:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 11:41:56,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 11:41:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 11:41:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 11:41:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-17 11:41:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:56,716 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:41:56,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 11:41:56,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:56,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:56,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:56,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:41:56,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:41:56,716 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:41:56,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:41:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:41:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:41:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:41:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:41:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:41:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-17 11:41:56,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:41:57,094 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:41:57,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1276 treesize of output 1136 [2024-10-17 11:41:57,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1377925673, now seen corresponding path program 1 times [2024-10-17 11:41:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:41:57,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:41:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:41:57,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:41:57,272 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-10-17 11:41:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:41:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547219776] [2024-10-17 11:41:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:41:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:41:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:41:59,021 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-17 11:41:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:41:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547219776] [2024-10-17 11:41:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547219776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:41:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198639043] [2024-10-17 11:41:59,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:41:59,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:41:59,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:41:59,024 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-17 11:41:59,025 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-17 11:41:59,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:41:59,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:41:59,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-17 11:41:59,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:41:59,162 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-17 11:41:59,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:41:59,249 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-17 11:41:59,276 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-17 11:41:59,404 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-17 11:41:59,493 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-17 11:41:59,553 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 22 treesize of output 15 [2024-10-17 11:42:02,068 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-17 11:42:02,100 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-17 11:42:02,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:42:17,582 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-17 11:42:19,149 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537) |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-17 11:42:20,686 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| 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_537) |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-17 11:42:22,743 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_535 Int)) (or (= 0 (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_535 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537) |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-17 11:42:24,796 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_535 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 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_535 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537) |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-17 11:42:26,835 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (v_ArrVal_533 (Array Int Int)) (v_ArrVal_535 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 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_533) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ v_ArrVal_535 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_537) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2024-10-17 11:42:27,031 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-17 11:42:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198639043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:42:27,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:42:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 30 [2024-10-17 11:42:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785248831] [2024-10-17 11:42:27,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:42:27,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-17 11:42:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:42:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-17 11:42:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=516, Unknown=11, NotChecked=306, Total=930 [2024-10-17 11:42:27,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:42:27,036 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:42:27,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 30 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-17 11:42:27,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:42:27,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:42:27,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:42:27,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:42:27,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:42:27,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:42:27,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:42:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:42:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:42:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:42:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:42:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:42:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:42:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:42:28,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-17 11:42:29,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:42:29,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:42:29,231 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:42:29,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2562 treesize of output 2278 [2024-10-17 11:42:29,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1010516286, now seen corresponding path program 1 times [2024-10-17 11:42:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:42:29,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:42:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:42:29,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:42:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:42:29,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:42:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-10-17 11:42:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:42:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434578005] [2024-10-17 11:42:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:42:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:42:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:42:34,759 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-17 11:42:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:42:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434578005] [2024-10-17 11:42:34,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434578005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:42:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925739138] [2024-10-17 11:42:34,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 11:42:34,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:42:34,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:42:34,761 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-17 11:42:34,762 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-17 11:42:34,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 11:42:34,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:42:34,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-17 11:42:34,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:42:34,913 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-17 11:42:35,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:42:35,007 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-17 11:42:35,049 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-17 11:42:35,154 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-17 11:42:35,254 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-17 11:42:38,009 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-17 11:42:41,475 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-17 11:42:48,047 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 70 treesize of output 57 [2024-10-17 11:43:04,807 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-17 11:43:04,898 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-17 11:43:04,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:43:35,058 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |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_45|) 0))) is different from false [2024-10-17 11:43:37,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:43:39,113 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-17 11:43:41,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| 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_720 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 11:43:43,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_47| (+ v_ArrVal_720 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2024-10-17 11:43:44,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_29| Int)) (or (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_47| (+ v_ArrVal_720 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0)))) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 11:43:46,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_47| (+ v_ArrVal_720 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:43:48,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_~i~0#1_29| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_29| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_717 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_720 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_29| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:43:51,056 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_717 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)) (= (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_49| (+ v_ArrVal_717 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_720 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0))) is different from false [2024-10-17 11:43:53,117 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_717 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (= (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_716) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ v_ArrVal_717 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_720 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_723) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2024-10-17 11:43:53,429 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-17 11:43:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925739138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:43:53,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:43:53,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 42 [2024-10-17 11:43:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784293160] [2024-10-17 11:43:53,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:43:53,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-17 11:43:53,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:43:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-17 11:43:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=908, Unknown=41, NotChecked=710, Total=1806 [2024-10-17 11:43:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:43:53,433 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:43:53,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.8372093023255816) internal successors, (165), 42 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-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:43:53,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:43:58,941 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-17 11:44:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:44:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:44:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:44:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:44:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:44:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:44:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:44:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-17 11:44:04,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 11:44:05,064 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-10-17 11:44:05,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:44:05,157 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 11:44:05,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1212 treesize of output 1072 [2024-10-17 11:44:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1877605453, now seen corresponding path program 1 times [2024-10-17 11:44:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:44:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:44:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:44:05,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:44:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:44:05,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:44:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-10-17 11:44:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:44:05,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932278510] [2024-10-17 11:44:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:44:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:44:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:44:25,088 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-17 11:44:25,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:44:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932278510] [2024-10-17 11:44:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932278510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:44:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076123853] [2024-10-17 11:44:25,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 11:44:25,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:44:25,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:44:25,091 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-17 11:44:25,091 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-17 11:44:27,134 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 11:44:27,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:44:27,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-17 11:44:27,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:44:27,151 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-17 11:44:27,235 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 11:44:27,235 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-17 11:44:27,290 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-17 11:44:27,442 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-17 11:44:27,542 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-17 11:44:27,714 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-17 11:44:27,826 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-17 11:44:31,789 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-17 11:44:38,014 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-17 11:44:58,590 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 79 treesize of output 66 [2024-10-17 11:45:09,134 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 221 treesize of output 182 [2024-10-17 11:45:19,907 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 230 treesize of output 189 [2024-10-17 11:45:57,110 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 253 treesize of output 205 [2024-10-17 11:45:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-17 11:45:57,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:46:41,428 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_61|) 0))) is different from false [2024-10-17 11:46:43,490 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_61|) 0))) is different from false [2024-10-17 11:46:43,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1005 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |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_1005))) (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_61|) 0))) is different from false [2024-10-17 11:46:43,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1003 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |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_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |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_61|)))) is different from false [2024-10-17 11:46:43,645 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1005 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))) is different from false [2024-10-17 11:46:43,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1005 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 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_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 11:46:45,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1005 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:46:47,845 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (= (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| (+ (- 1) v_ArrVal_1001))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:46:49,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (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_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 11:46:51,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (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_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:46:54,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (= (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 (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:46:56,244 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_998 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse2 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (= (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_998 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:46:58,277 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (v_ArrVal_1003 Int) (v_ArrVal_998 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse2 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (= (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_998 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:47:00,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_998 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) (= (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_67| (+ v_ArrVal_998 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:47:02,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_998 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (= (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_67| (+ v_ArrVal_998 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:47:04,611 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_998 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse1 28 |c_~#cache~0.offset|)) (= (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_67| (+ v_ArrVal_998 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:47:06,761 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_~i~0#1_37| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_998 Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_37| 28))) (let ((.cse0 (+ .cse3 |c_~#cache~0.offset|))) (or (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 28)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) (= (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| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse1 |c_~#cache~0.base| (store (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_998 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse3 28 |c_~#cache~0.offset|)) (< .cse0 (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)) (< |v_t_funThread1of1ForFork0_~i~0#1_37| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)))))) is different from false [2024-10-17 11:47:08,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_998 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_998 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)))) is different from false [2024-10-17 11:47:10,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1005 (Array Int Int)) (v_ArrVal_1001 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1003 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_998 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_992) |c_~#cache~0.base|))) (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ v_ArrVal_998 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) v_ArrVal_1001)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1003)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1005) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 0))) is different from false [2024-10-17 11:47:11,423 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-17 11:47:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076123853] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:47:11,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:47:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 24] total 60 [2024-10-17 11:47:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680253149] [2024-10-17 11:47:11,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:47:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-17 11:47:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:47:11,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-17 11:47:11,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=1372, Unknown=79, NotChecked=1862, Total=3660 [2024-10-17 11:47:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:47:11,427 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:47:11,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.524590163934426) internal successors, (276), 60 states have internal predecessors, (276), 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-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-17 11:47:11,428 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:47:13,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:47:14,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:47:16,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:47:24,403 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-17 11:47:26,414 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-17 11:47:28,433 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-17 11:47:30,463 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-17 11:47:32,479 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-17 11:47:47,980 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-17 11:47:49,993 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-17 11:47:51,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:47:52,913 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-17 11:47:54,471 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-17 11:48:00,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-17 11:48:02,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:48:03,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:48:05,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:48:06,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:48:12,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:48:14,854 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-17 11:48:16,865 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-17 11:48:33,089 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-17 11:48:45,356 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-17 11:48:47,364 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-17 11:48:49,374 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-17 11:48:51,387 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-17 11:48:53,398 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-17 11:48:55,410 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-17 11:48:57,622 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-17 11:49:01,790 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-17 11:49:03,801 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-17 11:49:05,808 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-17 11:49:07,815 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-17 11:49:09,821 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-17 11:49:11,832 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-17 11:49:32,064 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-17 11:49:34,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:49:51,985 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-17 11:49:53,998 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-17 11:49:56,013 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-17 11:49:58,026 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-17 11:50:00,033 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-17 11:50:02,040 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-17 11:50:04,049 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-17 11:50:08,375 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-17 11:50:16,508 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-17 11:50:18,515 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-17 11:50:20,522 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-17 11:50:22,530 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-17 11:50:24,538 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-17 11:50:26,545 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-17 11:50:42,939 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-17 11:50:44,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-17 11:50:46,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 11:50:47,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-17 11:50:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 11:50:47,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 11:50:47,490 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-17 11:50:47,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:47,677 INFO L414 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2024-10-17 11:50:47,680 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-17 11:50:47,685 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 11:50:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 11:50:47,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:47,689 INFO L229 MonitoredProcess]: Starting monitored process 10 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-17 11:50:47,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-17 11:50:47,728 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 11:50:47,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:47,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 11:50:47,729 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;@2ec1af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 11:50:47,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 11:50:47,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 11:50:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1200789139, now seen corresponding path program 1 times [2024-10-17 11:50:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203028414] [2024-10-17 11:50:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:47,915 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-17 11:50:47,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203028414] [2024-10-17 11:50:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203028414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 11:50:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 11:50:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 11:50:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629778042] [2024-10-17 11:50:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 11:50:47,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 11:50:47,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 11:50:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 11:50:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:47,920 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:47,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-17 11:50:47,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-17 11:50:47,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 11:50:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1217839688, now seen corresponding path program 1 times [2024-10-17 11:50:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636619575] [2024-10-17 11:50:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:47,983 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-17 11:50:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636619575] [2024-10-17 11:50:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636619575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:50:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045814578] [2024-10-17 11:50:47,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:47,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:47,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:47,986 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:50:47,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-17 11:50:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:48,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 11:50:48,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:50:48,110 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-17 11:50:48,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:50:48,129 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-17 11:50:48,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045814578] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:50:48,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:50:48,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 11:50:48,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014102192] [2024-10-17 11:50:48,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:50:48,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 11:50:48,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:48,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 11:50:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 11:50:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:48,131 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:48,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-17 11:50:48,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:48,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:48,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:48,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-17 11:50:48,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-17 11:50:48,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 11:50:48,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2098879443, now seen corresponding path program 2 times [2024-10-17 11:50:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656355778] [2024-10-17 11:50:48,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:48,465 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-17 11:50:48,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:48,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656355778] [2024-10-17 11:50:48,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656355778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:50:48,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960025301] [2024-10-17 11:50:48,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:50:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:48,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:50:48,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-17 11:50:48,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:50:48,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:50:48,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 11:50:48,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:50:48,604 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-17 11:50:48,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:50:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 11:50:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960025301] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:50:48,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:50:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 11:50:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660829182] [2024-10-17 11:50:48,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:50:48,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 11:50:48,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 11:50:48,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 11:50:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:48,687 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 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-17 11:50:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:48,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:50:48,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-17 11:50:48,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:48,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 11:50:48,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1949456307, now seen corresponding path program 3 times [2024-10-17 11:50:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:48,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751673204] [2024-10-17 11:50:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:50:48,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:50:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:50:48,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 11:50:48,982 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 11:50:48,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-17 11:50:48,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-17 11:50:48,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-17 11:50:48,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-17 11:50:48,987 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-17 11:50:48,987 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-10-17 11:50:48,988 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 11:50:48,988 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 11:50:49,006 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 11:50:49,008 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 11:50:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 11:50:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:49,010 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 11:50:49,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-17 11:50:49,047 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 11:50:49,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:49,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-17 11:50:49,048 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;@2ec1af84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 11:50:49,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 11:50:49,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:50:49,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -589821022, now seen corresponding path program 1 times [2024-10-17 11:50:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:49,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617500350] [2024-10-17 11:50:49,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-17 11:50:49,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617500350] [2024-10-17 11:50:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617500350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 11:50:49,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 11:50:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 11:50:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971491796] [2024-10-17 11:50:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 11:50:49,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 11:50:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:49,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 11:50:49,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 11:50:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:49,861 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:49,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-17 11:50:49,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:50,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-17 11:50:50,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:50:50,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash -300065088, now seen corresponding path program 1 times [2024-10-17 11:50:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398519293] [2024-10-17 11:50:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 11:50:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398519293] [2024-10-17 11:50:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398519293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:50:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583449297] [2024-10-17 11:50:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:50,502 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:50:50,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-17 11:50:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:50,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 11:50:50,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:50:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 11:50:50,666 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:50:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 11:50:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583449297] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:50:50,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:50:50,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 11:50:50,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157412573] [2024-10-17 11:50:50,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:50:50,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 11:50:50,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 11:50:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 11:50:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:50,685 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 11:50:50,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:50,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:50,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-17 11:50:51,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:51,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:50:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1209563804, now seen corresponding path program 2 times [2024-10-17 11:50:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835993609] [2024-10-17 11:50:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:51,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 11:50:51,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835993609] [2024-10-17 11:50:51,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835993609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:50:51,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208197459] [2024-10-17 11:50:51,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 11:50:51,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:51,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:51,160 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:50:51,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-17 11:50:51,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 11:50:51,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:50:51,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 11:50:51,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:50:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 11:50:51,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:50:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 11:50:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208197459] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:50:51,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:50:51,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 11:50:51,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009746680] [2024-10-17 11:50:51,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:50:51,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 11:50:51,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 11:50:51,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 11:50:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:51,450 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:51,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 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-17 11:50:51,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:51,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:51,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:50:51,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-17 11:50:51,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:51,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:50:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:50:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 234997732, now seen corresponding path program 3 times [2024-10-17 11:50:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:50:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311651746] [2024-10-17 11:50:51,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:50:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:50:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:50:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 11:50:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 11:50:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311651746] [2024-10-17 11:50:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311651746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 11:50:55,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067460521] [2024-10-17 11:50:55,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 11:50:55,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:50:55,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 11:50:55,532 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 11:50:55,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-17 11:50:55,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 11:50:55,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 11:50:55,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-17 11:50:55,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 11:50:56,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-17 11:50:56,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 11:50:56,919 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 16 treesize of output 11 [2024-10-17 11:50:56,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 11:50:56,946 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 16 treesize of output 11 [2024-10-17 11:50:57,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 11:50:57,051 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 21 treesize of output 20 [2024-10-17 11:50:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 11:50:57,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 11:50:57,504 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1569 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1569))) (store .cse0 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#cache~0.base|) (+ 32 (* |c_t_funThread2of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0))) is different from false [2024-10-17 11:50:57,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 11:50:57,528 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2024-10-17 11:50:57,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 11:50:57,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 211 [2024-10-17 11:50:57,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 178 [2024-10-17 11:50:57,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-17 11:50:57,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-17 11:50:57,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 11:50:57,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-17 11:50:57,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 11:50:57,674 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 68 treesize of output 63 [2024-10-17 11:50:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2024-10-17 11:50:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067460521] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 11:50:58,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 11:50:58,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 42 [2024-10-17 11:50:58,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902212149] [2024-10-17 11:50:58,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 11:50:58,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-17 11:50:58,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 11:50:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-17 11:50:58,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1532, Unknown=1, NotChecked=80, Total=1806 [2024-10-17 11:50:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:50:58,350 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:50:58,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.27906976744186) internal successors, (227), 42 states have internal predecessors, (227), 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-17 11:50:58,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:50:58,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:50:58,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:50:58,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:51:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:51:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:51:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:51:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-17 11:51:11,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-17 11:51:11,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 11:51:11,472 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:51:11,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 288 [2024-10-17 11:51:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -386319929, now seen corresponding path program 1 times [2024-10-17 11:51:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:51:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 11:51:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:51:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 11:51:12,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-17 11:51:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-17 11:51:12,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-17 11:51:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:51:12,649 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 11:51:12,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 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-17 11:51:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:51:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:51:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:51:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-17 11:51:12,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 11:51:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 11:51:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 11:51:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 11:51:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-17 11:51:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 11:51:14,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2024-10-17 11:51:14,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 11:51:14,813 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 646 treesize of output 598 [2024-10-17 11:51:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1326759058, now seen corresponding path program 1 times [2024-10-17 11:51:14,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:14,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:51:14,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:51:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:51:14,986 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 1226 treesize of output 1130 [2024-10-17 11:51:15,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1501468495, now seen corresponding path program 1 times [2024-10-17 11:51:15,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:51:15,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 11:51:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 11:51:15,194 INFO L349 Elim1Store]: treesize reduction 9, result has 30.8 percent of original size [2024-10-17 11:51:15,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 320 treesize of output 294 [2024-10-17 11:51:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash 290560121, now seen corresponding path program 1 times [2024-10-17 11:51:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:51:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 11:51:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 11:51:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 11:51:15,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 11:51:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1958579164, now seen corresponding path program 4 times [2024-10-17 11:51:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 11:51:15,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480294241] [2024-10-17 11:51:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 11:51:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 11:51:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat