/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/loop-invgen/id_build.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:29:55,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:29:55,670 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:29:55,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:29:55,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:29:55,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:29:55,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:29:55,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:29:55,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:29:55,715 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:29:55,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:29:55,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:29:55,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:29:55,717 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:29:55,717 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:29:55,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:29:55,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:29:55,718 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:29:55,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:29:55,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:29:55,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:29:55,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:29:55,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:29:55,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:29:55,720 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:29:55,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:29:55,720 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:29:55,720 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:29:55,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:29:55,721 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:29:55,722 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:29:55,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:29:55,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:29:55,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:29:55,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:29:55,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:29:55,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:29:55,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:29:55,723 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:29:55,723 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:29:55,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:29:55,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:29:55,724 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:29:55,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:29:55,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:29:55,724 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:29:55,724 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:29:55,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:29:55,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:29:55,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:29:55,976 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:29:55,976 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:29:55,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_build.i [2023-12-16 16:29:57,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:29:57,245 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:29:57,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i [2023-12-16 16:29:57,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4f7127e/43c5b7bc7fd64d9d9221489acbb2094c/FLAGa261cb8eb [2023-12-16 16:29:57,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4f7127e/43c5b7bc7fd64d9d9221489acbb2094c [2023-12-16 16:29:57,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:29:57,271 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:29:57,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:29:57,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:29:57,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:29:57,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f608d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57, skipping insertion in model container [2023-12-16 16:29:57,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,298 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:29:57,438 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i[893,906] [2023-12-16 16:29:57,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:29:57,461 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:29:57,475 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_build.i[893,906] [2023-12-16 16:29:57,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:29:57,491 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:29:57,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57 WrapperNode [2023-12-16 16:29:57,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:29:57,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:29:57,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:29:57,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:29:57,500 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:29:57" (1/1) ... [2023-12-16 16:29:57,507 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:29:57" (1/1) ... [2023-12-16 16:29:57,520 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2023-12-16 16:29:57,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:29:57,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:29:57,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:29:57,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:29:57,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 16:29:57,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:29:57,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:29:57,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:29:57,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:29:57,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (1/1) ... [2023-12-16 16:29:57,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:29:57,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:29:57,597 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:29:57,622 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:29:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:29:57,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:29:57,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:29:57,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:29:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 16:29:57,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 16:29:57,701 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:29:57,705 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:29:57,859 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:29:57,882 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:29:57,883 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 16:29:57,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:57 BoogieIcfgContainer [2023-12-16 16:29:57,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:29:57,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:29:57,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:29:57,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:29:57,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:29:57" (1/3) ... [2023-12-16 16:29:57,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f94ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:57, skipping insertion in model container [2023-12-16 16:29:57,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:57" (2/3) ... [2023-12-16 16:29:57,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f94ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:57, skipping insertion in model container [2023-12-16 16:29:57,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:57" (3/3) ... [2023-12-16 16:29:57,890 INFO L112 eAbstractionObserver]: Analyzing ICFG id_build.i [2023-12-16 16:29:57,905 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:29:57,905 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:29:57,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:29:57,953 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;@3a89d075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:29:57,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:29:57,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:29:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 16:29:57,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:57,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:57,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:29:57,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash -822356528, now seen corresponding path program 1 times [2023-12-16 16:29:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126356108] [2023-12-16 16:29:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:57,986 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:29:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:57,992 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:29:58,000 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:29:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:58,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 16:29:58,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:58,241 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:29:58,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:58,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126356108] [2023-12-16 16:29:58,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126356108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:58,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:58,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:29:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431828981] [2023-12-16 16:29:58,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:58,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:29:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:58,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:29:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:29:58,277 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:58,379 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2023-12-16 16:29:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:29:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 16:29:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:58,386 INFO L225 Difference]: With dead ends: 40 [2023-12-16 16:29:58,387 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 16:29:58,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:29:58,392 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:58,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 42 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:29:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 16:29:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-12-16 16:29:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:29:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-16 16:29:58,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 7 [2023-12-16 16:29:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:58,425 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-16 16:29:58,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-16 16:29:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 16:29:58,427 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:58,427 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:58,432 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:29:58,628 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:29:58,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:29:58,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 92342690, now seen corresponding path program 1 times [2023-12-16 16:29:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140200893] [2023-12-16 16:29:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:58,630 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:29:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:58,631 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:29:58,633 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:29:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:58,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:29:58,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:29:58,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:29:58,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140200893] [2023-12-16 16:29:58,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140200893] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:29:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:29:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 16:29:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507295954] [2023-12-16 16:29:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:29:58,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:29:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:58,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:29:58,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:29:58,666 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:58,680 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2023-12-16 16:29:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:29:58,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:29:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:58,682 INFO L225 Difference]: With dead ends: 42 [2023-12-16 16:29:58,682 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 16:29:58,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:29:58,684 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:58,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:29:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 16:29:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2023-12-16 16:29:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 16:29:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-12-16 16:29:58,692 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 10 [2023-12-16 16:29:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:58,692 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-12-16 16:29:58,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:29:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-12-16 16:29:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 16:29:58,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:58,693 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:29:58,699 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:29:58,895 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:29:58,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:29:58,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash 992802818, now seen corresponding path program 1 times [2023-12-16 16:29:58,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936084375] [2023-12-16 16:29:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:29:58,897 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:29:58,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:58,898 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:29:58,916 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:29:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:29:58,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:29:58,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:29:58,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:29:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 16:29:59,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936084375] [2023-12-16 16:29:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936084375] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:29:59,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:29:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 16:29:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831004213] [2023-12-16 16:29:59,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:29:59,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:29:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:29:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:29:59,010 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:29:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:59,120 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2023-12-16 16:29:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:29:59,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2023-12-16 16:29:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:59,124 INFO L225 Difference]: With dead ends: 61 [2023-12-16 16:29:59,125 INFO L226 Difference]: Without dead ends: 48 [2023-12-16 16:29:59,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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:29:59,129 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:59,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:29:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-16 16:29:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-16 16:29:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 16:29:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2023-12-16 16:29:59,157 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2023-12-16 16:29:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:59,159 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2023-12-16 16:29:59,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:29:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2023-12-16 16:29:59,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 16:29:59,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:59,162 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2023-12-16 16:29:59,171 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:29:59,364 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:29:59,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:29:59,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:29:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 161571618, now seen corresponding path program 2 times [2023-12-16 16:29:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:29:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086270556] [2023-12-16 16:29:59,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:29:59,366 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:29:59,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:29:59,367 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:29:59,387 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:29:59,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:29:59,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:29:59,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:29:59,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:29:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 16:29:59,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:29:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 16:29:59,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:29:59,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086270556] [2023-12-16 16:29:59,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086270556] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:29:59,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:29:59,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 16:29:59,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007240741] [2023-12-16 16:29:59,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:29:59,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:29:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:29:59,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:29:59,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:29:59,684 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-16 16:29:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:29:59,935 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2023-12-16 16:29:59,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 16:29:59,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Word has length 58 [2023-12-16 16:29:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:29:59,940 INFO L225 Difference]: With dead ends: 105 [2023-12-16 16:29:59,940 INFO L226 Difference]: Without dead ends: 80 [2023-12-16 16:29:59,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:29:59,942 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:29:59,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 124 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:29:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-16 16:29:59,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-12-16 16:29:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-16 16:29:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 112 transitions. [2023-12-16 16:29:59,969 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 112 transitions. Word has length 58 [2023-12-16 16:29:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:29:59,970 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 112 transitions. [2023-12-16 16:29:59,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 9 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2023-12-16 16:29:59,971 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2023-12-16 16:29:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 16:29:59,974 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:29:59,974 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 9, 9, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1] [2023-12-16 16:29:59,982 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:30:00,177 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:30:00,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:00,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash -384254814, now seen corresponding path program 3 times [2023-12-16 16:30:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:00,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985272815] [2023-12-16 16:30:00,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:30:00,179 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:30:00,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:00,180 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:30:00,182 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:30:00,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 16:30:00,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:30:00,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:30:00,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2023-12-16 16:30:00,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2023-12-16 16:30:01,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:01,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985272815] [2023-12-16 16:30:01,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985272815] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:01,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:30:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333205357] [2023-12-16 16:30:01,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:01,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:30:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:30:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:30:01,483 INFO L87 Difference]: Start difference. First operand 80 states and 112 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:30:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:02,091 INFO L93 Difference]: Finished difference Result 157 states and 222 transitions. [2023-12-16 16:30:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:30:02,092 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 106 [2023-12-16 16:30:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:02,095 INFO L225 Difference]: With dead ends: 157 [2023-12-16 16:30:02,095 INFO L226 Difference]: Without dead ends: 155 [2023-12-16 16:30:02,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-16 16:30:02,096 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:02,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 75 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 16:30:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-12-16 16:30:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 119. [2023-12-16 16:30:02,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-16 16:30:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2023-12-16 16:30:02,132 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 106 [2023-12-16 16:30:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:02,133 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2023-12-16 16:30:02,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 12 states have internal predecessors, (24), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:30:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2023-12-16 16:30:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-16 16:30:02,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:30:02,137 INFO L195 NwaCegarLoop]: trace histogram [34, 33, 33, 17, 17, 17, 17, 16, 16, 3, 2, 2, 1, 1, 1] [2023-12-16 16:30:02,144 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:30:02,338 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:30:02,339 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:30:02,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:30:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1394216013, now seen corresponding path program 4 times [2023-12-16 16:30:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:30:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214797929] [2023-12-16 16:30:02,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:30:02,340 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:30:02,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:30:02,341 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:30:02,342 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:30:02,479 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:30:02,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:30:02,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:30:02,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:30:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 161 proven. 328 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2023-12-16 16:30:02,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:30:04,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 161 proven. 328 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2023-12-16 16:30:04,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:30:04,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214797929] [2023-12-16 16:30:04,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214797929] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:30:04,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:30:04,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2023-12-16 16:30:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894079026] [2023-12-16 16:30:04,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:30:04,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:30:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:30:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:30:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:30:04,049 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 8 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-12-16 16:30:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:30:05,460 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2023-12-16 16:30:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:30:05,461 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 8 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 210 [2023-12-16 16:30:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:30:05,462 INFO L225 Difference]: With dead ends: 162 [2023-12-16 16:30:05,462 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 16:30:05,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:30:05,465 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:30:05,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 139 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:30:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 16:30:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 16:30:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:30:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 16:30:05,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2023-12-16 16:30:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:30:05,466 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 16:30:05,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.4375) internal successors, (39), 15 states have internal predecessors, (39), 8 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-12-16 16:30:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 16:30:05,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 16:30:05,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:30:05,475 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:30:05,672 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:30:05,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 16:30:08,681 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse0 (bvadd (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~nlen~0#1|))) (and (bvsle (_ bv0 32) .cse0) (bvslt |ULTIMATE.start_main_~j~0#1| (_ bv8 32)) (bvslt .cse0 |ULTIMATE.start_main_~nlen~0#1|))) [2023-12-16 16:30:08,682 INFO L895 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse0 (bvadd (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~nlen~0#1|))) (and (bvsle (_ bv0 32) .cse0) (bvslt |ULTIMATE.start_main_~j~0#1| (_ bv8 32)) (bvslt .cse0 |ULTIMATE.start_main_~nlen~0#1|))) [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 32) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 32) the Hoare annotation is: (or (let ((.cse0 (bvadd (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~nlen~0#1|))) (and (bvslt (bvadd (_ bv4294967295 32) (bvneg (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32))) |ULTIMATE.start_main_~nlen~0#1|) |ULTIMATE.start_main_~nlen~0#1|) (or (bvsle (_ bv0 32) .cse0) (not (bvslt |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~nlen~0#1|))) (bvslt .cse0 |ULTIMATE.start_main_~nlen~0#1|))) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))) [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point L27-4(lines 27 32) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point L30(lines 28 31) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 31) the Hoare annotation is: (let ((.cse0 (bvadd (_ bv4294967295 32) (bvneg |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~nlen~0#1|))) (and (bvsle (_ bv0 32) .cse0) (bvslt .cse0 |ULTIMATE.start_main_~nlen~0#1|))) [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-12-16 16:30:08,682 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-12-16 16:30:08,682 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 16:30:08,683 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 16:30:08,683 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-12-16 16:30:08,685 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2023-12-16 16:30:08,687 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:30:08,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:30:08 BoogieIcfgContainer [2023-12-16 16:30:08,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:30:08,702 INFO L158 Benchmark]: Toolchain (without parser) took 11430.18ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 136.4MB in the beginning and 109.7MB in the end (delta: 26.7MB). Peak memory consumption was 112.1MB. Max. memory is 8.0GB. [2023-12-16 16:30:08,702 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 203.4MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:30:08,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.84ms. Allocated memory is still 203.4MB. Free memory was 136.1MB in the beginning and 125.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:30:08,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.32ms. Allocated memory is still 203.4MB. Free memory was 124.9MB in the beginning and 123.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:30:08,703 INFO L158 Benchmark]: Boogie Preprocessor took 44.69ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 123.6MB in the beginning and 211.1MB in the end (delta: -87.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 16:30:08,703 INFO L158 Benchmark]: RCFGBuilder took 316.09ms. Allocated memory is still 244.3MB. Free memory was 211.0MB in the beginning and 207.1MB in the end (delta: 3.9MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2023-12-16 16:30:08,703 INFO L158 Benchmark]: TraceAbstraction took 10815.54ms. Allocated memory is still 244.3MB. Free memory was 206.1MB in the beginning and 109.7MB in the end (delta: 96.4MB). Peak memory consumption was 139.6MB. Max. memory is 8.0GB. [2023-12-16 16:30:08,704 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.19ms. Allocated memory is still 203.4MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.84ms. Allocated memory is still 203.4MB. Free memory was 136.1MB in the beginning and 125.1MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.32ms. Allocated memory is still 203.4MB. Free memory was 124.9MB in the beginning and 123.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.69ms. Allocated memory was 203.4MB in the beginning and 244.3MB in the end (delta: 40.9MB). Free memory was 123.6MB in the beginning and 211.1MB in the end (delta: -87.5MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 316.09ms. Allocated memory is still 244.3MB. Free memory was 211.0MB in the beginning and 207.1MB in the end (delta: 3.9MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 10815.54ms. Allocated memory is still 244.3MB. Free memory was 206.1MB in the beginning and 109.7MB in the end (delta: 96.4MB). Peak memory consumption was 139.6MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 6, TraceHistogramMax: 34, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 355 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 93 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 43 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 83 PreInvPairs, 190 NumberOfFragments, 85 HoareAnnotationTreeSize, 83 FormulaSimplifications, 1599 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 5 FormulaSimplificationsInter, 3746 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 413 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 799 ConstructedInterpolants, 2 QuantifiedInterpolants, 3596 SizeOfPredicates, 6 NumberOfNonLiveVariables, 487 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 6417/7150 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((-1 + -(((i + 1) % 4294967296))) % 4294967296) < nlen) && ((0 <= ((-1 + -(i)) % 4294967296)) || !((i < nlen)))) && (((-1 + -(i)) % 4294967296) < nlen)) || (i == 0)) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((0 <= ((-1 + -(i)) % 4294967296)) && (((-1 + -(i)) % 4294967296) < nlen)) RESULT: Ultimate proved your program to be correct! [2023-12-16 16:30:08,724 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...