/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-26 02:14:54,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-26 02:14:54,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-26 02:14:54,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-26 02:14:54,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-26 02:14:54,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-26 02:14:54,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-26 02:14:54,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-26 02:14:54,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-26 02:14:54,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-26 02:14:54,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-26 02:14:54,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-26 02:14:54,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-26 02:14:54,878 INFO L153 SettingsManager]: * Use SBE=true [2024-01-26 02:14:54,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-26 02:14:54,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-26 02:14:54,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-26 02:14:54,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-26 02:14:54,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-26 02:14:54,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-26 02:14:54,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-26 02:14:54,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-26 02:14:54,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-26 02:14:54,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-26 02:14:54,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-26 02:14:54,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-26 02:14:54,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-26 02:14:54,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-26 02:14:54,882 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-26 02:14:54,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-26 02:14:54,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 02:14:54,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-26 02:14:54,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-26 02:14:54,883 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-26 02:14:54,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-26 02:14:54,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-26 02:14:54,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-26 02:14:54,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-26 02:14:54,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-26 02:14:54,884 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-26 02:14:54,884 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-26 02:14:54,892 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.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-01-26 02:14:55,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-26 02:14:55,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-26 02:14:55,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-26 02:14:55,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-26 02:14:55,098 INFO L274 PluginConnector]: CDTParser initialized [2024-01-26 02:14:55,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-01-26 02:14:56,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-26 02:14:56,333 INFO L384 CDTParser]: Found 1 translation units. [2024-01-26 02:14:56,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-01-26 02:14:56,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/826850460/cb9e52e8da9a4e3eb35259eb646c8f85/FLAG4a79f439c [2024-01-26 02:14:56,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/826850460/cb9e52e8da9a4e3eb35259eb646c8f85 [2024-01-26 02:14:56,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-26 02:14:56,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-26 02:14:56,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-26 02:14:56,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-26 02:14:56,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-26 02:14:56,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@783f7f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56, skipping insertion in model container [2024-01-26 02:14:56,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,379 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-26 02:14:56,502 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-26 02:14:56,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 02:14:56,513 INFO L202 MainTranslator]: Completed pre-run [2024-01-26 02:14:56,526 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-01-26 02:14:56,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-26 02:14:56,538 INFO L206 MainTranslator]: Completed translation [2024-01-26 02:14:56,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56 WrapperNode [2024-01-26 02:14:56,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-26 02:14:56,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-26 02:14:56,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-26 02:14:56,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-26 02:14:56,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,567 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 149 [2024-01-26 02:14:56,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-26 02:14:56,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-26 02:14:56,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-26 02:14:56,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-26 02:14:56,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-26 02:14:56,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-26 02:14:56,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-26 02:14:56,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-26 02:14:56,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (1/1) ... [2024-01-26 02:14:56,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-26 02:14:56,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:14:56,620 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-01-26 02:14:56,624 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-01-26 02:14:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-26 02:14:56,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-26 02:14:56,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-26 02:14:56,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-26 02:14:56,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-26 02:14:56,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-26 02:14:56,659 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-26 02:14:56,736 INFO L241 CfgBuilder]: Building ICFG [2024-01-26 02:14:56,738 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-26 02:14:56,920 INFO L282 CfgBuilder]: Performing block encoding [2024-01-26 02:14:56,938 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-26 02:14:56,938 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-26 02:14:56,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:14:56 BoogieIcfgContainer [2024-01-26 02:14:56,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-26 02:14:56,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-26 02:14:56,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-26 02:14:56,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-26 02:14:56,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 02:14:56" (1/3) ... [2024-01-26 02:14:56,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9de478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:14:56, skipping insertion in model container [2024-01-26 02:14:56,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:14:56" (2/3) ... [2024-01-26 02:14:56,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9de478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:14:56, skipping insertion in model container [2024-01-26 02:14:56,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:14:56" (3/3) ... [2024-01-26 02:14:56,947 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-01-26 02:14:56,953 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-26 02:14:56,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-26 02:14:56,993 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-26 02:14:56,993 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-26 02:14:57,100 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-26 02:14:57,141 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:14:57,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-26 02:14:57,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:14:57,144 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-01-26 02:14:57,158 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-01-26 02:14:57,198 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-26 02:14:57,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-26 02:14:57,212 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7bc4f8a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-26 02:14:57,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-26 02:14:57,638 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:14:57,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:14:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -861204860, now seen corresponding path program 1 times [2024-01-26 02:14:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:14:57,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160895913] [2024-01-26 02:14:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:14:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:14:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:14:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:14:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:14:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160895913] [2024-01-26 02:14:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160895913] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:14:57,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:14:57,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-26 02:14:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138976489] [2024-01-26 02:14:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:14:57,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-26 02:14:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:14:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-26 02:14:57,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-26 02:14:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:57,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:14:57,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 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-01-26 02:14:57,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:14:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:58,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-26 02:14:58,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:14:58,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:14:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash -84593131, now seen corresponding path program 1 times [2024-01-26 02:14:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:14:58,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962227806] [2024-01-26 02:14:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:14:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:14:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:14:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:14:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:14:58,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962227806] [2024-01-26 02:14:58,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962227806] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-26 02:14:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-26 02:14:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-26 02:14:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405312969] [2024-01-26 02:14:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:14:58,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-26 02:14:58,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:14:58,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-26 02:14:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-26 02:14:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:58,534 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:14:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 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-01-26 02:14:58,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:58,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:14:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:14:58,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-26 02:14:58,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:14:58,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:14:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 775525239, now seen corresponding path program 1 times [2024-01-26 02:14:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:14:58,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998959473] [2024-01-26 02:14:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:14:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:14:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:14:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:14:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:14:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998959473] [2024-01-26 02:14:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998959473] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:14:59,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034632707] [2024-01-26 02:14:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:14:59,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:14:59,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:14:59,086 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-01-26 02:14:59,105 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-01-26 02:14:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:14:59,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-26 02:14:59,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:14:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:14:59,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:14:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-26 02:14:59,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034632707] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-26 02:14:59,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-26 02:14:59,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-01-26 02:14:59,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760182691] [2024-01-26 02:14:59,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-26 02:14:59,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-26 02:14:59,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:14:59,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-26 02:14:59,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-01-26 02:14:59,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:59,392 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:14:59,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-01-26 02:14:59,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:59,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:14:59,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:14:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:14:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:14:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:14:59,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-26 02:14:59,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-01-26 02:14:59,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:14:59,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:14:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -967497434, now seen corresponding path program 1 times [2024-01-26 02:14:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:14:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929011941] [2024-01-26 02:14:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:14:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:14:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:15:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-26 02:15:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:15:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929011941] [2024-01-26 02:15:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929011941] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:15:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671401173] [2024-01-26 02:15:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:15:00,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:15:00,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:15:00,225 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-01-26 02:15:00,226 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-01-26 02:15:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:15:00,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjunts are in the unsatisfiable core [2024-01-26 02:15:00,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:15:00,892 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 15 treesize of output 7 [2024-01-26 02:15:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:15:00,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:15:01,411 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-01-26 02:15:01,411 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 19 treesize of output 7 [2024-01-26 02:15:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:15:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671401173] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:15:02,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:15:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2024-01-26 02:15:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872031212] [2024-01-26 02:15:02,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:15:02,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-01-26 02:15:02,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:15:02,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-01-26 02:15:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-01-26 02:15:02,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:02,087 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:15:02,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.38888888888889) internal successors, (410), 36 states have internal predecessors, (410), 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-01-26 02:15:02,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:02,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:15:02,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:15:02,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:15:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:15:03,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:15:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:15:03,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-26 02:15:03,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:15:03,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:15:03,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:15:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1397497140, now seen corresponding path program 2 times [2024-01-26 02:15:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:15:03,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498877516] [2024-01-26 02:15:03,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:15:03,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:15:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:15:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-01-26 02:15:05,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:15:05,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498877516] [2024-01-26 02:15:05,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498877516] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:15:05,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000741249] [2024-01-26 02:15:05,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-26 02:15:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:15:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:15:05,154 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-01-26 02:15:05,168 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-01-26 02:15:05,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-26 02:15:05,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:15:05,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjunts are in the unsatisfiable core [2024-01-26 02:15:05,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:15:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 02:15:05,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:15:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-01-26 02:15:06,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000741249] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:15:06,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:15:06,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2024-01-26 02:15:06,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502622395] [2024-01-26 02:15:06,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:15:06,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-01-26 02:15:06,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:15:06,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-01-26 02:15:06,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2024-01-26 02:15:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:06,542 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:15:06,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.366666666666667) internal successors, (251), 30 states have internal predecessors, (251), 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-01-26 02:15:06,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:06,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:15:06,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:15:06,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:15:06,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:15:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:15:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:15:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:15:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 02:15:09,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-26 02:15:09,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:15:09,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:15:09,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:15:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash -247977222, now seen corresponding path program 3 times [2024-01-26 02:15:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:15:09,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200834007] [2024-01-26 02:15:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:15:09,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:15:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:15:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-01-26 02:15:09,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:15:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200834007] [2024-01-26 02:15:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200834007] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:15:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133122131] [2024-01-26 02:15:09,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-26 02:15:09,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:15:09,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:15:09,991 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-01-26 02:15:10,029 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-01-26 02:15:10,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-01-26 02:15:10,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:15:10,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 30 conjunts are in the unsatisfiable core [2024-01-26 02:15:10,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:15:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-01-26 02:15:10,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:15:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 118 refuted. 5 times theorem prover too weak. 40 trivial. 0 not checked. [2024-01-26 02:15:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133122131] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:15:23,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:15:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 32 [2024-01-26 02:15:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546065665] [2024-01-26 02:15:23,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:15:23,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-01-26 02:15:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:15:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-01-26 02:15:23,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=889, Unknown=5, NotChecked=0, Total=992 [2024-01-26 02:15:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:23,661 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:15:23,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.96875) internal successors, (287), 32 states have internal predecessors, (287), 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-01-26 02:15:23,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:15:23,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:15:23,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:15:23,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:15:23,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-01-26 02:15:23,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:15:27,362 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 3) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 3) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 3) .cse2)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 3) .cse3)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 3) .cse4)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 3) .cse5)))) (let ((.cse6 (* 3 c_~n~0))) (<= (+ (* (div .cse6 4294967296) 4294967296) 4) .cse6))) is different from false [2024-01-26 02:15:29,374 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 3) .cse0)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 3) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 3) .cse2)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ (* (div .cse3 4294967296) 4294967296) 4) .cse3))) is different from false [2024-01-26 02:16:05,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:07,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:09,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:11,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:13,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:16,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:36,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:38,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:40,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:42,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:44,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:46,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:48,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:50,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:52,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:54,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:56,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:16:59,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:01,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:03,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:06,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:09,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:11,069 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 3) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 3) .cse1)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ (* (div .cse2 4294967296) 4294967296) 4) .cse2))) is different from false [2024-01-26 02:17:15,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:17,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:19,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:21,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:23,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:25,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:27,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:17:29,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:05,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:07,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:32,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:34,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:47,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:49,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:51,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:53,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:55,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:57,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:18:59,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:01,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:03,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:06,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:08,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:10,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:12,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:14,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:17,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:19,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:21,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:23,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:26,078 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 [1] [2024-01-26 02:19:39,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:41,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:43,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:46,183 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 [1] [2024-01-26 02:19:48,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:50,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:52,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:19:54,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:07,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:09,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:20,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:38,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:41,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:43,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:45,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:46,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:48,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:51,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:52,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:55,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:20:57,263 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 [1] [2024-01-26 02:20:59,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:21:02,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:21:04,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:21:06,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:21:08,540 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 3) .cse0)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 1) (= |c_thread2Thread1of1ForFork1_#t~post6#1| 1) (let ((.cse1 (* 3 c_~n~0))) (<= (+ (* (div .cse1 4294967296) 4294967296) 4) .cse1))) is different from false [2024-01-26 02:21:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:21:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:21:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:21:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:21:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 02:21:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-01-26 02:21:08,576 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-01-26 02:21:08,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-26 02:21:08,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:21:08,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:21:08,764 INFO L85 PathProgramCache]: Analyzing trace with hash 345697801, now seen corresponding path program 4 times [2024-01-26 02:21:08,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:21:08,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241054476] [2024-01-26 02:21:08,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:21:08,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:21:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:25:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:25:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:25:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241054476] [2024-01-26 02:25:36,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241054476] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:25:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686857872] [2024-01-26 02:25:36,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-26 02:25:36,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:25:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:25:36,724 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-01-26 02:25:36,727 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-01-26 02:25:36,926 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-26 02:25:36,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:25:36,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 136 conjunts are in the unsatisfiable core [2024-01-26 02:25:36,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:25:51,702 INFO L349 Elim1Store]: treesize reduction 40, result has 66.9 percent of original size [2024-01-26 02:25:51,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 185 treesize of output 140 [2024-01-26 02:25:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:25:52,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:26:32,379 INFO L349 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2024-01-26 02:26:32,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 660 treesize of output 742 [2024-01-26 02:26:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 0 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-26 02:26:46,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686857872] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:26:46,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:26:46,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 68, 73] total 204 [2024-01-26 02:26:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468320332] [2024-01-26 02:26:46,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:26:46,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 204 states [2024-01-26 02:26:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:26:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2024-01-26 02:26:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1678, Invalid=39734, Unknown=0, NotChecked=0, Total=41412 [2024-01-26 02:26:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:26:46,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:26:46,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 204 states, 204 states have (on average 3.799019607843137) internal successors, (775), 204 states have internal predecessors, (775), 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-01-26 02:26:46,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:26:46,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:26:46,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:26:46,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:26:46,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-01-26 02:26:46,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-01-26 02:26:46,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:27:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:27:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:27:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:27:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:27:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-01-26 02:27:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-01-26 02:27:40,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-01-26 02:27:40,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-26 02:27:40,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:27:40,320 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-26 02:27:40,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-26 02:27:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1807230097, now seen corresponding path program 5 times [2024-01-26 02:27:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-26 02:27:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634680121] [2024-01-26 02:27:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-26 02:27:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-26 02:27:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-26 02:27:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-01-26 02:27:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-26 02:27:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634680121] [2024-01-26 02:27:41,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634680121] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-26 02:27:41,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513240891] [2024-01-26 02:27:41,237 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-26 02:27:41,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-26 02:27:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-26 02:27:41,241 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-01-26 02:27:41,242 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-01-26 02:27:41,549 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-01-26 02:27:41,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-26 02:27:41,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 56 conjunts are in the unsatisfiable core [2024-01-26 02:27:41,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-26 02:27:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-01-26 02:27:42,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-26 02:28:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 0 proven. 313 refuted. 6 times theorem prover too weak. 85 trivial. 0 not checked. [2024-01-26 02:28:05,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513240891] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-26 02:28:05,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-26 02:28:05,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 29] total 57 [2024-01-26 02:28:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510195641] [2024-01-26 02:28:05,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-26 02:28:05,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-01-26 02:28:05,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-26 02:28:05,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-01-26 02:28:05,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2962, Unknown=9, NotChecked=0, Total=3192 [2024-01-26 02:28:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:28:05,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-26 02:28:05,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 7.859649122807017) internal successors, (448), 57 states have internal predecessors, (448), 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-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-01-26 02:28:05,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-26 02:28:21,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:23,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:25,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:27,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:29,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:31,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:33,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:35,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:37,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:39,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:41,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:43,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:45,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:47,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:49,760 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (let ((.cse0 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3))) (forall ((v_z_3 Int)) (or (let ((.cse1 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse2 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3))) (forall ((v_z_3 Int)) (or (let ((.cse3 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse4 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse5 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse5 4294967296) 4294967296)) .cse5)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3))) (forall ((v_z_3 Int)) (or (let ((.cse6 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse6 4294967296) 4294967296)) .cse6)) (< v_z_3 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (< 4294967295 v_z_3))) (forall ((v_z_3 Int)) (or (let ((.cse7 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse7 4294967296) 4294967296)) .cse7)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse8 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse8 4294967296) 4294967296)) .cse8)) (forall ((v_z_3 Int)) (or (let ((.cse9 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse9 4294967296) 4294967296)) .cse9)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse10 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse10 4294967296) 4294967296)) .cse10)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse11 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse11 4294967296) 4294967296)) .cse11)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse12 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse12 4294967296) 4294967296)) .cse12)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-01-26 02:28:51,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:54,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:56,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-26 02:28:58,500 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (let ((.cse0 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3))) (forall ((v_z_3 Int)) (or (let ((.cse1 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse2 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3))) (forall ((v_z_3 Int)) (or (let ((.cse3 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4)) (forall ((v_z_3 Int)) (or (let ((.cse5 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse5 4294967296) 4294967296)) .cse5)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (let ((.cse6 (* 8589934593 v_z_3))) (< (+ 6 (* (div .cse6 4294967296) 4294967296)) .cse6)) (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false Received shutdown request... [2024-01-26 02:29:02,406 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 02:29:02,407 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 02:29:02,417 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-26 02:29:02,669 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-01-26 02:29:02,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-01-26 02:29:02,861 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 98 known predicates. [2024-01-26 02:29:02,863 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-26 02:29:02,870 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2024-01-26 02:29:02,871 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-01-26 02:29:02,883 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-26 02:29:02,883 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-26 02:29:02,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 02:29:02 BasicIcfg [2024-01-26 02:29:02,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-26 02:29:02,887 INFO L158 Benchmark]: Toolchain (without parser) took 846533.09ms. Allocated memory was 216.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 152.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2024-01-26 02:29:02,888 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-26 02:29:02,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.13ms. Allocated memory is still 216.0MB. Free memory was 152.4MB in the beginning and 140.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-01-26 02:29:02,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.77ms. Allocated memory is still 216.0MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-26 02:29:02,888 INFO L158 Benchmark]: Boogie Preprocessor took 27.87ms. Allocated memory is still 216.0MB. Free memory was 138.4MB in the beginning and 136.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-01-26 02:29:02,888 INFO L158 Benchmark]: RCFGBuilder took 343.98ms. Allocated memory is still 216.0MB. Free memory was 136.6MB in the beginning and 119.2MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-01-26 02:29:02,888 INFO L158 Benchmark]: TraceAbstraction took 845944.70ms. Allocated memory was 216.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 118.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2024-01-26 02:29:02,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 216.0MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.13ms. Allocated memory is still 216.0MB. Free memory was 152.4MB in the beginning and 140.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.77ms. Allocated memory is still 216.0MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.87ms. Allocated memory is still 216.0MB. Free memory was 138.4MB in the beginning and 136.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 343.98ms. Allocated memory is still 216.0MB. Free memory was 136.6MB in the beginning and 119.2MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 845944.70ms. Allocated memory was 216.0MB in the beginning and 3.4GB in the end (delta: 3.2GB). Free memory was 118.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6299, independent: 5736, independent conditional: 5736, independent unconditional: 0, dependent: 563, dependent conditional: 563, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 5736, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 5736, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 0, independent unconditional: 5736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 0, independent unconditional: 5736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 0, independent unconditional: 5736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 0, independent unconditional: 5736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5736, independent: 5736, independent conditional: 0, independent unconditional: 5736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 5736, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5736, unknown conditional: 0, unknown unconditional: 5736] , Statistics on independence cache: Total cache size (in pairs): 5736, Positive cache size: 5736, Positive conditional cache size: 0, Positive unconditional cache size: 5736, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 563 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 21, RedundantProofs: 4, ProvenStates: 683, Times there's more than one choice: 562, Avg number of choices: 4.584187408491947 - StatisticsResult: Reduction benchmarks 8.7s Time before loop, 45.1s Time in loop, 53.9s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base, ULTIMATE.start_create_fresh_int_array_~i~2#1, write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, thread1_#res#1.base, thread2_#res#1.base, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_#t~mem17#1, thread2Thread1of1ForFork1_~_argptr#1.base, thread1_#t~mem1#1, thread2_#t~mem3#1, thread2_#t~mem5#1, thread2_#t~mem7#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet9#1, thread2Thread1of1ForFork1_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~size~0, old(~size~0), ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork0_#t~mem1#1, read~int_#ptr.base, ULTIMATE.start_#t~ret21#1, ~f~0.base, old(~f~0.base), ULTIMATE.start_create_fresh_int_array_#in~size#1, thread1_#res#1.offset, thread2_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, thread1Thread1of1ForFork0_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork1_~_argptr#1.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~x1~0, old(~x1~0), ~x2~0, old(~x2~0), thread1_#t~post2#1, thread2_#t~post4#1, thread2_#t~post6#1, thread2_#t~post8#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~pre14#1, #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork1_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, write~init~int_#ptr.offset, ULTIMATE.dealloc_~addr.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~post2#1, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.offset, #Ultimate.allocOnHeap_#res.base, ~n~0, old(~n~0), thread2Thread1of1ForFork1_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread2Thread1of1ForFork1_thidvar0, old(thread2Thread1of1ForFork1_thidvar0), thread2Thread1of1ForFork1_thidvar1, old(thread2Thread1of1ForFork1_thidvar1), thread2Thread1of1ForFork1_thidvar2, old(thread2Thread1of1ForFork1_thidvar2), thread1Thread1of1ForFork0_#in~_argptr#1.offset, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret11#1.base, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~nondet15#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_main_~#t1~0#1.base, #length, old(#length), thread1Thread1of1ForFork0_#in~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, ULTIMATE.start_create_fresh_int_array_#t~post19#1, thread2Thread1of1ForFork1_~i~1#1, #StackHeapBarrier, old(#StackHeapBarrier), thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_thidvar0, old(thread1Thread1of1ForFork0_thidvar0), thread1Thread1of1ForFork0_thidvar1, old(thread1Thread1of1ForFork0_thidvar1), thread1_~i~0#1, thread2_~i~1#1, write~int_#ptr.offset, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), ULTIMATE.start_main_#t~ret11#1.offset, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork1_#res#1.base, ~f~0.offset, old(~f~0.offset), thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, read~int_#ptr.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset], Protected Variables before encountering a loop: [] - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 98 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 239 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 845.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 461.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 380.3s InterpolantComputationTime, 2717 NumberOfCodeBlocks, 2696 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3952 ConstructedInterpolants, 158 QuantifiedInterpolants, 130137 SizeOfPredicates, 151 NumberOfNonLiveVariables, 2333 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 20 InterpolantComputations, 3 PerfectInterpolantSequences, 455/2647 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown