/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/egcd-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 01:31:57,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 01:31:57,533 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 01:31:57,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 01:31:57,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 01:31:57,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 01:31:57,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 01:31:57,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 01:31:57,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 01:31:57,570 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 01:31:57,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 01:31:57,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 01:31:57,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 01:31:57,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 01:31:57,573 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 01:31:57,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 01:31:57,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 01:31:57,574 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 01:31:57,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 01:31:57,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 01:31:57,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 01:31:57,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 01:31:57,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 01:31:57,576 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 01:31:57,576 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 01:31:57,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 01:31:57,576 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 01:31:57,577 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 01:31:57,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 01:31:57,577 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 01:31:57,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 01:31:57,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 01:31:57,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 01:31:57,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 01:31:57,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:31:57,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 01:31:57,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 01:31:57,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 01:31:57,579 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 01:31:57,579 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 01:31:57,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 01:31:57,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 01:31:57,580 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 01:31:57,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 01:31:57,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 01:31:57,580 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 01:31:57,580 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 01:31:57,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 01:31:57,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 01:31:57,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 01:31:57,851 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 01:31:57,852 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 01:31:57,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2023-12-25 01:31:58,998 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 01:31:59,218 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 01:31:59,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_valuebound1.c [2023-12-25 01:31:59,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961bc7dae/9463f5a5983143daba098fd734ea1f7c/FLAGaac8e5921 [2023-12-25 01:31:59,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961bc7dae/9463f5a5983143daba098fd734ea1f7c [2023-12-25 01:31:59,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 01:31:59,247 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 01:31:59,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 01:31:59,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 01:31:59,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 01:31:59,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e481c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59, skipping insertion in model container [2023-12-25 01:31:59,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,277 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 01:31:59,432 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/egcd-ll_valuebound1.c[489,502] [2023-12-25 01:31:59,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:31:59,486 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 01:31:59,500 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/egcd-ll_valuebound1.c[489,502] [2023-12-25 01:31:59,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 01:31:59,524 INFO L206 MainTranslator]: Completed translation [2023-12-25 01:31:59,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59 WrapperNode [2023-12-25 01:31:59,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 01:31:59,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 01:31:59,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 01:31:59,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 01:31:59,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,560 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-25 01:31:59,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 01:31:59,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 01:31:59,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 01:31:59,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 01:31:59,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,589 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 01:31:59,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 01:31:59,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 01:31:59,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 01:31:59,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 01:31:59,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (1/1) ... [2023-12-25 01:31:59,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 01:31:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 01:31:59,633 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 01:31:59,642 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 01:31:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 01:31:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 01:31:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-25 01:31:59,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-25 01:31:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 01:31:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 01:31:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 01:31:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 01:31:59,742 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 01:31:59,747 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 01:31:59,974 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 01:32:00,004 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 01:32:00,005 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 01:32:00,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:32:00 BoogieIcfgContainer [2023-12-25 01:32:00,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 01:32:00,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 01:32:00,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 01:32:00,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 01:32:00,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 01:31:59" (1/3) ... [2023-12-25 01:32:00,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5e698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:32:00, skipping insertion in model container [2023-12-25 01:32:00,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 01:31:59" (2/3) ... [2023-12-25 01:32:00,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5e698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 01:32:00, skipping insertion in model container [2023-12-25 01:32:00,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 01:32:00" (3/3) ... [2023-12-25 01:32:00,015 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_valuebound1.c [2023-12-25 01:32:00,031 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 01:32:00,032 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 01:32:00,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 01:32:00,089 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;@1aa60297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 01:32:00,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 01:32:00,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-25 01:32:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-25 01:32:00,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:32:00,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:32:00,101 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:32:00,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:32:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1514925992, now seen corresponding path program 1 times [2023-12-25 01:32:00,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:32:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994043340] [2023-12-25 01:32:00,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:32:00,120 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 01:32:00,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:32:00,123 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 01:32:00,151 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 01:32:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:32:00,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 01:32:00,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:32:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:32:00,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:32:00,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:32:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994043340] [2023-12-25 01:32:00,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994043340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:32:00,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:32:00,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 01:32:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197978489] [2023-12-25 01:32:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:32:00,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:32:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:32:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:32:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 01:32:00,509 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:32:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:32:01,524 INFO L93 Difference]: Finished difference Result 71 states and 127 transitions. [2023-12-25 01:32:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 01:32:01,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2023-12-25 01:32:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:32:01,547 INFO L225 Difference]: With dead ends: 71 [2023-12-25 01:32:01,547 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 01:32:01,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 01:32:01,553 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 01:32:01,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 01:32:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 01:32:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-12-25 01:32:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 01:32:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2023-12-25 01:32:01,590 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 57 transitions. Word has length 28 [2023-12-25 01:32:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:32:01,591 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 57 transitions. [2023-12-25 01:32:01,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-25 01:32:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 57 transitions. [2023-12-25 01:32:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 01:32:01,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:32:01,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:32:01,600 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 01:32:01,799 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 01:32:01,800 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:32:01,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:32:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1720779372, now seen corresponding path program 1 times [2023-12-25 01:32:01,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:32:01,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200475578] [2023-12-25 01:32:01,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:32:01,802 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 01:32:01,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:32:01,804 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 01:32:01,804 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 01:32:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:32:01,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:32:01,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:32:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 01:32:02,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:32:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 01:32:06,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:32:06,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200475578] [2023-12-25 01:32:06,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200475578] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:32:06,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:32:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:32:06,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413972773] [2023-12-25 01:32:06,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:32:06,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:32:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:32:06,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:32:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:32:06,742 INFO L87 Difference]: Start difference. First operand 40 states and 57 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:32:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:32:13,210 INFO L93 Difference]: Finished difference Result 65 states and 97 transitions. [2023-12-25 01:32:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:32:13,243 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2023-12-25 01:32:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:32:13,246 INFO L225 Difference]: With dead ends: 65 [2023-12-25 01:32:13,246 INFO L226 Difference]: Without dead ends: 63 [2023-12-25 01:32:13,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:32:13,248 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-25 01:32:13,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-25 01:32:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-25 01:32:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2023-12-25 01:32:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-25 01:32:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2023-12-25 01:32:13,270 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 33 [2023-12-25 01:32:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:32:13,271 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2023-12-25 01:32:13,271 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 01:32:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2023-12-25 01:32:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 01:32:13,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:32:13,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:32:13,286 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 01:32:13,483 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 01:32:13,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:32:13,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:32:13,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1127883240, now seen corresponding path program 1 times [2023-12-25 01:32:13,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:32:13,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724570121] [2023-12-25 01:32:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:32:13,485 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 01:32:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:32:13,486 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 01:32:13,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 01:32:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:32:13,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 01:32:13,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:32:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-25 01:32:14,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 01:32:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 01:32:19,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:32:19,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724570121] [2023-12-25 01:32:19,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724570121] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 01:32:19,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 01:32:19,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-25 01:32:19,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580808662] [2023-12-25 01:32:19,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:32:19,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 01:32:19,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:32:19,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 01:32:19,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:32:19,853 INFO L87 Difference]: Start difference. First operand 56 states and 82 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:32:22,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 01:32:27,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:32:27,762 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2023-12-25 01:32:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 01:32:27,777 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2023-12-25 01:32:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:32:27,778 INFO L225 Difference]: With dead ends: 63 [2023-12-25 01:32:27,778 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 01:32:27,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:32:27,780 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-25 01:32:27,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-12-25 01:32:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 01:32:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-25 01:32:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 33 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-25 01:32:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2023-12-25 01:32:27,797 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 38 [2023-12-25 01:32:27,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:32:27,797 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-12-25 01:32:27,798 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 01:32:27,798 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2023-12-25 01:32:27,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-25 01:32:27,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:32:27,799 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:32:27,810 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 01:32:28,010 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 01:32:28,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:32:28,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:32:28,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1622474211, now seen corresponding path program 1 times [2023-12-25 01:32:28,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:32:28,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737473882] [2023-12-25 01:32:28,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:32:28,012 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 01:32:28,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:32:28,013 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 01:32:28,015 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 01:32:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:32:28,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 01:32:28,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:32:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 01:32:29,106 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:32:29,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:32:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737473882] [2023-12-25 01:32:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737473882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:32:29,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:32:29,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 01:32:29,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754385114] [2023-12-25 01:32:29,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:32:29,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 01:32:29,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:32:29,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 01:32:29,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:32:29,108 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 01:32:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:32:30,179 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2023-12-25 01:32:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 01:32:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 44 [2023-12-25 01:32:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:32:30,180 INFO L225 Difference]: With dead ends: 83 [2023-12-25 01:32:30,180 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 01:32:30,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-25 01:32:30,182 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 01:32:30,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 139 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 01:32:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 01:32:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 01:32:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 01:32:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-12-25 01:32:30,192 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 44 [2023-12-25 01:32:30,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:32:30,193 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-12-25 01:32:30,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 01:32:30,193 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-12-25 01:32:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 01:32:30,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:32:30,194 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:32:30,206 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 01:32:30,400 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 01:32:30,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:32:30,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:32:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash -399804329, now seen corresponding path program 1 times [2023-12-25 01:32:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:32:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770124072] [2023-12-25 01:32:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 01:32:30,402 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 01:32:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:32:30,403 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 01:32:30,405 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 01:32:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 01:32:30,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 01:32:30,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:32:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 01:32:31,542 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 01:32:31,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 01:32:31,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770124072] [2023-12-25 01:32:31,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770124072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 01:32:31,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 01:32:31,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-25 01:32:31,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349675338] [2023-12-25 01:32:31,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 01:32:31,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 01:32:31,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 01:32:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 01:32:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-25 01:32:31,544 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 01:32:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:32:32,020 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-12-25 01:32:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 01:32:32,021 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2023-12-25 01:32:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:32:32,021 INFO L225 Difference]: With dead ends: 38 [2023-12-25 01:32:32,021 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 01:32:32,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-12-25 01:32:32,023 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 01:32:32,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 94 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 01:32:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 01:32:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 01:32:32,024 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 01:32:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 01:32:32,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2023-12-25 01:32:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:32:32,024 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 01:32:32,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-25 01:32:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 01:32:32,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 01:32:32,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:32:32,040 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 01:32:32,236 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 01:32:32,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 01:32:37,977 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 52) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvsge v_subst_2 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) v_subst_2)) (bvsle v_subst_2 (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~b~0#1| (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) (exists ((v_subst_1 (_ BitVec 32))) (and (bvsle v_subst_1 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) v_subst_1)) (bvsge v_subst_1 (_ bv1 32))))) [2023-12-25 01:32:37,977 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 01:32:37,977 INFO L895 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) [2023-12-25 01:32:37,977 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (= |ULTIMATE.start_main_~b~0#1| (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) [2023-12-25 01:32:37,977 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvsge v_subst_2 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) v_subst_2)) (bvsle v_subst_2 (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~b~0#1| (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)))) (exists ((v_subst_1 (_ BitVec 32))) (and (bvsle v_subst_1 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) v_subst_1)) (bvsge v_subst_1 (_ bv1 32))))) [2023-12-25 01:32:37,977 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 01:32:37,978 INFO L899 garLoopResultBuilder]: For program point L38(lines 35 52) no Hoare annotation was computed. [2023-12-25 01:32:37,978 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvsge v_subst_2 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) v_subst_2)) (bvsle v_subst_2 (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvsle v_subst_1 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) v_subst_1)) (bvsge v_subst_1 (_ bv1 32))))) [2023-12-25 01:32:37,978 INFO L895 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvsge v_subst_2 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) v_subst_2)) (bvsle v_subst_2 (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvsle v_subst_1 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) v_subst_1)) (bvsge v_subst_1 (_ bv1 32))))) [2023-12-25 01:32:37,978 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-12-25 01:32:37,978 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-25 01:32:37,978 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32))) [2023-12-25 01:32:37,978 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (and (bvsge |ULTIMATE.start_main_~x~0#1| (_ bv0 32)) (bvsle |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (bvsle |ULTIMATE.start_main_~x~0#1| (_ bv1 32)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv0 32))) [2023-12-25 01:32:37,978 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~b~0#1| (bvadd (bvmul |ULTIMATE.start_main_~q~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvmul |ULTIMATE.start_main_~s~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|))))) [2023-12-25 01:32:37,979 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2023-12-25 01:32:37,979 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2023-12-25 01:32:37,979 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-12-25 01:32:37,979 INFO L895 garLoopResultBuilder]: At program point L43-2(lines 35 52) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvsge v_subst_2 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) v_subst_2)) (bvsle v_subst_2 (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvsle v_subst_1 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) v_subst_1)) (bvsge v_subst_1 (_ bv1 32))))) [2023-12-25 01:32:37,979 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (exists ((v_subst_2 (_ BitVec 32))) (and (bvsge v_subst_2 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) v_subst_2)) (bvsle v_subst_2 (_ bv1 32)))) (= (_ bv0 64) |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)) (exists ((v_subst_1 (_ BitVec 32))) (and (bvsle v_subst_1 (_ bv1 32)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) v_subst_1)) (bvsge v_subst_1 (_ bv1 32))))) [2023-12-25 01:32:37,979 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 7 9) the Hoare annotation is: true [2023-12-25 01:32:37,979 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-12-25 01:32:37,979 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2023-12-25 01:32:37,979 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2023-12-25 01:32:37,979 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 13) no Hoare annotation was computed. [2023-12-25 01:32:37,980 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 14) no Hoare annotation was computed. [2023-12-25 01:32:37,980 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 16) no Hoare annotation was computed. [2023-12-25 01:32:37,980 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 10 16) the Hoare annotation is: true [2023-12-25 01:32:37,980 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 10 16) no Hoare annotation was computed. [2023-12-25 01:32:37,980 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-12-25 01:32:37,983 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-25 01:32:37,985 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:32:37,995 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv32 :: (~bvsge~32(v_subst_2, 1bv32) && ~a~0 == ~sign_extend~64~32(v_subst_2)) && ~bvsle~32(v_subst_2, 1bv32)) could not be translated [2023-12-25 01:32:37,996 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_subst_1 : bv32 :: (~bvsle~32(v_subst_1, 1bv32) && ~b~0 == ~sign_extend~64~32(v_subst_1)) && ~bvsge~32(v_subst_1, 1bv32)) could not be translated [2023-12-25 01:32:37,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:32:37 BoogieIcfgContainer [2023-12-25 01:32:37,997 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:32:37,997 INFO L158 Benchmark]: Toolchain (without parser) took 38750.66ms. Allocated memory is still 256.9MB. Free memory was 203.6MB in the beginning and 136.1MB in the end (delta: 67.6MB). Peak memory consumption was 68.6MB. Max. memory is 8.0GB. [2023-12-25 01:32:37,997 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 190.8MB. Free memory was 138.1MB in the beginning and 138.0MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:32:37,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.73ms. Allocated memory is still 256.9MB. Free memory was 203.6MB in the beginning and 191.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:32:37,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.73ms. Allocated memory is still 256.9MB. Free memory was 191.6MB in the beginning and 190.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:32:37,998 INFO L158 Benchmark]: Boogie Preprocessor took 40.16ms. Allocated memory is still 256.9MB. Free memory was 190.0MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 01:32:37,998 INFO L158 Benchmark]: RCFGBuilder took 403.91ms. Allocated memory is still 256.9MB. Free memory was 188.4MB in the beginning and 174.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 01:32:37,998 INFO L158 Benchmark]: TraceAbstraction took 37987.93ms. Allocated memory is still 256.9MB. Free memory was 174.3MB in the beginning and 136.1MB in the end (delta: 38.2MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. [2023-12-25 01:32:38,000 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.16ms. Allocated memory is still 190.8MB. Free memory was 138.1MB in the beginning and 138.0MB in the end (delta: 136.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.73ms. Allocated memory is still 256.9MB. Free memory was 203.6MB in the beginning and 191.6MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.73ms. Allocated memory is still 256.9MB. Free memory was 191.6MB in the beginning and 190.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.16ms. Allocated memory is still 256.9MB. Free memory was 190.0MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 403.91ms. Allocated memory is still 256.9MB. Free memory was 188.4MB in the beginning and 174.8MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 37987.93ms. Allocated memory is still 256.9MB. Free memory was 174.3MB in the beginning and 136.1MB in the end (delta: 38.2MB). Peak memory consumption was 39.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_2 : bv32 :: (~bvsge~32(v_subst_2, 1bv32) && ~a~0 == ~sign_extend~64~32(v_subst_2)) && ~bvsle~32(v_subst_2, 1bv32)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_subst_1 : bv32 :: (~bvsle~32(v_subst_1, 1bv32) && ~b~0 == ~sign_extend~64~32(v_subst_1)) && ~bvsge~32(v_subst_1, 1bv32)) could not be translated * 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: 13]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.9s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 15.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 440 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 137 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=3, InterpolantAutomatonStates: 39, 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, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 48 PreInvPairs, 59 NumberOfFragments, 356 HoareAnnotationTreeSize, 48 FormulaSimplifications, 100 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FormulaSimplificationsInter, 115 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 256 ConstructedInterpolants, 6 QuantifiedInterpolants, 1132 SizeOfPredicates, 21 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 223/238 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: 35]: Loop Invariant Derived loop invariant: ((((((s == 1) && (a == x)) && (0 == r)) && (b == y)) && (q == 0)) && (p == 1)) RESULT: Ultimate proved your program to be correct! [2023-12-25 01:32:38,048 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...