/usr/bin/java -Xmx7000000000 -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-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-e2ee32c-m [2023-09-07 07:43:46,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-09-07 07:43:46,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2023-09-07 07:43:46,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-09-07 07:43:46,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-09-07 07:43:46,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-09-07 07:43:46,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-07 07:43:46,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-07 07:43:46,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-07 07:43:46,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-07 07:43:46,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-07 07:43:46,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-07 07:43:46,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-09-07 07:43:46,782 INFO L153 SettingsManager]: * Use SBE=true [2023-09-07 07:43:46,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-07 07:43:46,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-07 07:43:46,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-09-07 07:43:46,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-07 07:43:46,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-09-07 07:43:46,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-09-07 07:43:46,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-07 07:43:46,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-07 07:43:46,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-07 07:43:46,784 INFO L153 SettingsManager]: * sizeof long double=12 [2023-09-07 07:43:46,785 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-09-07 07:43:46,785 INFO L153 SettingsManager]: * Use constant arrays=true [2023-09-07 07:43:46,785 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-07 07:43:46,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-07 07:43:46,785 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-09-07 07:43:46,785 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-07 07:43:46,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 07:43:46,786 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-07 07:43:46,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-07 07:43:46,787 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2023-09-07 07:43:46,787 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/UAutomizer-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 [2023-09-07 07:43:46,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-07 07:43:46,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-07 07:43:46,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-07 07:43:46,992 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-07 07:43:46,992 INFO L274 PluginConnector]: CDTParser initialized [2023-09-07 07:43:46,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-09-07 07:43:48,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-07 07:43:48,221 INFO L384 CDTParser]: Found 1 translation units. [2023-09-07 07:43:48,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2023-09-07 07:43:48,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96153d931/1650d00f422641e99e3ac0fb092f2722/FLAGc78daa568 [2023-09-07 07:43:48,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96153d931/1650d00f422641e99e3ac0fb092f2722 [2023-09-07 07:43:48,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-07 07:43:48,249 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-07 07:43:48,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-07 07:43:48,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-07 07:43:48,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-07 07:43:48,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7b1bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48, skipping insertion in model container [2023-09-07 07:43:48,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,276 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-09-07 07:43:48,419 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2023-09-07 07:43:48,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 07:43:48,442 INFO L202 MainTranslator]: Completed pre-run [2023-09-07 07:43:48,471 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2023-09-07 07:43:48,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-07 07:43:48,483 INFO L206 MainTranslator]: Completed translation [2023-09-07 07:43:48,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48 WrapperNode [2023-09-07 07:43:48,484 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-07 07:43:48,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-07 07:43:48,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-07 07:43:48,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-07 07:43:48,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,522 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 168 [2023-09-07 07:43:48,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-07 07:43:48,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-07 07:43:48,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-07 07:43:48,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-07 07:43:48,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-07 07:43:48,548 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-07 07:43:48,548 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-07 07:43:48,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-07 07:43:48,549 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (1/1) ... [2023-09-07 07:43:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-07 07:43:48,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:43:48,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-07 07:43:48,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-07 07:43:48,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-07 07:43:48,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-07 07:43:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-07 07:43:48,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-07 07:43:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-07 07:43:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-07 07:43:48,615 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-07 07:43:48,697 INFO L236 CfgBuilder]: Building ICFG [2023-09-07 07:43:48,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-07 07:43:48,903 INFO L277 CfgBuilder]: Performing block encoding [2023-09-07 07:43:48,908 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-07 07:43:48,908 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-07 07:43:48,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:43:48 BoogieIcfgContainer [2023-09-07 07:43:48,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-07 07:43:48,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-07 07:43:48,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-09-07 07:43:48,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-09-07 07:43:48,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:43:48" (1/3) ... [2023-09-07 07:43:48,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df03d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:43:48, skipping insertion in model container [2023-09-07 07:43:48,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:43:48" (2/3) ... [2023-09-07 07:43:48,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df03d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:43:48, skipping insertion in model container [2023-09-07 07:43:48,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:43:48" (3/3) ... [2023-09-07 07:43:48,915 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2023-09-07 07:43:48,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-07 07:43:48,926 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-07 07:43:48,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-07 07:43:48,926 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-07 07:43:48,984 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-07 07:43:49,012 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 07:43:49,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-09-07 07:43:49,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:43:49,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-09-07 07:43:49,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-09-07 07:43:49,068 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-09-07 07:43:49,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-09-07 07:43:49,078 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;@1c85e007, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-09-07 07:43:49,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2023-09-07 07:43:49,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:43:49,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:43:49,609 INFO L85 PathProgramCache]: Analyzing trace with hash -273867549, now seen corresponding path program 1 times [2023-09-07 07:43:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:43:49,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585716077] [2023-09-07 07:43:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:43:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:43:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:43:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:43:49,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585716077] [2023-09-07 07:43:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585716077] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 07:43:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 07:43:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-07 07:43:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253610543] [2023-09-07 07:43:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 07:43:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-07 07:43:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:43:49,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-07 07:43:49,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-07 07:43:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:49,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:43:49,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:43:49,823 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 [2023-09-07 07:43:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:50,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-07 07:43:50,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:43:50,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:43:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1285799325, now seen corresponding path program 1 times [2023-09-07 07:43:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:43:50,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86951307] [2023-09-07 07:43:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:43:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:43:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-07 07:43:50,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:43:50,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86951307] [2023-09-07 07:43:50,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86951307] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-07 07:43:50,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-07 07:43:50,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-07 07:43:50,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821867984] [2023-09-07 07:43:50,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 07:43:50,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-07 07:43:50,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:43:50,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-07 07:43:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-09-07 07:43:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:50,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:43:50,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:43:50,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:50,403 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 [2023-09-07 07:43:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:43:50,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-07 07:43:50,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:43:50,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:43:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash -157423955, now seen corresponding path program 1 times [2023-09-07 07:43:50,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:43:50,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456491773] [2023-09-07 07:43:50,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:43:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:43:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-07 07:43:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:43:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456491773] [2023-09-07 07:43:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456491773] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:43:50,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715284657] [2023-09-07 07:43:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:50,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:43:50,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:43:50,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:43:50,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-07 07:43:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:43:51,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-07 07:43:51,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:43:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-07 07:43:51,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:43:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-07 07:43:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715284657] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-07 07:43:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-07 07:43:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-09-07 07:43:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142548972] [2023-09-07 07:43:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-07 07:43:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-07 07:43:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:43:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-07 07:43:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-09-07 07:43:51,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:51,148 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:43:51,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:43:51,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:51,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:43:51,149 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 [2023-09-07 07:43:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:43:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:43:51,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-07 07:43:51,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-09-07 07:43:51,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:43:51,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:43:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1220763063, now seen corresponding path program 1 times [2023-09-07 07:43:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:43:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256918316] [2023-09-07 07:43:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:43:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:43:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-07 07:43:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:43:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256918316] [2023-09-07 07:43:52,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256918316] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:43:52,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661813398] [2023-09-07 07:43:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:52,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:43:52,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:43:52,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:43:52,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-07 07:43:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:43:52,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 33 conjunts are in the unsatisfiable core [2023-09-07 07:43:52,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:43:52,876 INFO L351 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 [2023-09-07 07:43:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:43:52,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:43:53,487 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-09-07 07:43:53,487 INFO L351 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 [2023-09-07 07:43:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:43:54,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661813398] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:43:54,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:43:54,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2023-09-07 07:43:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271103265] [2023-09-07 07:43:54,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:43:54,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-09-07 07:43:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:43:54,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-09-07 07:43:54,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2023-09-07 07:43:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:54,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:43:54,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 12.027777777777779) internal successors, (433), 36 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:43:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:43:54,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:43:54,114 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 [2023-09-07 07:43:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:43:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:43:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:43:56,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-07 07:43:56,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-07 07:43:56,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:43:56,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:43:56,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:43:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1781422501, now seen corresponding path program 2 times [2023-09-07 07:43:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:43:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181441613] [2023-09-07 07:43:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:43:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:43:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:44:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-09-07 07:44:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:44:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181441613] [2023-09-07 07:44:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181441613] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:44:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098134534] [2023-09-07 07:44:01,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-07 07:44:01,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:44:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:44:01,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:44:01,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-07 07:44:01,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-07 07:44:01,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 07:44:01,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 18 conjunts are in the unsatisfiable core [2023-09-07 07:44:01,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:44:05,347 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-09-07 07:44:05,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:44:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-09-07 07:44:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098134534] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:44:13,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:44:13,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2023-09-07 07:44:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814701224] [2023-09-07 07:44:13,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:44:13,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-09-07 07:44:13,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:44:13,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-09-07 07:44:13,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=580, Unknown=6, NotChecked=0, Total=756 [2023-09-07 07:44:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:44:13,989 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:44:13,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.785714285714286) internal successors, (246), 28 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:44:13,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:44:13,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:44:13,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:44:13,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-07 07:44:13,989 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 [2023-09-07 07:44:16,780 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 [] [2023-09-07 07:44:19,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-07 07:44:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:44:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:44:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:44:27,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-07 07:44:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-07 07:44:27,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-09-07 07:44:27,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:44:27,965 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:44:27,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:44:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash -462758781, now seen corresponding path program 3 times [2023-09-07 07:44:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:44:27,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052217511] [2023-09-07 07:44:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:44:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:44:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:45:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:45:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:45:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052217511] [2023-09-07 07:45:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052217511] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:45:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582064076] [2023-09-07 07:45:15,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-07 07:45:15,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:45:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:45:15,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:45:15,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-07 07:45:15,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-09-07 07:45:15,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 07:45:15,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 83 conjunts are in the unsatisfiable core [2023-09-07 07:45:15,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:45:16,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-09-07 07:45:17,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 07:45:17,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-07 07:45:19,337 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:45:19,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 107 [2023-09-07 07:45:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:45:19,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:45:22,425 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-07 07:45:22,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 156 [2023-09-07 07:45:23,188 INFO L322 Elim1Store]: treesize reduction 5, result has 98.8 percent of original size [2023-09-07 07:45:23,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 614 treesize of output 937 [2023-09-07 07:45:23,888 INFO L322 Elim1Store]: treesize reduction 28, result has 93.4 percent of original size [2023-09-07 07:45:23,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 136 treesize of output 476 [2023-09-07 07:45:26,808 INFO L322 Elim1Store]: treesize reduction 8, result has 98.1 percent of original size [2023-09-07 07:45:26,809 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 81 treesize of output 502 [2023-09-07 07:46:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-09-07 07:46:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582064076] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:46:26,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:46:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 40, 31] total 122 [2023-09-07 07:46:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810986343] [2023-09-07 07:46:26,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:46:26,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2023-09-07 07:46:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:46:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2023-09-07 07:46:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=676, Invalid=14034, Unknown=52, NotChecked=0, Total=14762 [2023-09-07 07:46:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:46:26,661 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:46:26,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.008196721311475) internal successors, (611), 122 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:46:26,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:46:26,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:46:26,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:46:26,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-07 07:46:26,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-09-07 07:46:26,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 [2023-09-07 07:46:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:46:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:46:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:46:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-09-07 07:46:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-09-07 07:46:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-09-07 07:46:37,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-07 07:46:37,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:46:37,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-09-07 07:46:37,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-07 07:46:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1304724257, now seen corresponding path program 4 times [2023-09-07 07:46:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-07 07:46:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827743414] [2023-09-07 07:46:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-07 07:46:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-07 07:46:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-07 07:46:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-09-07 07:46:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-07 07:46:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827743414] [2023-09-07 07:46:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827743414] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-07 07:46:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338056765] [2023-09-07 07:46:38,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-09-07 07:46:38,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:46:38,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-07 07:46:38,754 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-07 07:46:38,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-07 07:46:38,934 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-09-07 07:46:38,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-07 07:46:38,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 68 conjunts are in the unsatisfiable core [2023-09-07 07:46:38,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-07 07:46:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-07 07:46:39,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-09-07 07:48:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 149 refuted. 38 times theorem prover too weak. 85 trivial. 0 not checked. [2023-09-07 07:48:02,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338056765] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-07 07:48:02,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-07 07:48:02,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35, 25] total 58 [2023-09-07 07:48:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841537895] [2023-09-07 07:48:02,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-07 07:48:02,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-09-07 07:48:02,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-07 07:48:02,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-09-07 07:48:02,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3085, Unknown=34, NotChecked=0, Total=3306 [2023-09-07 07:48:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:48:02,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-09-07 07:48:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 6.775862068965517) internal successors, (393), 58 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-07 07:48:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-09-07 07:48:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-09-07 07:48:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-09-07 07:48:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-09-07 07:48:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-09-07 07:48:02,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-09-07 07:48:02,581 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 [2023-09-07 07:50:02,836 WARN L234 SmtUtils]: Spent 31.84s on a formula simplification. DAG size of input: 61 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:50:04,839 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] [2023-09-07 07:50:06,848 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] [2023-09-07 07:50:08,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] [2023-09-07 07:50:10,886 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] [2023-09-07 07:50:12,904 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] [2023-09-07 07:50:14,912 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] [2023-09-07 07:50:16,921 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] [2023-09-07 07:50:18,935 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] [2023-09-07 07:50:20,952 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] [2023-09-07 07:50:22,960 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] [2023-09-07 07:50:24,967 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] [2023-09-07 07:50:26,976 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] [2023-09-07 07:50:28,990 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] [2023-09-07 07:50:31,017 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] [2023-09-07 07:50:33,028 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] [2023-09-07 07:50:35,036 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] [2023-09-07 07:50:37,052 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] [2023-09-07 07:50:39,067 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] [2023-09-07 07:50:41,079 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] [2023-09-07 07:50:43,102 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] [2023-09-07 07:50:45,110 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] [2023-09-07 07:50:47,124 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] [2023-09-07 07:50:49,135 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] [2023-09-07 07:50:51,145 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] [2023-09-07 07:50:53,263 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] [2023-09-07 07:50:55,272 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] [2023-09-07 07:50:57,301 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] [2023-09-07 07:50:59,311 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] [2023-09-07 07:51:01,334 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] [2023-09-07 07:51:03,342 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] [2023-09-07 07:51:05,352 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] [2023-09-07 07:51:07,363 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] [2023-09-07 07:51:09,375 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] [2023-09-07 07:51:11,382 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] [2023-09-07 07:51:13,389 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] [2023-09-07 07:51:15,418 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] [2023-09-07 07:51:17,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-07 07:51:19,487 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] [2023-09-07 07:51:21,499 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] [2023-09-07 07:51:23,506 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] [2023-09-07 07:51:25,515 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] [2023-09-07 07:51:27,519 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] [2023-09-07 07:51:29,551 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] [2023-09-07 07:51:31,568 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] [2023-09-07 07:51:33,582 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse4 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse5 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse5 4294967296) 4294967296)) .cse5)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse6 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse6 4294967296) 4294967296)) .cse6)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse7 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse7 4294967296) 4294967296)) .cse7)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse8 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse8 4294967296) 4294967296)) .cse8)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse9 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse9 4294967296) 4294967296)) .cse9)))) (let ((.cse10 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse10 4294967296) 4294967296)) .cse10))) is different from false [2023-09-07 07:51:35,588 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] [2023-09-07 07:51:37,594 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] [2023-09-07 07:51:39,605 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] [2023-09-07 07:51:41,615 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] [2023-09-07 07:51:43,622 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] [2023-09-07 07:51:45,631 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] [2023-09-07 07:51:47,637 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] [2023-09-07 07:51:49,644 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] [2023-09-07 07:51:51,651 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] [2023-09-07 07:51:53,662 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] [2023-09-07 07:51:55,673 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] [2023-09-07 07:51:57,681 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] [2023-09-07 07:51:59,696 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] [2023-09-07 07:52:01,731 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] [2023-09-07 07:52:03,745 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] [2023-09-07 07:52:05,761 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] [2023-09-07 07:52:07,770 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] [2023-09-07 07:52:09,777 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] [2023-09-07 07:52:11,782 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] [2023-09-07 07:52:13,788 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] [2023-09-07 07:52:16,186 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] [2023-09-07 07:52:18,194 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] [2023-09-07 07:52:20,338 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] [2023-09-07 07:52:22,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-07 07:52:24,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-07 07:52:26,467 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] [2023-09-07 07:52:28,473 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] [2023-09-07 07:52:30,480 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] [2023-09-07 07:52:32,509 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* 5 c_~n~0))) (let ((.cse2 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (.cse4 (+ 6 (* (div .cse5 4294967296) 4294967296)))) (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (= 5 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (<= .cse2 0) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (<= .cse4 (+ .cse5 (* .cse2 4294967296))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse6 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse6 4294967296) 4294967296)) .cse6)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse7 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse7 4294967296) 4294967296)) .cse7)))) (<= .cse4 .cse5)))) is different from false [2023-09-07 07:52:34,523 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse4 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)))) (let ((.cse5 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse5 4294967296) 4294967296)) .cse5))) is different from false [2023-09-07 07:52:36,550 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-07 07:52:38,599 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-07 07:52:40,610 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)))) (let ((.cse4 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2023-09-07 07:54:34,768 WARN L234 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-07 07:54:36,770 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] [2023-09-07 07:54:38,793 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] [2023-09-07 07:54:40,800 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] [2023-09-07 07:54:42,809 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] [2023-09-07 07:54:44,822 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2023-09-07 07:54:46,826 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] [2023-09-07 07:54:48,834 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] [2023-09-07 07:54:50,841 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] [2023-09-07 07:54:52,852 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] [2023-09-07 07:54:54,860 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] [2023-09-07 07:54:56,870 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] [2023-09-07 07:54:58,880 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] [2023-09-07 07:55:00,884 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] [2023-09-07 07:55:03,025 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] [2023-09-07 07:55:05,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-07 07:55:07,106 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] [2023-09-07 07:55:09,117 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] [2023-09-07 07:55:11,132 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] [2023-09-07 07:55:13,141 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] [2023-09-07 07:55:15,160 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] [2023-09-07 07:55:17,180 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] [2023-09-07 07:55:19,186 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] [2023-09-07 07:55:21,195 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] [2023-09-07 07:55:23,202 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] [2023-09-07 07:55:25,232 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] [2023-09-07 07:55:27,253 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] [2023-09-07 07:55:29,264 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] [2023-09-07 07:55:31,270 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] [2023-09-07 07:55:42,055 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] [2023-09-07 07:55:44,066 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] [2023-09-07 07:55:46,079 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] [2023-09-07 07:55:48,095 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] [2023-09-07 07:55:50,108 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] [2023-09-07 07:55:52,117 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] [2023-09-07 07:55:54,128 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] [2023-09-07 07:55:56,144 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] [2023-09-07 07:55:58,155 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] [2023-09-07 07:56:00,166 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] [2023-09-07 07:56:02,172 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] [2023-09-07 07:56:04,200 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] [2023-09-07 07:56:06,215 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] [2023-09-07 07:56:08,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] [2023-09-07 07:56:10,231 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] [2023-09-07 07:56:12,238 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] [2023-09-07 07:56:14,249 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] [2023-09-07 07:56:16,694 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] [2023-09-07 07:56:18,711 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] [2023-09-07 07:56:20,718 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] [2023-09-07 07:56:21,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-09-07 07:56:23,977 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] [2023-09-07 07:56:25,983 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] [2023-09-07 07:56:27,988 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] [2023-09-07 07:56:30,008 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse3 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse3 4294967296) 4294967296)) .cse3)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse4 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse4 4294967296) 4294967296)) .cse4)) (< v_z_3 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse5 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse5 4294967296) 4294967296)) .cse5)))) (let ((.cse6 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse6 4294967296) 4294967296)) .cse6))) is different from false [2023-09-07 07:56:32,019 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse0 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse0 4294967296) 4294967296)) .cse0)) (< v_z_3 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< 4294967295 v_z_3) (let ((.cse1 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse1 4294967296) 4294967296)) .cse1)) (< v_z_3 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_3 Int)) (or (< v_z_3 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)) (< 4294967295 v_z_3) (let ((.cse2 (* v_z_3 17179869185))) (< (+ 5 (* (div .cse2 4294967296) 4294967296)) .cse2)))) (let ((.cse3 (* 5 c_~n~0))) (<= (+ 6 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false Received shutdown request... [2023-09-07 07:58:08,065 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 07:58:08,065 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-09-07 07:58:08,078 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2023-09-07 07:58:08,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-07 07:58:08,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-07 07:58:08,892 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 122 known predicates. [2023-09-07 07:58:08,894 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-09-07 07:58:08,901 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-09-07 07:58:08,902 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2023-09-07 07:58:08,903 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-07 07:58:08,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-07 07:58:08,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 07:58:08 BasicIcfg [2023-09-07 07:58:08,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-07 07:58:08,905 INFO L158 Benchmark]: Toolchain (without parser) took 860656.13ms. Allocated memory was 225.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 187.9MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 213.8MB. Max. memory is 7.0GB. [2023-09-07 07:58:08,905 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 164.6MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 7.0GB. [2023-09-07 07:58:08,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.69ms. Allocated memory is still 225.4MB. Free memory was 187.7MB in the beginning and 175.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 7.0GB. [2023-09-07 07:58:08,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.63ms. Allocated memory is still 225.4MB. Free memory was 175.6MB in the beginning and 173.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. [2023-09-07 07:58:08,906 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 225.4MB. Free memory was 173.5MB in the beginning and 172.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. [2023-09-07 07:58:08,906 INFO L158 Benchmark]: RCFGBuilder took 361.51ms. Allocated memory is still 225.4MB. Free memory was 172.0MB in the beginning and 153.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 7.0GB. [2023-09-07 07:58:08,906 INFO L158 Benchmark]: TraceAbstraction took 859993.31ms. Allocated memory was 225.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 153.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 179.2MB. Max. memory is 7.0GB. [2023-09-07 07:58:08,907 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.09ms. Allocated memory is still 164.6MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 7.0GB. * CACSL2BoogieTranslator took 235.69ms. Allocated memory is still 225.4MB. Free memory was 187.7MB in the beginning and 175.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 7.0GB. * Boogie Procedure Inliner took 35.63ms. Allocated memory is still 225.4MB. Free memory was 175.6MB in the beginning and 173.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 7.0GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 225.4MB. Free memory was 173.5MB in the beginning and 172.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB. * RCFGBuilder took 361.51ms. Allocated memory is still 225.4MB. Free memory was 172.0MB in the beginning and 153.6MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 7.0GB. * TraceAbstraction took 859993.31ms. Allocated memory was 225.4MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 153.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 179.2MB. Max. memory is 7.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6596, independent: 6016, independent conditional: 6016, independent unconditional: 0, dependent: 580, dependent conditional: 580, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6016, independent: 6016, independent conditional: 6016, 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: 6016, independent: 6016, independent conditional: 6016, 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: 6016, independent: 6016, independent conditional: 0, independent unconditional: 6016, 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: 6016, independent: 6016, independent conditional: 0, independent unconditional: 6016, 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: 6016, independent: 6016, independent conditional: 0, independent unconditional: 6016, 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: 6016, independent: 6016, independent conditional: 0, independent unconditional: 6016, 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: 6016, independent: 6016, independent conditional: 0, independent unconditional: 6016, 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: 6016, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6016, unknown conditional: 0, unknown unconditional: 6016] , Statistics on independence cache: Total cache size (in pairs): 6016, Positive cache size: 6016, Positive conditional cache size: 0, Positive unconditional cache size: 6016, 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: 580 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 19, RedundantProofs: 5, ProvenStates: 648 - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 122 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 265 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 859.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 634.3s, 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: 230, 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.5s SatisfiabilityAnalysisTime, 222.4s InterpolantComputationTime, 2061 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2982 ConstructedInterpolants, 142 QuantifiedInterpolants, 61569 SizeOfPredicates, 116 NumberOfNonLiveVariables, 1816 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 277/1417 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