/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/recursive-simple/sum_10x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:28:12,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:28:12,980 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 06:28:12,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:28:12,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:28:13,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:28:13,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:28:13,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:28:13,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:28:13,004 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:28:13,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:28:13,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:28:13,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:28:13,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:28:13,005 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:28:13,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:28:13,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:28:13,006 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:28:13,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:28:13,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:28:13,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:28:13,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:28:13,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:28:13,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:28:13,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:28:13,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:28:13,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:28:13,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:28:13,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:28:13,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:28:13,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:28:13,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:28:13,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:28:13,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:28:13,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:28:13,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:28:13,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:28:13,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:28:13,013 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:28:13,013 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:28:13,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:28:13,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:28:13,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:28:13,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:28:13,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:28:13,014 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:28:13,014 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 06:28:13,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:28:13,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:28:13,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:28:13,204 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:28:13,204 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:28:13,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2023-12-25 06:28:14,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:28:14,531 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:28:14,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-2.c [2023-12-25 06:28:14,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801d39ceb/3867853a45b74e1da336a83d224eae1a/FLAG8b9795b45 [2023-12-25 06:28:14,546 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801d39ceb/3867853a45b74e1da336a83d224eae1a [2023-12-25 06:28:14,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:28:14,548 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:28:14,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:28:14,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:28:14,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:28:14,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c78aed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14, skipping insertion in model container [2023-12-25 06:28:14,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,570 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:28:14,679 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-2.c[481,494] [2023-12-25 06:28:14,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:28:14,705 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:28:14,716 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_10x0-2.c[481,494] [2023-12-25 06:28:14,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:28:14,728 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:28:14,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14 WrapperNode [2023-12-25 06:28:14,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:28:14,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:28:14,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:28:14,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:28:14,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,754 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-12-25 06:28:14,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:28:14,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:28:14,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:28:14,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:28:14,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,778 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 06:28:14,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:28:14,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:28:14,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:28:14,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:28:14,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (1/1) ... [2023-12-25 06:28:14,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:28:14,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:28:14,812 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 06:28:14,847 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 06:28:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:28:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:28:14,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:28:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:28:14,855 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-12-25 06:28:14,855 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-12-25 06:28:14,898 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:28:14,901 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:28:15,019 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:28:15,035 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:28:15,035 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:28:15,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:28:15 BoogieIcfgContainer [2023-12-25 06:28:15,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:28:15,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:28:15,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:28:15,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:28:15,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:28:14" (1/3) ... [2023-12-25 06:28:15,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32607f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:28:15, skipping insertion in model container [2023-12-25 06:28:15,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:14" (2/3) ... [2023-12-25 06:28:15,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32607f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:28:15, skipping insertion in model container [2023-12-25 06:28:15,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:28:15" (3/3) ... [2023-12-25 06:28:15,045 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-2.c [2023-12-25 06:28:15,059 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:28:15,059 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:28:15,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:28:15,104 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;@2dfd54b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:28:15,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:28:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:28:15,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:28:15,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:15,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:15,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:15,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:15,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2023-12-25 06:28:15,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780891529] [2023-12-25 06:28:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:28:15,133 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 06:28:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:15,135 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 06:28:15,162 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 06:28:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:28:15,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:28:15,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:15,284 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 06:28:15,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:28:15,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:15,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780891529] [2023-12-25 06:28:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780891529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:28:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:28:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:28:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783445610] [2023-12-25 06:28:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:28:15,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:28:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:15,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:28:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:28:15,309 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:28:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:15,380 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-12-25 06:28:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:28:15,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-25 06:28:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:15,389 INFO L225 Difference]: With dead ends: 22 [2023-12-25 06:28:15,389 INFO L226 Difference]: Without dead ends: 14 [2023-12-25 06:28:15,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 06:28:15,396 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:15,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 17 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:28:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-25 06:28:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-25 06:28:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-25 06:28:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-25 06:28:15,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2023-12-25 06:28:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:15,424 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-25 06:28:15,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 06:28:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-25 06:28:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 06:28:15,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:15,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:15,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 06:28:15,629 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 06:28:15,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:15,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2023-12-25 06:28:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:15,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444724222] [2023-12-25 06:28:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:28:15,631 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 06:28:15,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:15,632 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 06:28:15,650 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 06:28:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:28:15,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:28:15,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-25 06:28:15,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-25 06:28:15,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444724222] [2023-12-25 06:28:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444724222] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:15,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2023-12-25 06:28:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212481540] [2023-12-25 06:28:15,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:15,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 06:28:15,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 06:28:15,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:28:15,995 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:28:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:16,113 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-12-25 06:28:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:28:16,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 15 [2023-12-25 06:28:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:16,115 INFO L225 Difference]: With dead ends: 21 [2023-12-25 06:28:16,115 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 06:28:16,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:28:16,116 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:16,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:28:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 06:28:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 06:28:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 06:28:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-25 06:28:16,120 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2023-12-25 06:28:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:16,120 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-25 06:28:16,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-25 06:28:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-25 06:28:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:28:16,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:16,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:16,130 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 (3)] Ended with exit code 0 [2023-12-25 06:28:16,325 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 06:28:16,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:16,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:16,327 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2023-12-25 06:28:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785172181] [2023-12-25 06:28:16,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:28:16,330 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 06:28:16,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:16,333 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 06:28:16,334 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 06:28:16,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:28:16,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:16,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:28:16,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-25 06:28:16,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-25 06:28:16,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785172181] [2023-12-25 06:28:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785172181] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:16,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2023-12-25 06:28:16,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316694613] [2023-12-25 06:28:16,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:16,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:28:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:16,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:28:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:28:16,698 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:28:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:16,785 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-12-25 06:28:16,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:28:16,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2023-12-25 06:28:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:16,786 INFO L225 Difference]: With dead ends: 24 [2023-12-25 06:28:16,787 INFO L226 Difference]: Without dead ends: 20 [2023-12-25 06:28:16,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:28:16,788 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:16,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 35 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:28:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-25 06:28:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-25 06:28:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-25 06:28:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-12-25 06:28:16,791 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2023-12-25 06:28:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:16,791 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-12-25 06:28:16,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-25 06:28:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-12-25 06:28:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 06:28:16,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:16,792 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:16,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 06:28:17,016 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 06:28:17,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:17,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2023-12-25 06:28:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954956412] [2023-12-25 06:28:17,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:28:17,018 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 06:28:17,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:17,019 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 06:28:17,024 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 06:28:17,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:28:17,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:17,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 06:28:17,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-25 06:28:17,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:28:17,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954956412] [2023-12-25 06:28:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954956412] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:17,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 15 [2023-12-25 06:28:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455384155] [2023-12-25 06:28:17,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:28:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:28:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:28:17,809 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:28:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:17,984 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-12-25 06:28:17,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:28:17,985 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) Word has length 27 [2023-12-25 06:28:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:17,986 INFO L225 Difference]: With dead ends: 27 [2023-12-25 06:28:17,986 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 06:28:17,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:28:17,987 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:17,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 55 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:28:17,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 06:28:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 06:28:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 06:28:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-25 06:28:17,990 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2023-12-25 06:28:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:17,991 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-25 06:28:17,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-25 06:28:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-25 06:28:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:28:17,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:17,992 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:18,002 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 06:28:18,202 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 06:28:18,203 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:18,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2023-12-25 06:28:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:18,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347133] [2023-12-25 06:28:18,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:28:18,204 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 06:28:18,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:18,205 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 06:28:18,212 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 06:28:18,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:28:18,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:18,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:28:18,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-25 06:28:18,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-25 06:28:18,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347133] [2023-12-25 06:28:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347133] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:18,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2023-12-25 06:28:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538513726] [2023-12-25 06:28:18,943 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:18,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:28:18,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:28:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:28:18,945 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-25 06:28:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:19,133 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-25 06:28:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:28:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) Word has length 33 [2023-12-25 06:28:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:19,135 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:28:19,135 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:28:19,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:28:19,136 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:19,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 90 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:28:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:28:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 06:28:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 06:28:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-12-25 06:28:19,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2023-12-25 06:28:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:19,140 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-12-25 06:28:19,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10) [2023-12-25 06:28:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-12-25 06:28:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 06:28:19,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:19,141 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:19,143 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 06:28:19,343 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 06:28:19,343 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:19,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2023-12-25 06:28:19,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:19,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169143858] [2023-12-25 06:28:19,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:28:19,344 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 06:28:19,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:19,345 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 06:28:19,347 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 06:28:19,386 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:28:19,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:19,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 06:28:19,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 4 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 06:28:19,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 06:28:20,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169143858] [2023-12-25 06:28:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169143858] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:20,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 19 [2023-12-25 06:28:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336449889] [2023-12-25 06:28:20,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:20,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 06:28:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 06:28:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:28:20,965 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 19 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 18 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-25 06:28:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:21,303 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-12-25 06:28:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:28:21,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 18 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) Word has length 39 [2023-12-25 06:28:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:21,306 INFO L225 Difference]: With dead ends: 33 [2023-12-25 06:28:21,306 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 06:28:21,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:28:21,307 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:21,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 119 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:28:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 06:28:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 06:28:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-25 06:28:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-12-25 06:28:21,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2023-12-25 06:28:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:21,311 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-12-25 06:28:21,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 18 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-25 06:28:21,311 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-12-25 06:28:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 06:28:21,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:21,312 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:21,317 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 06:28:21,517 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 06:28:21,518 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:21,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2023-12-25 06:28:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793225839] [2023-12-25 06:28:21,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:28:21,518 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 06:28:21,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:21,520 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 06:28:21,521 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 06:28:21,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:28:21,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:21,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 06:28:21,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-25 06:28:21,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-25 06:28:23,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:23,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793225839] [2023-12-25 06:28:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793225839] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:23,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 21 [2023-12-25 06:28:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252199761] [2023-12-25 06:28:23,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:23,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 06:28:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 06:28:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:28:23,513 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 21 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 20 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 06:28:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:23,868 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-12-25 06:28:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:28:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 20 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 45 [2023-12-25 06:28:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:23,870 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:28:23,870 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:28:23,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2023-12-25 06:28:23,871 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 73 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:23,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:28:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:28:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 06:28:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 06:28:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-12-25 06:28:23,876 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2023-12-25 06:28:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:23,877 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-12-25 06:28:23,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 20 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-25 06:28:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-12-25 06:28:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 06:28:23,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:23,878 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:23,885 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 06:28:24,082 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 06:28:24,082 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:24,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:24,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2023-12-25 06:28:24,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:24,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788174748] [2023-12-25 06:28:24,083 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:28:24,084 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 06:28:24,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:24,085 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 06:28:24,086 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 06:28:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:28:24,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:28:24,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-25 06:28:24,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 06:28:25,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:25,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788174748] [2023-12-25 06:28:25,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788174748] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:25,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:25,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2023-12-25 06:28:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709108214] [2023-12-25 06:28:25,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:25,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 06:28:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:25,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 06:28:25,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:28:25,552 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-25 06:28:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:25,832 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2023-12-25 06:28:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:28:25,833 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 51 [2023-12-25 06:28:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:25,835 INFO L225 Difference]: With dead ends: 39 [2023-12-25 06:28:25,835 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:28:25,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2023-12-25 06:28:25,862 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 88 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:25,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 164 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:28:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:28:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:28:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-25 06:28:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-12-25 06:28:25,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2023-12-25 06:28:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:25,874 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-12-25 06:28:25,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-25 06:28:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-12-25 06:28:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 06:28:25,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:25,877 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:25,880 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 06:28:26,079 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 06:28:26,080 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:26,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2023-12-25 06:28:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876335851] [2023-12-25 06:28:26,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:28:26,081 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 06:28:26,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:26,082 INFO L229 MonitoredProcess]: Starting monitored process 10 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 06:28:26,083 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 (10)] Waiting until timeout for monitored process [2023-12-25 06:28:26,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:28:26,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:26,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 06:28:26,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-25 06:28:26,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-25 06:28:27,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876335851] [2023-12-25 06:28:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876335851] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:27,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2023-12-25 06:28:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640704803] [2023-12-25 06:28:27,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:27,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:28:27,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:28:27,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:28:27,876 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-25 06:28:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:28,213 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-12-25 06:28:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:28:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) Word has length 57 [2023-12-25 06:28:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:28,215 INFO L225 Difference]: With dead ends: 42 [2023-12-25 06:28:28,215 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 06:28:28,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2023-12-25 06:28:28,216 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:28,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:28:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 06:28:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 06:28:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-25 06:28:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2023-12-25 06:28:28,219 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2023-12-25 06:28:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:28,219 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2023-12-25 06:28:28,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 9 states have return successors, (18), 9 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-25 06:28:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2023-12-25 06:28:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 06:28:28,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:28,220 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:28,225 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 06:28:28,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 06:28:28,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:28,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2023-12-25 06:28:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:28,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169958409] [2023-12-25 06:28:28,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:28:28,424 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 06:28:28,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:28,432 INFO L229 MonitoredProcess]: Starting monitored process 11 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 06:28:28,434 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 (11)] Waiting until timeout for monitored process [2023-12-25 06:28:28,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-25 06:28:28,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:28,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 06:28:28,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 8 proven. 126 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-25 06:28:28,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 06:28:32,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169958409] [2023-12-25 06:28:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169958409] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:32,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 27 [2023-12-25 06:28:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259665101] [2023-12-25 06:28:32,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:32,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 06:28:32,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:32,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 06:28:32,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2023-12-25 06:28:32,142 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 27 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 26 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (20), 10 states have call predecessors, (20), 13 states have call successors, (20) [2023-12-25 06:28:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:32,784 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2023-12-25 06:28:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:28:32,784 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 26 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (20), 10 states have call predecessors, (20), 13 states have call successors, (20) Word has length 63 [2023-12-25 06:28:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:32,785 INFO L225 Difference]: With dead ends: 45 [2023-12-25 06:28:32,785 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 06:28:32,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2023-12-25 06:28:32,786 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 80 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:32,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 247 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:28:32,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 06:28:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 06:28:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-25 06:28:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2023-12-25 06:28:32,790 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2023-12-25 06:28:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:32,790 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2023-12-25 06:28:32,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 26 states have internal predecessors, (48), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (20), 10 states have call predecessors, (20), 13 states have call successors, (20) [2023-12-25 06:28:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2023-12-25 06:28:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 06:28:32,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:32,791 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:32,808 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:28:32,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 06:28:32,998 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:32,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:32,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2023-12-25 06:28:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919854429] [2023-12-25 06:28:32,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:28:32,999 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 06:28:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:33,000 INFO L229 MonitoredProcess]: Starting monitored process 12 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 06:28:33,032 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 (12)] Waiting until timeout for monitored process [2023-12-25 06:28:33,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:28:33,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 06:28:33,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:28:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:28:33,130 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:28:33,130 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:28:33,130 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:28:33,138 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 (12)] Forceful destruction successful, exit code 0 [2023-12-25 06:28:33,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 06:28:33,335 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1] [2023-12-25 06:28:33,338 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:28:33,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:28:33 BoogieIcfgContainer [2023-12-25 06:28:33,366 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:28:33,367 INFO L158 Benchmark]: Toolchain (without parser) took 18818.44ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 221.3MB in the beginning and 218.3MB in the end (delta: 3.1MB). Peak memory consumption was 59.5MB. Max. memory is 8.0GB. [2023-12-25 06:28:33,367 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 205.5MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:28:33,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.31ms. Allocated memory is still 274.7MB. Free memory was 221.3MB in the beginning and 210.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:28:33,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.84ms. Allocated memory is still 274.7MB. Free memory was 210.6MB in the beginning and 209.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:28:33,367 INFO L158 Benchmark]: Boogie Preprocessor took 30.68ms. Allocated memory is still 274.7MB. Free memory was 209.2MB in the beginning and 207.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:28:33,367 INFO L158 Benchmark]: RCFGBuilder took 249.56ms. Allocated memory is still 274.7MB. Free memory was 207.5MB in the beginning and 197.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:28:33,368 INFO L158 Benchmark]: TraceAbstraction took 18326.56ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 196.2MB in the beginning and 218.3MB in the end (delta: -22.1MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2023-12-25 06:28:33,368 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.67ms. Allocated memory is still 205.5MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.31ms. Allocated memory is still 274.7MB. Free memory was 221.3MB in the beginning and 210.6MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.84ms. Allocated memory is still 274.7MB. Free memory was 210.6MB in the beginning and 209.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.68ms. Allocated memory is still 274.7MB. Free memory was 209.2MB in the beginning and 207.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.56ms. Allocated memory is still 274.7MB. Free memory was 207.5MB in the beginning and 197.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18326.56ms. Allocated memory was 274.7MB in the beginning and 330.3MB in the end (delta: 55.6MB). Free memory was 196.2MB in the beginning and 218.3MB in the end (delta: -22.1MB). Peak memory consumption was 34.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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 10; [L15] int b = 0; VAL [a=10, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=10, \old(n)=0, \result=10, m=10, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=1, m=9, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=2, m=8, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=3, m=7, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=4, m=6, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=5, m=5, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=6, m=4, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=7, m=3, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=8, m=2, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=9, m=1, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=10, m=0, n=10] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=10, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b VAL [a=10, b=0, result=10] [L18] reach_error() VAL [a=10, b=0, result=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 434 mSDsluCounter, 1133 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 982 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1185 IncrementalHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 151 mSDtfsCounter, 1185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=10, InterpolantAutomatonStates: 99, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 4636 SizeOfPredicates, 55 NumberOfNonLiveVariables, 720 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 615/1800 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 RESULT: Ultimate proved your program to be incorrect! [2023-12-25 06:28:33,398 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...