/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/ps5-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 04:55:35,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 04:55:35,084 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 04:55:35,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 04:55:35,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 04:55:35,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 04:55:35,110 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 04:55:35,110 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 04:55:35,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 04:55:35,111 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 04:55:35,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 04:55:35,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 04:55:35,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 04:55:35,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 04:55:35,112 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 04:55:35,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 04:55:35,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 04:55:35,113 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 04:55:35,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 04:55:35,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 04:55:35,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 04:55:35,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 04:55:35,116 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 04:55:35,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 04:55:35,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 04:55:35,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 04:55:35,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 04:55:35,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:55:35,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 04:55:35,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 04:55:35,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 04:55:35,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 04:55:35,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 04:55:35,120 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 04:55:35,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 04:55:35,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 04:55:35,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 04:55:35,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 04:55:35,306 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 04:55:35,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2023-12-25 04:55:36,379 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 04:55:36,542 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 04:55:36,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound10.c [2023-12-25 04:55:36,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533865bb3/8a73b62ec5c9491190f131dc646b7aaf/FLAGad19bb32a [2023-12-25 04:55:36,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/533865bb3/8a73b62ec5c9491190f131dc646b7aaf [2023-12-25 04:55:36,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 04:55:36,566 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 04:55:36,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 04:55:36,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 04:55:36,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 04:55:36,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521e3ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36, skipping insertion in model container [2023-12-25 04:55:36,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 04:55:36,684 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/ps5-ll_valuebound10.c[458,471] [2023-12-25 04:55:36,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:55:36,704 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 04:55:36,711 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/ps5-ll_valuebound10.c[458,471] [2023-12-25 04:55:36,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 04:55:36,726 INFO L206 MainTranslator]: Completed translation [2023-12-25 04:55:36,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36 WrapperNode [2023-12-25 04:55:36,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 04:55:36,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 04:55:36,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 04:55:36,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 04:55:36,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,750 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2023-12-25 04:55:36,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 04:55:36,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 04:55:36,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 04:55:36,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 04:55:36,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,769 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 04:55:36,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 04:55:36,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 04:55:36,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 04:55:36,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 04:55:36,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (1/1) ... [2023-12-25 04:55:36,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 04:55:36,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 04:55:36,833 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 04:55:36,838 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 04:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 04:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 04:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 04:55:36,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 04:55:36,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 04:55:36,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 04:55:36,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 04:55:36,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 04:55:36,894 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 04:55:36,895 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 04:55:37,227 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 04:55:37,243 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 04:55:37,243 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 04:55:37,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:55:37 BoogieIcfgContainer [2023-12-25 04:55:37,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 04:55:37,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 04:55:37,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 04:55:37,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 04:55:37,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 04:55:36" (1/3) ... [2023-12-25 04:55:37,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444e605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:55:37, skipping insertion in model container [2023-12-25 04:55:37,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 04:55:36" (2/3) ... [2023-12-25 04:55:37,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3444e605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 04:55:37, skipping insertion in model container [2023-12-25 04:55:37,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 04:55:37" (3/3) ... [2023-12-25 04:55:37,251 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2023-12-25 04:55:37,265 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 04:55:37,267 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 04:55:37,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 04:55:37,306 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;@3a980d91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 04:55:37,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 04:55:37,308 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 04:55:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:55:37,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:55:37,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:55:37,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:55:37,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:55:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2023-12-25 04:55:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:55:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743159485] [2023-12-25 04:55:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:55:37,325 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 04:55:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:55:37,338 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 04:55:37,341 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 04:55:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:55:37,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 04:55:37,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:55:37,531 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 04:55:37,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:55:37,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:55:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743159485] [2023-12-25 04:55:37,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743159485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:55:37,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:55:37,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 04:55:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800929398] [2023-12-25 04:55:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:55:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 04:55:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:55:37,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 04:55:37,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 04:55:37,580 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 04:55:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:55:37,618 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2023-12-25 04:55:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 04:55:37,620 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 04:55:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:55:37,625 INFO L225 Difference]: With dead ends: 40 [2023-12-25 04:55:37,625 INFO L226 Difference]: Without dead ends: 19 [2023-12-25 04:55:37,627 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 04:55:37,631 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 04:55:37,633 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 04:55:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-25 04:55:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-25 04:55:37,656 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 04:55:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-25 04:55:37,658 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2023-12-25 04:55:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:55:37,659 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-25 04:55:37,659 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 04:55:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-25 04:55:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 04:55:37,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:55:37,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 04:55:37,671 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 04:55:37,871 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 04:55:37,872 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:55:37,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:55:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2023-12-25 04:55:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:55:37,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184868192] [2023-12-25 04:55:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:55:37,873 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 04:55:37,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:55:37,874 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 04:55:37,878 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 04:55:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:55:38,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 04:55:38,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:55:38,197 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 04:55:38,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 04:55:38,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:55:38,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184868192] [2023-12-25 04:55:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184868192] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 04:55:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 04:55:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 04:55:38,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879736639] [2023-12-25 04:55:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:55:38,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:55:38,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:55:38,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:55:38,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 04:55:38,203 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 04:55:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:55:40,511 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-25 04:55:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 04:55:40,525 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 04:55:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:55:40,526 INFO L225 Difference]: With dead ends: 30 [2023-12-25 04:55:40,526 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 04:55:40,526 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 04:55:40,527 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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.3s IncrementalHoareTripleChecker+Time [2023-12-25 04:55:40,527 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.3s Time] [2023-12-25 04:55:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 04:55:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 04:55:40,532 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 04:55:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-25 04:55:40,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2023-12-25 04:55:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:55:40,533 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-25 04:55:40,533 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 04:55:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-25 04:55:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-25 04:55:40,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:55:40,534 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 04:55:40,542 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 04:55:40,742 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 04:55:40,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:55:40,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:55:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2023-12-25 04:55:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:55:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490369080] [2023-12-25 04:55:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:55:40,744 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 04:55:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:55:40,754 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 04:55:40,755 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 04:55:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:55:41,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 04:55:41,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:55:41,354 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 04:55:41,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:55:59,663 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 04:55:59,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:55:59,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490369080] [2023-12-25 04:55:59,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490369080] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 04:55:59,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 04:55:59,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 04:55:59,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749711402] [2023-12-25 04:55:59,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 04:55:59,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 04:55:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:55:59,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 04:55:59,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 04:55:59,666 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 04:56:03,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 04:56:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:56:04,882 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-12-25 04:56:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 04:56:04,883 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 04:56:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:56:04,883 INFO L225 Difference]: With dead ends: 32 [2023-12-25 04:56:04,883 INFO L226 Difference]: Without dead ends: 28 [2023-12-25 04:56:04,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 04:56:04,884 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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, 4.6s IncrementalHoareTripleChecker+Time [2023-12-25 04:56:04,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-12-25 04:56:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-25 04:56:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-25 04:56:04,895 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 04:56:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-25 04:56:04,897 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2023-12-25 04:56:04,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:56:04,898 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-25 04:56:04,898 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 04:56:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-25 04:56:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-25 04:56:04,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:56:04,900 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 04:56:04,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 04:56:05,114 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 04:56:05,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:56:05,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:56:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2023-12-25 04:56:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:56:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491705194] [2023-12-25 04:56:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 04:56:05,115 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 04:56:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:56:05,117 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 04:56:05,118 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 04:56:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 04:56:05,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 04:56:05,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:56:06,373 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 04:56:06,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:56:20,506 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 04:56:20,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:56:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491705194] [2023-12-25 04:56:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491705194] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:56:20,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:56:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2023-12-25 04:56:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138272716] [2023-12-25 04:56:20,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:56:20,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 04:56:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:56:20,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 04:56:20,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-12-25 04:56:20,508 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 04:56:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:56:41,894 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2023-12-25 04:56:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 04:56:41,895 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 04:56:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:56:41,896 INFO L225 Difference]: With dead ends: 47 [2023-12-25 04:56:41,896 INFO L226 Difference]: Without dead ends: 39 [2023-12-25 04:56:41,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-25 04:56:41,897 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s 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, 9.8s IncrementalHoareTripleChecker+Time [2023-12-25 04:56:41,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 166 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2023-12-25 04:56:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-25 04:56:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-12-25 04:56:41,907 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 04:56:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-25 04:56:41,924 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 35 [2023-12-25 04:56:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:56:41,924 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-25 04:56:41,925 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 04:56:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-25 04:56:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-25 04:56:41,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:56:41,927 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 04:56:41,943 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 (5)] Ended with exit code 0 [2023-12-25 04:56:42,128 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 04:56:42,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:56:42,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:56:42,129 INFO L85 PathProgramCache]: Analyzing trace with hash 459274687, now seen corresponding path program 2 times [2023-12-25 04:56:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:56:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450813362] [2023-12-25 04:56:42,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 04:56:42,129 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 04:56:42,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:56:42,131 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 04:56:42,132 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 04:56:43,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 04:56:43,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:56:43,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 04:56:43,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:56:44,574 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 04:56:44,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:57:19,193 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 04:57:19,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:57:19,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450813362] [2023-12-25 04:57:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450813362] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:57:19,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:57:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2023-12-25 04:57:19,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077732847] [2023-12-25 04:57:19,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:57:19,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 04:57:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:57:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 04:57:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-25 04:57:19,195 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 04:58:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 04:58:13,015 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2023-12-25 04:58:13,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-25 04:58:13,015 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 04:58:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 04:58:13,016 INFO L225 Difference]: With dead ends: 65 [2023-12-25 04:58:13,016 INFO L226 Difference]: Without dead ends: 57 [2023-12-25 04:58:13,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2023-12-25 04:58:13,017 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 39 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-12-25 04:58:13,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 327 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2023-12-25 04:58:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-25 04:58:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-12-25 04:58:13,046 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 04:58:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2023-12-25 04:58:13,047 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 56 [2023-12-25 04:58:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 04:58:13,048 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2023-12-25 04:58:13,048 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 04:58:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2023-12-25 04:58:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-25 04:58:13,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 04:58:13,049 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 04:58:13,079 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 04:58:13,275 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 04:58:13,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 04:58:13,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 04:58:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -507442273, now seen corresponding path program 3 times [2023-12-25 04:58:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 04:58:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753560058] [2023-12-25 04:58:13,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 04:58:13,276 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 04:58:13,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 04:58:13,278 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 04:58:13,279 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 04:58:17,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-25 04:58:17,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 04:58:18,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 04:58:18,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 04:58:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-12-25 04:58:21,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 04:59:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 24 proven. 165 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-25 04:59:53,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 04:59:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753560058] [2023-12-25 04:59:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753560058] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 04:59:53,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 04:59:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2023-12-25 04:59:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584096705] [2023-12-25 04:59:53,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 04:59:53,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 04:59:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 04:59:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 04:59:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 04:59:53,709 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 33 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 26 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2023-12-25 05:00:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:00:28,305 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2023-12-25 05:00:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 05:00:28,305 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 26 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) Word has length 98 [2023-12-25 05:00:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:00:28,305 INFO L225 Difference]: With dead ends: 68 [2023-12-25 05:00:28,306 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 05:00:28,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=340, Invalid=1552, Unknown=0, NotChecked=0, Total=1892 [2023-12-25 05:00:28,307 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2023-12-25 05:00:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 669 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 26.3s Time] [2023-12-25 05:00:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 05:00:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 05:00:28,308 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:00:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 05:00:28,308 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2023-12-25 05:00:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:00:28,308 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 05:00:28,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 26 states have call successors, (29), 3 states have call predecessors, (29), 2 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2023-12-25 05:00:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 05:00:28,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 05:00:28,315 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:00:28,380 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 (7)] Ended with exit code 0 [2023-12-25 05:00:28,528 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:00:28,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 05:00:57,374 WARN L293 SmtUtils]: Spent 26.54s on a formula simplification. DAG size of input: 131 DAG size of output: 45 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:01:23,066 WARN L293 SmtUtils]: Spent 23.50s on a formula simplification. DAG size of input: 131 DAG size of output: 45 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:01:23,071 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 05:01:23,071 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse4 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse2 ((_ sign_extend 32) .cse4))) (let ((.cse3 (bvslt (_ bv2 64) .cse2)) (.cse1 (bvneg (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv30 64)))) (.cse0 (bvsle .cse4 (_ bv10 32))) (.cse5 (bvslt (_ bv9 64) .cse2))) (or (and (= |ULTIMATE.start_main_~c~0#1| (_ bv5 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv5 64)) .cse0 (= (_ bv0 64) (bvadd .cse1 (_ bv29370 64))) (or (bvslt (_ bv5 64) .cse2) (= (_ bv25 64) (bvmul .cse2 (_ bv5 64))))) (and (= (_ bv0 64) (bvadd .cse1 (_ bv30 64))) (or (= .cse2 (_ bv1 64)) (bvslt (_ bv1 64) .cse2)) .cse0 (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~c~0#1| (_ bv1 64))) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (_ bv7 64)) (= (_ bv0 64) (bvadd .cse1 (_ bv140280 64))) (= |ULTIMATE.start_main_~c~0#1| (_ bv7 64)) (or (= (_ bv49 64) (bvmul .cse2 (_ bv7 64))) (bvslt (_ bv7 64) .cse2))) (and (or (= (bvmul .cse2 (_ bv2 64)) (_ bv4 64)) .cse3) .cse0 (= (_ bv0 64) (bvadd .cse1 (_ bv510 64))) (= |ULTIMATE.start_main_~c~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (and .cse0 (bvsge .cse4 (_ bv0 32)) (= (_ 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 .cse0 (= (_ bv10 64) |ULTIMATE.start_main_~y~0#1|) .cse5 (= (_ bv0 64) (bvadd .cse1 (_ bv759990 64))) (= (_ bv10 64) |ULTIMATE.start_main_~c~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv4 64)) .cse0 (bvslt (_ bv3 64) .cse2) (= |ULTIMATE.start_main_~y~0#1| (_ bv4 64)) (= (_ bv0 64) (bvadd .cse1 (_ bv10620 64)))) (and .cse0 (= (_ bv3 64) |ULTIMATE.start_main_~c~0#1|) .cse3 (= (_ bv3 64) |ULTIMATE.start_main_~y~0#1|) (= (_ bv0 64) (bvadd (_ bv2940 64) .cse1))) (and .cse0 (or (= (_ bv36 64) (bvmul .cse2 (_ bv6 64))) (bvslt (_ bv6 64) .cse2)) (= (_ bv0 64) (bvadd .cse1 (_ bv68250 64))) (= |ULTIMATE.start_main_~y~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~c~0#1| (_ bv6 64))) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv8 64)) (or (bvslt (_ bv8 64) .cse2) (= (_ bv64 64) (bvmul .cse2 (_ bv8 64)))) .cse0 (= (_ bv8 64) |ULTIMATE.start_main_~y~0#1|) (= (_ bv0 64) (bvadd .cse1 (_ bv263160 64)))) (and (= (_ bv0 64) (bvadd .cse1 (_ bv459990 64))) (= |ULTIMATE.start_main_~y~0#1| (_ bv9 64)) .cse0 (or .cse5 (= (bvmul .cse2 (_ bv9 64)) (_ bv81 64))) (= |ULTIMATE.start_main_~c~0#1| (_ bv9 64))))))) [2023-12-25 05:01:23,072 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-12-25 05:01:23,072 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-12-25 05:01:23,072 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 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)))) [2023-12-25 05:01:23,072 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 05:01:23,072 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-12-25 05:01:23,072 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse4 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse2 ((_ sign_extend 32) .cse4))) (let ((.cse3 (bvslt (_ bv2 64) .cse2)) (.cse1 (bvneg (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv30 64)))) (.cse0 (bvsle .cse4 (_ bv10 32))) (.cse5 (bvslt (_ bv9 64) .cse2))) (or (and (= |ULTIMATE.start_main_~c~0#1| (_ bv5 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv5 64)) .cse0 (= (_ bv0 64) (bvadd .cse1 (_ bv29370 64))) (or (bvslt (_ bv5 64) .cse2) (= (_ bv25 64) (bvmul .cse2 (_ bv5 64))))) (and (= (_ bv0 64) (bvadd .cse1 (_ bv30 64))) (or (= .cse2 (_ bv1 64)) (bvslt (_ bv1 64) .cse2)) .cse0 (= |ULTIMATE.start_main_~y~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~c~0#1| (_ bv1 64))) (and .cse0 (= |ULTIMATE.start_main_~y~0#1| (_ bv7 64)) (= (_ bv0 64) (bvadd .cse1 (_ bv140280 64))) (= |ULTIMATE.start_main_~c~0#1| (_ bv7 64)) (or (= (_ bv49 64) (bvmul .cse2 (_ bv7 64))) (bvslt (_ bv7 64) .cse2))) (and (or (= (bvmul .cse2 (_ bv2 64)) (_ bv4 64)) .cse3) .cse0 (= (_ bv0 64) (bvadd .cse1 (_ bv510 64))) (= |ULTIMATE.start_main_~c~0#1| (_ bv2 64)) (= |ULTIMATE.start_main_~y~0#1| (_ bv2 64))) (and .cse0 (bvsge .cse4 (_ bv0 32)) (= (_ 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 .cse0 (= (_ bv10 64) |ULTIMATE.start_main_~y~0#1|) .cse5 (= (_ bv0 64) (bvadd .cse1 (_ bv759990 64))) (= (_ bv10 64) |ULTIMATE.start_main_~c~0#1|)) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv4 64)) .cse0 (bvslt (_ bv3 64) .cse2) (= |ULTIMATE.start_main_~y~0#1| (_ bv4 64)) (= (_ bv0 64) (bvadd .cse1 (_ bv10620 64)))) (and .cse0 (= (_ bv3 64) |ULTIMATE.start_main_~c~0#1|) .cse3 (= (_ bv3 64) |ULTIMATE.start_main_~y~0#1|) (= (_ bv0 64) (bvadd (_ bv2940 64) .cse1))) (and .cse0 (or (= (_ bv36 64) (bvmul .cse2 (_ bv6 64))) (bvslt (_ bv6 64) .cse2)) (= (_ bv0 64) (bvadd .cse1 (_ bv68250 64))) (= |ULTIMATE.start_main_~y~0#1| (_ bv6 64)) (= |ULTIMATE.start_main_~c~0#1| (_ bv6 64))) (and (= |ULTIMATE.start_main_~c~0#1| (_ bv8 64)) (or (bvslt (_ bv8 64) .cse2) (= (_ bv64 64) (bvmul .cse2 (_ bv8 64)))) .cse0 (= (_ bv8 64) |ULTIMATE.start_main_~y~0#1|) (= (_ bv0 64) (bvadd .cse1 (_ bv263160 64)))) (and (= (_ bv0 64) (bvadd .cse1 (_ bv459990 64))) (= |ULTIMATE.start_main_~y~0#1| (_ bv9 64)) .cse0 (or .cse5 (= (bvmul .cse2 (_ bv9 64)) (_ bv81 64))) (= |ULTIMATE.start_main_~c~0#1| (_ bv9 64))))))) [2023-12-25 05:01:23,073 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 ((.cse0 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse3 ((_ sign_extend 32) .cse0))) (let ((.cse2 (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (bvmul .cse3 |ULTIMATE.start_main_~y~0#1|))) (and (= (_ bv0 64) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv30 64))) (bvmul (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|) (_ bv6 64)) (bvmul (_ bv10 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul (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|) (_ bv15 64)) (bvneg |ULTIMATE.start_main_~y~0#1|))) (bvsle .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)) (= .cse1 .cse2) (or (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 64)) .cse3) (= (bvadd (_ bv1 64) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse2) (bvadd .cse3 .cse1)) (not (bvslt |ULTIMATE.start_main_~c~0#1| .cse3)))))))) [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-25 05:01:23,073 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 ((.cse0 ((_ sign_extend 16) |ULTIMATE.start_main_~k~0#1|))) (let ((.cse3 ((_ sign_extend 32) .cse0))) (let ((.cse2 (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse1 (bvmul .cse3 |ULTIMATE.start_main_~y~0#1|))) (and (= (_ bv0 64) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~x~0#1| (_ bv30 64))) (bvmul (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|) (_ bv6 64)) (bvmul (_ bv10 64) (bvmul |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (bvmul (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|) (_ bv15 64)) (bvneg |ULTIMATE.start_main_~y~0#1|))) (bvsle .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)) (= .cse1 .cse2) (or (bvslt (bvadd |ULTIMATE.start_main_~c~0#1| (_ bv1 64)) .cse3) (= (bvadd (_ bv1 64) (bvmul |ULTIMATE.start_main_~y~0#1| (_ bv2 64)) .cse2) (bvadd .cse3 .cse1)) (not (bvslt |ULTIMATE.start_main_~c~0#1| .cse3)))))))) [2023-12-25 05:01:23,073 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-12-25 05:01:23,073 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-12-25 05:01:23,074 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-12-25 05:01:23,074 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-12-25 05:01:23,074 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-12-25 05:01:23,077 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-25 05:01:23,079 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:01:23,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:01:23 BoogieIcfgContainer [2023-12-25 05:01:23,108 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:01:23,109 INFO L158 Benchmark]: Toolchain (without parser) took 346543.32ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 155.0MB in the beginning and 105.9MB in the end (delta: 49.1MB). Peak memory consumption was 138.7MB. Max. memory is 8.0GB. [2023-12-25 05:01:23,109 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 200.3MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:01:23,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.00ms. Allocated memory is still 200.3MB. Free memory was 154.6MB in the beginning and 143.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:01:23,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.30ms. Allocated memory is still 200.3MB. Free memory was 143.0MB in the beginning and 141.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:01:23,110 INFO L158 Benchmark]: Boogie Preprocessor took 25.71ms. Allocated memory is still 200.3MB. Free memory was 141.9MB in the beginning and 139.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:01:23,110 INFO L158 Benchmark]: RCFGBuilder took 466.47ms. Allocated memory is still 200.3MB. Free memory was 139.9MB in the beginning and 126.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 05:01:23,110 INFO L158 Benchmark]: TraceAbstraction took 345861.12ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 126.3MB in the beginning and 105.9MB in the end (delta: 20.4MB). Peak memory consumption was 110.4MB. Max. memory is 8.0GB. [2023-12-25 05:01:23,111 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.37ms. Allocated memory is still 200.3MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 160.00ms. Allocated memory is still 200.3MB. Free memory was 154.6MB in the beginning and 143.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.30ms. Allocated memory is still 200.3MB. Free memory was 143.0MB in the beginning and 141.9MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.71ms. Allocated memory is still 200.3MB. Free memory was 141.9MB in the beginning and 139.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 466.47ms. Allocated memory is still 200.3MB. Free memory was 139.9MB in the beginning and 126.7MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 345861.12ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 126.3MB in the beginning and 105.9MB in the end (delta: 20.4MB). Peak memory consumption was 110.4MB. 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: 345.8s, OverallIterations: 6, TraceHistogramMax: 13, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 117.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 54.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 61.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 1303 SdHoareTripleChecker+Invalid, 54.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1158 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 905 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 145 mSDtfsCounter, 905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 376 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 160.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 71, 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, 38 PreInvPairs, 73 NumberOfFragments, 814 HoareAnnotationTreeSize, 38 FormulaSimplifications, 1373 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FormulaSimplificationsInter, 1266 FormulaSimplificationTreeSizeReductionInter, 54.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 6.3s SatisfiabilityAnalysisTime, 165.9s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 3320 SizeOfPredicates, 11 NumberOfNonLiveVariables, 453 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 793/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: (((((((((((((((c == 5) && (y == 5)) && (k <= 10)) && (0 == ((-((x * 30)) + 29370) % 1))) && ((5 < k) || (25 == (k * 5)))) || (((((0 == ((-((x * 30)) + 30) % 1)) && ((k == 1) || (1 < k))) && (k <= 10)) && (y == 1)) && (c == 1))) || (((((k <= 10) && (y == 7)) && (0 == ((-((x * 30)) + 140280) % 1))) && (c == 7)) && ((49 == (k * 7)) || (7 < k)))) || (((((((k * 2) == 4) || (2 < k)) && (k <= 10)) && (0 == ((-((x * 30)) + 510) % 1))) && (c == 2)) && (y == 2))) || (((((k <= 10) && (k >= 0)) && (0 == x)) && (0 == y)) && (c == 0))) || (((((k <= 10) && (10 == y)) && (9 < k)) && (0 == ((-((x * 30)) + 759990) % 1))) && (10 == c))) || (((((c == 4) && (k <= 10)) && (3 < k)) && (y == 4)) && (0 == ((-((x * 30)) + 10620) % 1)))) || (((((k <= 10) && (3 == c)) && (2 < k)) && (3 == y)) && (0 == ((2940 + -((x * 30))) % 1)))) || (((((k <= 10) && ((36 == (k * 6)) || (6 < k))) && (0 == ((-((x * 30)) + 68250) % 1))) && (y == 6)) && (c == 6))) || (((((c == 8) && ((8 < k) || (64 == (k * 8)))) && (k <= 10)) && (8 == y)) && (0 == ((-((x * 30)) + 263160) % 1)))) || (((((0 == ((-((x * 30)) + 459990) % 1)) && (y == 9)) && (k <= 10)) && ((9 < k) || ((k * 9) == 81))) && (c == 9))) RESULT: Ultimate proved your program to be correct! [2023-12-25 05:01:23,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...