/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/sqrt1-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:07:30,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:07:30,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 05:07:30,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:07:30,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:07:30,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:07:30,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:07:30,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:07:30,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:07:30,216 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:07:30,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:07:30,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:07:30,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:07:30,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:07:30,217 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:07:30,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:07:30,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:07:30,218 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:07:30,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:07:30,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:07:30,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:07:30,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:07:30,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:07:30,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:07:30,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:07:30,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:07:30,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:07:30,220 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:07:30,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:07:30,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:07:30,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:07:30,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:07:30,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:07:30,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:07:30,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:07:30,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:07:30,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:07:30,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:07:30,222 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:07:30,223 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 05:07:30,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:07:30,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:07:30,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:07:30,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:07:30,446 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:07:30,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2023-12-25 05:07:31,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:07:31,588 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:07:31,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2023-12-25 05:07:31,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74171f451/f16e4db136a74aae99d4fe02b54d7d7b/FLAG5a55fd6f1 [2023-12-25 05:07:31,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74171f451/f16e4db136a74aae99d4fe02b54d7d7b [2023-12-25 05:07:31,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:07:31,609 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:07:31,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:07:31,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:07:31,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:07:31,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3708de71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31, skipping insertion in model container [2023-12-25 05:07:31,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,631 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:07:31,726 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/sqrt1-ll_unwindbound1.c[520,533] [2023-12-25 05:07:31,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:07:31,746 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:07:31,754 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/sqrt1-ll_unwindbound1.c[520,533] [2023-12-25 05:07:31,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:07:31,773 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:07:31,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31 WrapperNode [2023-12-25 05:07:31,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:07:31,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:07:31,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:07:31,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:07:31,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,797 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2023-12-25 05:07:31,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:07:31,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:07:31,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:07:31,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:07:31,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 05:07:31,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:07:31,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:07:31,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:07:31,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:07:31,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (1/1) ... [2023-12-25 05:07:31,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:07:31,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:07:31,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 05:07:31,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 05:07:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:07:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:07:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:07:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:07:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 05:07:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 05:07:31,949 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:07:31,951 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:07:32,066 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:07:32,083 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:07:32,083 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:07:32,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:07:32 BoogieIcfgContainer [2023-12-25 05:07:32,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:07:32,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:07:32,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:07:32,088 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:07:32,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:07:31" (1/3) ... [2023-12-25 05:07:32,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3687b62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:07:32, skipping insertion in model container [2023-12-25 05:07:32,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:07:31" (2/3) ... [2023-12-25 05:07:32,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3687b62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:07:32, skipping insertion in model container [2023-12-25 05:07:32,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:07:32" (3/3) ... [2023-12-25 05:07:32,091 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.c [2023-12-25 05:07:32,106 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:07:32,107 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:07:32,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:07:32,148 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;@5a7fd87c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:07:32,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:07:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:07:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 05:07:32,164 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:32,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 05:07:32,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:32,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1811081999, now seen corresponding path program 1 times [2023-12-25 05:07:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972486512] [2023-12-25 05:07:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:32,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:32,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:32,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 05:07:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:32,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:07:32,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:07:32,335 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:07:32,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:32,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972486512] [2023-12-25 05:07:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972486512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:07:32,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:07:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:07:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325018785] [2023-12-25 05:07:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:07:32,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:07:32,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:07:32,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:07:32,369 INFO L87 Difference]: Start difference. First operand has 18 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:07:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:32,398 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2023-12-25 05:07:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:07:32,400 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-25 05:07:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:32,404 INFO L225 Difference]: With dead ends: 35 [2023-12-25 05:07:32,404 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 05:07:32,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:07:32,410 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:32,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:07:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 05:07:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 05:07:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:07:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2023-12-25 05:07:32,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 6 [2023-12-25 05:07:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:32,436 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-12-25 05:07:32,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:07:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2023-12-25 05:07:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 05:07:32,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:32,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:32,443 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 (2)] Ended with exit code 0 [2023-12-25 05:07:32,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:32,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:32,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -772994646, now seen corresponding path program 1 times [2023-12-25 05:07:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605974139] [2023-12-25 05:07:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:32,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 05:07:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:32,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 05:07:32,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:07:32,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:07:32,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605974139] [2023-12-25 05:07:32,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605974139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:07:32,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:07:32,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:07:32,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490309029] [2023-12-25 05:07:32,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:07:32,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 05:07:32,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 05:07:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:07:32,716 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:07:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:32,733 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-25 05:07:32,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 05:07:32,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 05:07:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:32,734 INFO L225 Difference]: With dead ends: 27 [2023-12-25 05:07:32,734 INFO L226 Difference]: Without dead ends: 18 [2023-12-25 05:07:32,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:07:32,735 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:32,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:07:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-25 05:07:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-25 05:07:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:07:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-12-25 05:07:32,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 7 [2023-12-25 05:07:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:32,740 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-12-25 05:07:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:07:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-12-25 05:07:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 05:07:32,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:32,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:32,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 05:07:32,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:32,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:32,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash -771326350, now seen corresponding path program 1 times [2023-12-25 05:07:32,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:32,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226962300] [2023-12-25 05:07:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:32,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:32,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 05:07:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:33,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:07:33,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:07:33,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:07:33,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226962300] [2023-12-25 05:07:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226962300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:07:33,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:07:33,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 05:07:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327429980] [2023-12-25 05:07:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:07:33,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:07:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:33,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:07:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:07:33,059 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:07:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:33,264 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2023-12-25 05:07:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:07:33,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 05:07:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:33,282 INFO L225 Difference]: With dead ends: 31 [2023-12-25 05:07:33,283 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 05:07:33,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 05:07:33,284 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:33,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:07:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 05:07:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-25 05:07:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 05:07:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2023-12-25 05:07:33,291 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2023-12-25 05:07:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:33,291 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-12-25 05:07:33,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:07:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2023-12-25 05:07:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 05:07:33,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:33,300 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:33,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 05:07:33,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:33,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:33,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1515882446, now seen corresponding path program 1 times [2023-12-25 05:07:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501940289] [2023-12-25 05:07:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:33,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:33,514 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:33,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 05:07:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:33,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:07:33,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:07:33,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:07:33,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501940289] [2023-12-25 05:07:33,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501940289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:07:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:07:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:07:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930598690] [2023-12-25 05:07:33,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:07:33,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:07:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:33,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:07:33,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:07:33,673 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 05:07:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:34,240 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-12-25 05:07:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:07:34,241 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-25 05:07:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:34,242 INFO L225 Difference]: With dead ends: 35 [2023-12-25 05:07:34,242 INFO L226 Difference]: Without dead ends: 33 [2023-12-25 05:07:34,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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 05:07:34,243 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:34,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 05:07:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-25 05:07:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-25 05:07:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 05:07:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-25 05:07:34,249 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2023-12-25 05:07:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:34,249 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-25 05:07:34,250 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 05:07:34,250 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-25 05:07:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:07:34,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:34,250 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:34,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 05:07:34,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:34,454 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:34,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:34,454 INFO L85 PathProgramCache]: Analyzing trace with hash -549515342, now seen corresponding path program 1 times [2023-12-25 05:07:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593156010] [2023-12-25 05:07:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:34,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:34,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:34,456 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:34,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 05:07:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:34,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:07:34,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:34,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 05:07:34,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:07:34,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:34,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593156010] [2023-12-25 05:07:34,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593156010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:07:34,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:07:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:07:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69010042] [2023-12-25 05:07:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:07:34,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:07:34,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:07:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:07:34,590 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:07:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:35,147 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-25 05:07:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:07:35,149 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 05:07:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:35,150 INFO L225 Difference]: With dead ends: 39 [2023-12-25 05:07:35,150 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 05:07:35,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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 05:07:35,151 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:35,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 05:07:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 05:07:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-25 05:07:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 05:07:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-25 05:07:35,156 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2023-12-25 05:07:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:35,156 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-25 05:07:35,156 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), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:07:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-25 05:07:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 05:07:35,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:35,157 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:35,173 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 (6)] Ended with exit code 0 [2023-12-25 05:07:35,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:35,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:35,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 906206763, now seen corresponding path program 1 times [2023-12-25 05:07:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296164652] [2023-12-25 05:07:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:35,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:35,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:35,370 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:35,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 05:07:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:35,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 05:07:35,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:07:35,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:07:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 05:07:35,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:35,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296164652] [2023-12-25 05:07:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296164652] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:07:35,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:07:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:07:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452512019] [2023-12-25 05:07:35,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:07:35,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:07:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:35,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:07:35,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:07:35,680 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:07:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:07:35,903 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2023-12-25 05:07:35,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:07:35,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-25 05:07:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:07:35,912 INFO L225 Difference]: With dead ends: 40 [2023-12-25 05:07:35,912 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 05:07:35,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:07:35,913 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:07:35,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:07:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 05:07:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 05:07:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 5 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 05:07:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-12-25 05:07:35,921 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2023-12-25 05:07:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:07:35,922 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-12-25 05:07:35,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:07:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-12-25 05:07:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 05:07:35,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:07:35,922 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:07:35,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 05:07:36,123 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:07:36,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:07:36,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:07:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 247503605, now seen corresponding path program 1 times [2023-12-25 05:07:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:07:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006263432] [2023-12-25 05:07:36,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:07:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:07:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:07:36,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:07:36,129 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 (8)] Waiting until timeout for monitored process [2023-12-25 05:07:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:07:36,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 05:07:36,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:07:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 05:07:36,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:07:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 05:07:40,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:07:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006263432] [2023-12-25 05:07:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006263432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:07:40,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:07:40,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 05:07:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708082956] [2023-12-25 05:07:40,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:07:40,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 05:07:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:07:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 05:07:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:07:40,207 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 05:07:46,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:50,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:54,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:07:58,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:02,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:06,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:10,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:14,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:18,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:08:21,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:08:21,186 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2023-12-25 05:08:21,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 05:08:21,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 30 [2023-12-25 05:08:21,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:08:21,195 INFO L225 Difference]: With dead ends: 75 [2023-12-25 05:08:21,195 INFO L226 Difference]: Without dead ends: 70 [2023-12-25 05:08:21,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-25 05:08:21,196 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 37 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.8s IncrementalHoareTripleChecker+Time [2023-12-25 05:08:21,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 95 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 79 Invalid, 9 Unknown, 0 Unchecked, 39.8s Time] [2023-12-25 05:08:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-25 05:08:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2023-12-25 05:08:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 05:08:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2023-12-25 05:08:21,211 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 30 [2023-12-25 05:08:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:08:21,211 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2023-12-25 05:08:21,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 05:08:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2023-12-25 05:08:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 05:08:21,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:08:21,212 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:08:21,218 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 05:08:21,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:08:21,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:08:21,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:08:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1308369620, now seen corresponding path program 1 times [2023-12-25 05:08:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:08:21,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033551966] [2023-12-25 05:08:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:08:21,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:08:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:08:21,422 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:08:21,425 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 (9)] Waiting until timeout for monitored process [2023-12-25 05:08:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:08:21,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:08:21,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:08:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 74 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-25 05:08:21,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:08:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 05:08:21,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:08:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033551966] [2023-12-25 05:08:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033551966] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:08:21,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:08:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 05:08:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856305002] [2023-12-25 05:08:21,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:08:21,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 05:08:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:08:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 05:08:21,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-25 05:08:21,775 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 05:08:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:08:22,299 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2023-12-25 05:08:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:08:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 53 [2023-12-25 05:08:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:08:22,300 INFO L225 Difference]: With dead ends: 66 [2023-12-25 05:08:22,300 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 05:08:22,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:08:22,301 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:08:22,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 05:08:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 05:08:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 05:08:22,301 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:08:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 05:08:22,301 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2023-12-25 05:08:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:08:22,301 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 05:08:22,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-25 05:08:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 05:08:22,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 05:08:22,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:08:22,314 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 (9)] Forceful destruction successful, exit code 0 [2023-12-25 05:08:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:08:22,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 05:08:22,644 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2023-12-25 05:08:22,644 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 05:08:22,644 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64))) [2023-12-25 05:08:22,645 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64))) [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-12-25 05:08:22,645 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64)))) [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 05:08:22,645 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64))) [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2023-12-25 05:08:22,645 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64)) (= ~counter~0 (_ bv0 32))) (and (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64)))) [2023-12-25 05:08:22,645 INFO L895 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64)))) [2023-12-25 05:08:22,645 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64)))) [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-12-25 05:08:22,645 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-12-25 05:08:22,646 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-12-25 05:08:22,646 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-12-25 05:08:22,648 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:08:22,649 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:08:22,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:08:22 BoogieIcfgContainer [2023-12-25 05:08:22,661 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:08:22,661 INFO L158 Benchmark]: Toolchain (without parser) took 51051.92ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 153.6MB in the beginning and 145.2MB in the end (delta: 8.4MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2023-12-25 05:08:22,661 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 190.8MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:08:22,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.97ms. Allocated memory is still 190.8MB. Free memory was 153.6MB in the beginning and 141.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:08:22,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.70ms. Allocated memory is still 190.8MB. Free memory was 141.7MB in the beginning and 140.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:08:22,662 INFO L158 Benchmark]: Boogie Preprocessor took 29.28ms. Allocated memory is still 190.8MB. Free memory was 140.3MB in the beginning and 138.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 05:08:22,662 INFO L158 Benchmark]: RCFGBuilder took 256.31ms. Allocated memory is still 190.8MB. Free memory was 138.5MB in the beginning and 125.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 05:08:22,662 INFO L158 Benchmark]: TraceAbstraction took 50575.22ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 125.3MB in the beginning and 145.2MB in the end (delta: -19.9MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-25 05:08:22,663 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.15ms. Allocated memory is still 190.8MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.97ms. Allocated memory is still 190.8MB. Free memory was 153.6MB in the beginning and 141.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.70ms. Allocated memory is still 190.8MB. Free memory was 141.7MB in the beginning and 140.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.28ms. Allocated memory is still 190.8MB. Free memory was 140.3MB in the beginning and 138.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 256.31ms. Allocated memory is still 190.8MB. Free memory was 138.5MB in the beginning and 125.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 50575.22ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 125.3MB in the beginning and 145.2MB in the end (delta: -19.9MB). Peak memory consumption was 19.3MB. 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: 14]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.5s, OverallIterations: 8, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 41.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 41.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 142 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 262 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=7, InterpolantAutomatonStates: 41, 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, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 42 PreInvPairs, 53 NumberOfFragments, 127 HoareAnnotationTreeSize, 42 FormulaSimplifications, 65 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 35 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 716 SizeOfPredicates, 7 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 384/394 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: 30]: Loop Invariant Derived loop invariant: (((((a == 0) && (s == 1)) && (t == 1)) && (counter == 0)) || ((((s == 4) && (3 == t)) && (counter == 1)) && (a == 1))) RESULT: Ultimate proved your program to be correct! [2023-12-25 05:08:22,694 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...