/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/nla-digbench-scaling/ps6-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:06:03,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:06:04,001 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-25 05:06:04,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:06:04,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:06:04,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:06:04,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:06:04,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:06:04,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:06:04,047 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:06:04,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:06:04,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:06:04,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:06:04,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:06:04,049 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:06:04,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:06:04,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:06:04,050 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:06:04,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:06:04,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:06:04,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:06:04,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:06:04,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:06:04,056 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:06:04,057 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:06:04,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:06:04,057 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:06:04,057 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:06:04,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:06:04,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:06:04,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:06:04,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:06:04,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:06:04,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:06:04,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:06:04,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:06:04,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:06:04,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:06:04,060 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:06:04,060 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:06:04,060 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:06:04,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:06:04,060 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:06:04,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:06:04,061 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:06:04,061 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:06:04,061 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-25 05:06:04,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:06:04,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:06:04,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:06:04,315 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:06:04,315 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:06:04,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c [2023-12-25 05:06:05,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:06:05,661 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:06:05,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c [2023-12-25 05:06:05,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ba20d51/b25789a21e304c498c5d4b91852c0f38/FLAG72e7f4113 [2023-12-25 05:06:05,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89ba20d51/b25789a21e304c498c5d4b91852c0f38 [2023-12-25 05:06:05,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:06:05,691 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:06:05,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:06:05,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:06:05,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:06:05,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:05,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7536055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05, skipping insertion in model container [2023-12-25 05:06:05,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:05,722 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:06:05,879 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c[458,471] [2023-12-25 05:06:05,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:06:05,921 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:06:05,931 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound5.c[458,471] [2023-12-25 05:06:05,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:06:05,955 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:06:05,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05 WrapperNode [2023-12-25 05:06:05,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:06:05,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:06:05,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:06:05,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:06:05,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:05,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:05,986 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2023-12-25 05:06:05,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:06:05,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:06:05,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:06:05,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:06:05,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:05,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:05,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,009 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-25 05:06:06,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:06:06,022 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:06:06,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:06:06,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:06:06,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (1/1) ... [2023-12-25 05:06:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:06:06,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:06:06,060 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-25 05:06:06,078 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-25 05:06:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:06:06,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:06:06,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 05:06:06,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 05:06:06,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:06:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:06:06,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 05:06:06,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 05:06:06,164 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:06:06,169 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:06:06,847 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:06:06,868 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:06:06,868 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:06:06,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:06:06 BoogieIcfgContainer [2023-12-25 05:06:06,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:06:06,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:06:06,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:06:06,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:06:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:06:05" (1/3) ... [2023-12-25 05:06:06,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237e2773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:06:06, skipping insertion in model container [2023-12-25 05:06:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:06:05" (2/3) ... [2023-12-25 05:06:06,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237e2773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:06:06, skipping insertion in model container [2023-12-25 05:06:06,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:06:06" (3/3) ... [2023-12-25 05:06:06,876 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound5.c [2023-12-25 05:06:06,894 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:06:06,895 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:06:06,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:06:06,949 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;@7d0d9b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:06:06,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:06:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:06:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:06:06,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:06:06,967 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:06:06,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:06:06,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:06:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2023-12-25 05:06:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:06:06,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791928663] [2023-12-25 05:06:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:06:06,985 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-25 05:06:06,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:06:06,986 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-25 05:06:06,987 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-25 05:06:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:06:07,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:06:07,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:06:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 05:06:07,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:06:07,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:06:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791928663] [2023-12-25 05:06:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791928663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:06:07,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:06:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:06:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287472096] [2023-12-25 05:06:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:06:07,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:06:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:06:07,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:06:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:06:07,228 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:06:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:06:07,253 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2023-12-25 05:06:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:06:07,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 05:06:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:06:07,260 INFO L225 Difference]: With dead ends: 40 [2023-12-25 05:06:07,261 INFO L226 Difference]: Without dead ends: 19 [2023-12-25 05:06:07,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-25 05:06:07,266 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:06:07,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:06:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-25 05:06:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-25 05:06:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 05:06:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-25 05:06:07,301 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2023-12-25 05:06:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:06:07,302 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-25 05:06:07,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:06:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-25 05:06:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:06:07,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:06:07,305 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:06:07,324 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-25 05:06:07,516 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-25 05:06:07,517 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:06:07,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:06:07,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2023-12-25 05:06:07,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:06:07,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719775059] [2023-12-25 05:06:07,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:06:07,519 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-25 05:06:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:06:07,520 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-25 05:06:07,522 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-25 05:06:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:06:07,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:06:07,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:06:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 05:06:07,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:06:07,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:06:07,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719775059] [2023-12-25 05:06:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719775059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:06:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:06:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:06:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547017386] [2023-12-25 05:06:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:06:07,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:06:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:06:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:06:07,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:06:07,885 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:06:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:06:10,492 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-25 05:06:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:06:10,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 05:06:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:06:10,508 INFO L225 Difference]: With dead ends: 30 [2023-12-25 05:06:10,509 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 05:06:10,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 05:06:10,510 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-25 05:06:10,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 62 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-25 05:06:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 05:06:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 05:06:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:06:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-25 05:06:10,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2023-12-25 05:06:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:06:10,519 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-25 05:06:10,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:06:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-25 05:06:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 05:06:10,520 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:06:10,520 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:06:10,540 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-25 05:06:10,731 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-25 05:06:10,731 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:06:10,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:06:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2023-12-25 05:06:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:06:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595192236] [2023-12-25 05:06:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:06:10,733 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-25 05:06:10,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:06:10,734 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-25 05:06:10,738 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-25 05:06:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:06:11,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 05:06:11,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:06:11,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 05:06:11,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:06:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 05:06:37,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:06:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595192236] [2023-12-25 05:06:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595192236] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:06:37,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:06:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:06:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329852018] [2023-12-25 05:06:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:06:37,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:06:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:06:37,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:06:37,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:06:37,141 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 05:06:39,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:42,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:43,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:06:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:06:45,734 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-25 05:06:45,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:06:45,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-12-25 05:06:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:06:45,735 INFO L225 Difference]: With dead ends: 32 [2023-12-25 05:06:45,735 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 05:06:45,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:06:45,737 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-12-25 05:06:45,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-12-25 05:06:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 05:06:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 05:06:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:06:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-25 05:06:45,748 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2023-12-25 05:06:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:06:45,748 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-25 05:06:45,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 05:06:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-25 05:06:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 05:06:45,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:06:45,749 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:06:45,768 INFO L552 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)] Ended with exit code 0 [2023-12-25 05:06:45,964 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-25 05:06:45,965 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:06:45,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:06:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2023-12-25 05:06:45,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:06:45,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140702166] [2023-12-25 05:06:45,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:06:45,966 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-25 05:06:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:06:45,967 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-25 05:06:45,970 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-25 05:06:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:06:46,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 05:06:46,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:06:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 05:06:47,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:07:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 05:07:04,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:04,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140702166] [2023-12-25 05:07:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140702166] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:07:04,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:07:04,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 05:07:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536823463] [2023-12-25 05:07:04,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:07:04,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 05:07:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 05:07:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-25 05:07:04,832 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 05:07:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:26,354 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-25 05:07:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 05:07:26,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 35 [2023-12-25 05:07:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:26,355 INFO L225 Difference]: With dead ends: 47 [2023-12-25 05:07:26,355 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 05:07:26,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-25 05:07:26,357 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:26,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 166 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-12-25 05:07:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 05:07:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-25 05:07:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 05:07:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-25 05:07:26,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2023-12-25 05:07:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:26,372 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-25 05:07:26,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-25 05:07:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-25 05:07:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 05:07:26,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:26,374 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:26,390 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-25 05:07:26,584 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-25 05:07:26,584 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:26,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash 459274687, now seen corresponding path program 2 times [2023-12-25 05:07:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:26,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012583471] [2023-12-25 05:07:26,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:07:26,586 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-25 05:07:26,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:26,587 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-25 05:07:26,589 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-25 05:07:27,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:07:27,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:07:27,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-25 05:07:27,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-25 05:07:29,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:08:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-25 05:08:04,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:08:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012583471] [2023-12-25 05:08:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012583471] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:08:04,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:08:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 05:08:04,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174198474] [2023-12-25 05:08:04,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:08:04,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 05:08:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:08:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 05:08:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-12-25 05:08:04,234 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-12-25 05:08:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:08:52,555 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2023-12-25 05:08:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 05:08:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Word has length 56 [2023-12-25 05:08:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:08:52,557 INFO L225 Difference]: With dead ends: 65 [2023-12-25 05:08:52,557 INFO L226 Difference]: Without dead ends: 57 [2023-12-25 05:08:52,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 49.9s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2023-12-25 05:08:52,559 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:08:52,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 328 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 20.2s Time] [2023-12-25 05:08:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-25 05:08:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-12-25 05:08:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 15 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-25 05:08:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2023-12-25 05:08:52,583 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 56 [2023-12-25 05:08:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:08:52,583 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2023-12-25 05:08:52,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 14 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-12-25 05:08:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2023-12-25 05:08:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 05:08:52,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:08:52,586 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:08:52,622 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-25 05:08:52,790 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-25 05:08:52,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:08:52,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:08:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -507442273, now seen corresponding path program 3 times [2023-12-25 05:08:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:08:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74345019] [2023-12-25 05:08:52,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:08:52,792 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-25 05:08:52,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:08:52,793 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-25 05:08:52,794 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-25 05:08:57,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 05:08:57,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:08:57,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 05:08:57,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:09:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 180 proven. 111 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-12-25 05:09:00,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:09:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 78 proven. 111 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-25 05:09:02,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:09:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74345019] [2023-12-25 05:09:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74345019] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:09:02,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:09:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2023-12-25 05:09:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133819924] [2023-12-25 05:09:02,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:09:02,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-25 05:09:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:09:02,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-25 05:09:02,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2023-12-25 05:09:02,826 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 23 states have internal predecessors, (58), 22 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2023-12-25 05:09:08,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:09:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:09:14,639 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2023-12-25 05:09:14,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 05:09:14,694 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 23 states have internal predecessors, (58), 22 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) Word has length 98 [2023-12-25 05:09:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:09:14,695 INFO L225 Difference]: With dead ends: 61 [2023-12-25 05:09:14,695 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 05:09:14,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2023-12-25 05:09:14,696 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2023-12-25 05:09:14,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2023-12-25 05:09:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 05:09:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 05:09:14,697 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-25 05:09:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 05:09:14,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2023-12-25 05:09:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:09:14,698 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 05:09:14,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 23 states have internal predecessors, (58), 22 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 21 states have call predecessors, (26), 22 states have call successors, (26) [2023-12-25 05:09:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 05:09:14,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 05:09:14,701 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:09:14,778 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-25 05:09:14,912 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-25 05:09:14,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 05:09:42,988 WARN L293 SmtUtils]: Spent 28.03s on a formula simplification. DAG size of input: 110 DAG size of output: 71 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:10:00,184 WARN L293 SmtUtils]: Spent 17.19s on a formula simplification. DAG size of input: 96 DAG size of output: 49 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:10:18,843 WARN L293 SmtUtils]: Spent 18.66s on a formula simplification. DAG size of input: 110 DAG size of output: 71 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:10:37,456 WARN L293 SmtUtils]: Spent 18.58s on a formula simplification. DAG size of input: 96 DAG size of output: 49 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:10:37,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 05:10:37,460 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse6 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse1 ((_ sign_extend 32) .cse6))) (let ((.cse2 (bvslt (_ bv2 64) .cse1)) (.cse0 (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv12 64))) (.cse3 (bvsle .cse6 (_ bv5 32))) (.cse4 (bvsge .cse6 (_ bv0 32)))) (or (and (= .cse0 (_ bv396 64)) (or (= (bvmul .cse1 (_ bv2 64)) (_ bv4 64)) .cse2) .cse3 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (and (= .cse0 (_ bv12 64)) (or (= .cse1 (_ bv1 64)) (bvslt (_ bv1 64) .cse1)) .cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~c~0#1| (_ bv1 64))) (and .cse3 .cse4 (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 64))) (and (= (_ bv3 64) |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 (= (_ bv3 64) |ULTIMATE.start_main_~y~0#1|) (= .cse0 (_ bv3312 64))) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv4 64)) (= .cse0 (_ bv15600 64)) .cse3 (bvslt (_ bv3 64) .cse1) (= |ULTIMATE.start_main_~y~0#1| (_ bv4 64))) (let ((.cse5 (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (bvmul (_ bv2 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvadd .cse0 (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv6 64))))))) .cse5 (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv5 64)))))))) (= |ULTIMATE.start_main_~c~0#1| (_ bv5 64)) .cse3 .cse4 (= (bvmul .cse1 |ULTIMATE.start_main_~y~0#1|) .cse5))))))) [2023-12-25 05:10:37,460 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-12-25 05:10:37,460 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-12-25 05:10:37,460 INFO L895 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (and (bvsle .cse0 (_ bv5 32)) (bvsge .cse0 (_ bv0 32)))) [2023-12-25 05:10:37,460 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 05:10:37,460 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-12-25 05:10:37,461 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse6 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse1 ((_ sign_extend 32) .cse6))) (let ((.cse2 (bvslt (_ bv2 64) .cse1)) (.cse0 (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv12 64))) (.cse3 (bvsle .cse6 (_ bv5 32))) (.cse4 (bvsge .cse6 (_ bv0 32)))) (or (and (= .cse0 (_ bv396 64)) (or (= (bvmul .cse1 (_ bv2 64)) (_ bv4 64)) .cse2) .cse3 (= |ULTIMATE.start_main_~c~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (and (= .cse0 (_ bv12 64)) (or (= .cse1 (_ bv1 64)) (bvslt (_ bv1 64) .cse1)) .cse3 (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~c~0#1| (_ bv1 64))) (and .cse3 .cse4 (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~c~0#1| (_ bv0 64))) (and (= (_ bv3 64) |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 (= (_ bv3 64) |ULTIMATE.start_main_~y~0#1|) (= .cse0 (_ bv3312 64))) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv4 64)) (= .cse0 (_ bv15600 64)) .cse3 (bvslt (_ bv3 64) .cse1) (= |ULTIMATE.start_main_~y~0#1| (_ bv4 64))) (let ((.cse5 (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (bvmul (_ bv2 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvadd .cse0 (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv6 64))))))) .cse5 (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv5 64)))))))) (= |ULTIMATE.start_main_~c~0#1| (_ bv5 64)) .cse3 .cse4 (= (bvmul .cse1 |ULTIMATE.start_main_~y~0#1|) .cse5))))))) [2023-12-25 05:10:37,461 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (or (and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|)) (let ((.cse1 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse3 ((_ sign_extend 32) .cse1))) (let ((.cse0 (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (bvmul .cse3 |ULTIMATE.start_main_~y~0#1|))) (and (= (bvmul (_ bv2 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvadd (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv12 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv6 64))))))) .cse0 (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv5 64)))))))) (bvsle .cse1 (_ bv5 32)) (bvsge .cse1 (_ bv0 32)) (= .cse2 .cse0) (or (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 64)) .cse3) (= (bvadd (_ bv1 64) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse0) (bvadd .cse3 .cse2)) (not (bvslt |ULTIMATE.start_main_~c~0#1| .cse3)))))))) [2023-12-25 05:10:37,461 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (and (= (_ bv0 64) |ULTIMATE.start_main_~x~0#1|) (= (_ bv0 64) |ULTIMATE.start_main_~y~0#1|)) (let ((.cse1 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse3 ((_ sign_extend 32) .cse1))) (let ((.cse0 (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse2 (bvmul .cse3 |ULTIMATE.start_main_~y~0#1|))) (and (= (bvmul (_ bv2 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvadd (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv12 64)) (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv6 64))))))) .cse0 (bvneg (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv5 64)))))))) (bvsle .cse1 (_ bv5 32)) (bvsge .cse1 (_ bv0 32)) (= .cse2 .cse0) (or (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 64)) .cse3) (= (bvadd (_ bv1 64) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse0) (bvadd .cse3 .cse2)) (not (bvslt |ULTIMATE.start_main_~c~0#1| .cse3)))))))) [2023-12-25 05:10:37,462 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-12-25 05:10:37,462 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-12-25 05:10:37,462 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-12-25 05:10:37,463 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-12-25 05:10:37,465 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-25 05:10:37,467 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:10:37,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:10:37 BoogieIcfgContainer [2023-12-25 05:10:37,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:10:37,482 INFO L158 Benchmark]: Toolchain (without parser) took 271791.05ms. Allocated memory is still 309.3MB. Free memory was 254.9MB in the beginning and 153.6MB in the end (delta: 101.3MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. [2023-12-25 05:10:37,482 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 203.4MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:10:37,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.48ms. Allocated memory is still 309.3MB. Free memory was 254.9MB in the beginning and 243.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:10:37,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.73ms. Allocated memory is still 309.3MB. Free memory was 243.1MB in the beginning and 241.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:10:37,483 INFO L158 Benchmark]: Boogie Preprocessor took 34.83ms. Allocated memory is still 309.3MB. Free memory was 241.8MB in the beginning and 239.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:10:37,483 INFO L158 Benchmark]: RCFGBuilder took 846.24ms. Allocated memory is still 309.3MB. Free memory was 239.7MB in the beginning and 227.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 05:10:37,484 INFO L158 Benchmark]: TraceAbstraction took 270611.29ms. Allocated memory is still 309.3MB. Free memory was 226.4MB in the beginning and 153.6MB in the end (delta: 72.7MB). Peak memory consumption was 73.5MB. Max. memory is 8.0GB. [2023-12-25 05:10:37,485 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.53ms. Allocated memory is still 203.4MB. Free memory is still 155.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.48ms. Allocated memory is still 309.3MB. Free memory was 254.9MB in the beginning and 243.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.73ms. Allocated memory is still 309.3MB. Free memory was 243.1MB in the beginning and 241.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.83ms. Allocated memory is still 309.3MB. Free memory was 241.8MB in the beginning and 239.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 846.24ms. Allocated memory is still 309.3MB. Free memory was 239.7MB in the beginning and 227.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 270611.29ms. Allocated memory is still 309.3MB. Free memory was 226.4MB in the beginning and 153.6MB in the end (delta: 72.7MB). Peak memory consumption was 73.5MB. 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: 12]: 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 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 270.5s, OverallIterations: 6, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 93.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 82.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 52.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 919 SdHoareTripleChecker+Invalid, 47.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 792 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 127 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 384 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 93.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 62, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 35 PreInvPairs, 58 NumberOfFragments, 560 HoareAnnotationTreeSize, 35 FormulaSimplifications, 643 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 860 FormulaSimplificationTreeSizeReductionInter, 82.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 86.8s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 2267 SizeOfPredicates, 11 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 904/1200 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: 28]: Loop Invariant Derived loop invariant: (((((((((((x * 12) == 396) && (((k * 2) == 4) || (2 < k))) && (k <= 5)) && (c == 2)) && (y == 2)) || ((((((x * 12) == 12) && ((k == 1) || (1 < k))) && (k <= 5)) && (y == 1)) && (c == 1))) || (((((k <= 5) && (k >= 0)) && (0 == x)) && (0 == y)) && (c == 0))) || (((((3 == c) && (2 < k)) && (k <= 5)) && (3 == y)) && ((x * 12) == 3312))) || (((((c == 4) && ((x * 12) == 15600)) && (k <= 5)) && (3 < k)) && (y == 4))) || ((((((2 * (y * y)) == (((x * 12) + -((y * (y * (y * (y * (y * 6))))))) % 1)) && (c == 5)) && (k <= 5)) && (k >= 0)) && ((k * y) == (y * y)))) RESULT: Ultimate proved your program to be correct! [2023-12-25 05:10:37,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...