/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-regression/test24-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:15:38,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:15:38,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:15:38,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:15:38,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:15:38,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:15:38,605 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:15:38,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:15:38,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:15:38,609 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:15:38,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:15:38,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:15:38,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:15:38,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:15:38,612 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:15:38,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:15:38,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:15:38,613 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:15:38,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:15:38,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:15:38,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:15:38,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:15:38,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:15:38,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:15:38,615 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:15:38,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:15:38,616 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:15:38,616 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:15:38,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:15:38,616 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:15:38,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:15:38,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:15:38,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:15:38,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:15:38,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:15:38,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:15:38,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:15:38,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:15:38,619 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:15:38,619 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:15:38,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:15:38,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:15:38,619 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:15:38,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:15:38,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:15:38,624 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:15:38,624 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-16 16:15:38,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:15:38,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:15:38,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:15:38,896 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:15:38,897 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:15:38,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24-2.c [2023-12-16 16:15:40,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:15:40,282 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:15:40,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c [2023-12-16 16:15:40,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c962faa3/54043c47f6264ff081dcc8d37408a60f/FLAGc61df4d6c [2023-12-16 16:15:40,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c962faa3/54043c47f6264ff081dcc8d37408a60f [2023-12-16 16:15:40,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:15:40,310 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:15:40,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:15:40,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:15:40,321 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:15:40,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708b8f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40, skipping insertion in model container [2023-12-16 16:15:40,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:15:40,528 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c[807,820] [2023-12-16 16:15:40,532 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:15:40,544 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:15:40,561 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c[807,820] [2023-12-16 16:15:40,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:15:40,576 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:15:40,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40 WrapperNode [2023-12-16 16:15:40,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:15:40,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:15:40,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:15:40,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:15:40,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,604 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2023-12-16 16:15:40,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:15:40,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:15:40,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:15:40,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:15:40,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,627 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2023-12-16 16:15:40,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:15:40,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:15:40,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:15:40,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:15:40,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (1/1) ... [2023-12-16 16:15:40,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:15:40,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:15:40,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:15:40,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:15:40,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:15:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:15:40,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:15:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:15:40,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 16:15:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 16:15:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:15:40,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:15:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:15:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 16:15:40,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 16:15:40,776 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:15:40,779 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:15:40,934 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:15:40,975 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:15:40,976 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:15:40,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:15:40 BoogieIcfgContainer [2023-12-16 16:15:40,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:15:40,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:15:40,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:15:40,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:15:40,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:15:40" (1/3) ... [2023-12-16 16:15:40,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10960a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:15:40, skipping insertion in model container [2023-12-16 16:15:40,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:15:40" (2/3) ... [2023-12-16 16:15:40,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10960a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:15:40, skipping insertion in model container [2023-12-16 16:15:40,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:15:40" (3/3) ... [2023-12-16 16:15:40,983 INFO L112 eAbstractionObserver]: Analyzing ICFG test24-2.c [2023-12-16 16:15:40,994 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:15:40,994 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:15:41,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:15:41,037 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@248b2692, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:15:41,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:15:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 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-12-16 16:15:41,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 16:15:41,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:41,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:41,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:41,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -646137036, now seen corresponding path program 1 times [2023-12-16 16:15:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090321259] [2023-12-16 16:15:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:41,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:41,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:41,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:41,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:15:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:41,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:15:41,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:41,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:41,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:41,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090321259] [2023-12-16 16:15:41,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090321259] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:41,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:41,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:15:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179968495] [2023-12-16 16:15:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:41,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:15:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:41,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:15:41,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:15:41,227 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12-16 16:15:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:41,251 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2023-12-16 16:15:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:15:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2023-12-16 16:15:41,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:41,259 INFO L225 Difference]: With dead ends: 24 [2023-12-16 16:15:41,260 INFO L226 Difference]: Without dead ends: 10 [2023-12-16 16:15:41,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:15:41,268 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:41,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-12-16 16:15:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-12-16 16:15:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-12-16 16:15:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-12-16 16:15:41,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2023-12-16 16:15:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:41,293 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-12-16 16:15:41,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-12-16 16:15:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-12-16 16:15:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:15:41,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:41,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:41,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:41,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:41,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:41,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:41,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1437392194, now seen corresponding path program 1 times [2023-12-16 16:15:41,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:41,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405129413] [2023-12-16 16:15:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:41,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:41,499 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:41,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:15:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:41,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:15:41,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:41,585 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:15:41,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405129413] [2023-12-16 16:15:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405129413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:15:41,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:15:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:15:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515218499] [2023-12-16 16:15:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:15:41,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:15:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:15:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:15:41,589 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-12-16 16:15:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:41,604 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-12-16 16:15:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:15:41,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2023-12-16 16:15:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:41,605 INFO L225 Difference]: With dead ends: 19 [2023-12-16 16:15:41,605 INFO L226 Difference]: Without dead ends: 11 [2023-12-16 16:15:41,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:15:41,607 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:41,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-16 16:15:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-16 16:15:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-12-16 16:15:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-12-16 16:15:41,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2023-12-16 16:15:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:41,612 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-12-16 16:15:41,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-12-16 16:15:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-12-16 16:15:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:15:41,614 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:41,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:41,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:41,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:41,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:41,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1626582093, now seen corresponding path program 1 times [2023-12-16 16:15:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:41,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715840538] [2023-12-16 16:15:41,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:15:41,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:41,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:41,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:41,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:15:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:15:41,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:15:41,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:41,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:41,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:41,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715840538] [2023-12-16 16:15:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715840538] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:41,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:41,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:15:41,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157295646] [2023-12-16 16:15:41,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:41,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:15:41,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:15:41,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:15:41,937 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-12-16 16:15:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:41,988 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2023-12-16 16:15:41,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:15:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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) Word has length 10 [2023-12-16 16:15:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:41,990 INFO L225 Difference]: With dead ends: 22 [2023-12-16 16:15:41,990 INFO L226 Difference]: Without dead ends: 14 [2023-12-16 16:15:41,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:15:41,993 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:41,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:15:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-16 16:15:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-16 16:15:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-12-16 16:15:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-16 16:15:42,002 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2023-12-16 16:15:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:42,003 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-16 16:15:42,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-12-16 16:15:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-16 16:15:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 16:15:42,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:42,004 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:42,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:42,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:42,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:42,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1483589634, now seen corresponding path program 2 times [2023-12-16 16:15:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983014803] [2023-12-16 16:15:42,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:15:42,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:42,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:42,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:42,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:15:42,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:15:42,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:15:42,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:15:42,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:42,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:42,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983014803] [2023-12-16 16:15:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983014803] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:42,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 16:15:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818260966] [2023-12-16 16:15:42,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:42,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:15:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:42,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:15:42,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:15:42,463 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-12-16 16:15:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:42,664 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2023-12-16 16:15:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 16:15:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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) Word has length 13 [2023-12-16 16:15:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:42,665 INFO L225 Difference]: With dead ends: 28 [2023-12-16 16:15:42,666 INFO L226 Difference]: Without dead ends: 20 [2023-12-16 16:15:42,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:15:42,667 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:42,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:15:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-16 16:15:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-16 16:15:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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-12-16 16:15:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-12-16 16:15:42,689 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2023-12-16 16:15:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:42,689 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-12-16 16:15:42,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-12-16 16:15:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-12-16 16:15:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:15:42,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:42,690 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:42,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:42,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:42,891 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:42,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 642634786, now seen corresponding path program 3 times [2023-12-16 16:15:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344563934] [2023-12-16 16:15:42,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:15:42,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:42,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:42,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:15:43,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-16 16:15:43,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:15:43,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:15:43,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:15:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:43,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:15:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:15:43,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:15:43,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344563934] [2023-12-16 16:15:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344563934] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:15:43,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:15:43,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 16:15:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746617691] [2023-12-16 16:15:43,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:15:43,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 16:15:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:15:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 16:15:43,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:15:43,520 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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-12-16 16:15:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:15:44,183 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2023-12-16 16:15:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 16:15:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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) Word has length 19 [2023-12-16 16:15:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:15:44,184 INFO L225 Difference]: With dead ends: 38 [2023-12-16 16:15:44,184 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:15:44,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=651, Unknown=0, NotChecked=0, Total=992 [2023-12-16 16:15:44,185 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:15:44,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:15:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:15:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-16 16:15:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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-12-16 16:15:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-12-16 16:15:44,191 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 19 [2023-12-16 16:15:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:15:44,191 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-12-16 16:15:44,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 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-12-16 16:15:44,192 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-12-16 16:15:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 16:15:44,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:15:44,192 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:15:44,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:44,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:44,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:15:44,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:15:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1160793342, now seen corresponding path program 4 times [2023-12-16 16:15:44,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:15:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219357169] [2023-12-16 16:15:44,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:15:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:15:44,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:15:44,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:15:44,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:15:44,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 16:15:44,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:15:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:15:44,872 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:15:44,872 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:15:44,873 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:15:44,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:15:45,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:15:45,077 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2023-12-16 16:15:45,080 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:15:45,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:15:45 BoogieIcfgContainer [2023-12-16 16:15:45,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:15:45,109 INFO L158 Benchmark]: Toolchain (without parser) took 4799.03ms. Allocated memory is still 336.6MB. Free memory was 281.7MB in the beginning and 222.6MB in the end (delta: 59.1MB). Peak memory consumption was 60.2MB. Max. memory is 8.0GB. [2023-12-16 16:15:45,110 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 200.3MB. Free memory was 146.5MB in the beginning and 146.4MB in the end (delta: 138.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:15:45,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.71ms. Allocated memory is still 336.6MB. Free memory was 281.7MB in the beginning and 270.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:15:45,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.16ms. Allocated memory is still 336.6MB. Free memory was 270.2MB in the beginning and 268.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:45,110 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 336.6MB. Free memory was 268.1MB in the beginning and 266.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:15:45,111 INFO L158 Benchmark]: RCFGBuilder took 335.95ms. Allocated memory is still 336.6MB. Free memory was 266.0MB in the beginning and 251.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 16:15:45,111 INFO L158 Benchmark]: TraceAbstraction took 4131.23ms. Allocated memory is still 336.6MB. Free memory was 250.8MB in the beginning and 222.6MB in the end (delta: 28.2MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2023-12-16 16:15:45,112 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.18ms. Allocated memory is still 200.3MB. Free memory was 146.5MB in the beginning and 146.4MB in the end (delta: 138.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.71ms. Allocated memory is still 336.6MB. Free memory was 281.7MB in the beginning and 270.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.16ms. Allocated memory is still 336.6MB. Free memory was 270.2MB in the beginning and 268.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 336.6MB. Free memory was 268.1MB in the beginning and 266.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 335.95ms. Allocated memory is still 336.6MB. Free memory was 266.0MB in the beginning and 251.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4131.23ms. Allocated memory is still 336.6MB. Free memory was 250.8MB in the beginning and 222.6MB in the end (delta: 28.2MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 39]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] struct dummy ad1[20], *ad2; [L18] int i, j, *pa; [L19] j=0 VAL [ad1={5:0}, j=0] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=1] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=2] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=3] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=4] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=5] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=6] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=7] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=8] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=9] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=10] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=11] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=12] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=13] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=14] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=15] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=16] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=17] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=18] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=19] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() [L21] ad1[j].b = __VERIFIER_nondet_int() [L19] j++ VAL [ad1={5:0}, j=20] [L19] COND FALSE !(j<20) VAL [ad1={5:0}, j=20] [L23] i = __VERIFIER_nondet_int() [L24] COND TRUE i >= 0 && i < 10 [L25] ad2 = ad1 [L26] ad1[i].a = i [L27] pa = &ad1[i].a [L28] EXPR ad2[i].a [L28] i = ad2[i].a + 10 [L29] EXPR \read(*pa) [L29] COND FALSE !(i < *pa) [L32] CALL, EXPR check(ad1, i) [L12] EXPR ad1[b].a [L12] return ad1[b].a == b; [L32] RET, EXPR check(ad1, i) [L32] COND TRUE !check(ad1, i) [L39] reach_error() VAL [ad1={5:0}, ad2={5:0}, i=10, j=20, pa={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 237 IncrementalHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 43 mSDtfsCounter, 237 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/132 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 proved your program to be incorrect! [2023-12-16 16:15:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...