/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_20x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:28:36,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:28:36,809 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:36,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:28:36,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:28:36,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:28:36,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:28:36,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:28:36,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:28:36,840 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:28:36,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:28:36,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:28:36,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:28:36,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:28:36,842 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:28:36,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:28:36,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:28:36,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:28:36,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:28:36,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:28:36,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:28:36,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:28:36,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:28:36,845 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:28:36,845 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:28:36,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:28:36,845 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:28:36,846 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:28:36,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:28:36,846 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:28:36,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:28:36,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:28:36,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:28:36,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:28:36,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:28:36,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:28:36,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:28:36,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:28:36,848 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:28:36,848 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:28:36,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:28:36,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:28:36,849 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:28:36,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:28:36,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:28:36,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:28:36,849 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:37,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:28:37,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:28:37,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:28:37,079 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:28:37,081 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:28:37,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2023-12-25 06:28:38,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:28:38,321 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:28:38,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_20x0-1.c [2023-12-25 06:28:38,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d04c8e3d/426354b136964a06bf9278d92ac4985d/FLAG62aab0e2d [2023-12-25 06:28:38,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d04c8e3d/426354b136964a06bf9278d92ac4985d [2023-12-25 06:28:38,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:28:38,339 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:28:38,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:28:38,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:28:38,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:28:38,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:28:38" (1/1) ... [2023-12-25 06:28:38,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2752d28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:38, skipping insertion in model container [2023-12-25 06:28:38,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:28:38" (1/1) ... [2023-12-25 06:28:38,364 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:28:38,463 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_20x0-1.c[481,494] [2023-12-25 06:28:38,468 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:28:38,480 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:28:38,491 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_20x0-1.c[481,494] [2023-12-25 06:28:38,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:28:38,502 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:28:38,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:38 WrapperNode [2023-12-25 06:28:38,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:28:38,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:28:38,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:28:38,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:28:38,509 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:38" (1/1) ... [2023-12-25 06:28:38,515 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:38" (1/1) ... [2023-12-25 06:28:38,529 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-12-25 06:28:38,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:28:38,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:28:38,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:28:38,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:28:38,537 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:38" (1/1) ... [2023-12-25 06:28:38,537 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:38" (1/1) ... [2023-12-25 06:28:38,540 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:38" (1/1) ... [2023-12-25 06:28:38,547 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:38,548 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:38" (1/1) ... [2023-12-25 06:28:38,548 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:38" (1/1) ... [2023-12-25 06:28:38,555 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:38" (1/1) ... [2023-12-25 06:28:38,556 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:38" (1/1) ... [2023-12-25 06:28:38,560 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:38" (1/1) ... [2023-12-25 06:28:38,561 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:38" (1/1) ... [2023-12-25 06:28:38,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:28:38,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:28:38,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:28:38,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:28:38,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:38" (1/1) ... [2023-12-25 06:28:38,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:28:38,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:28:38,589 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:38,601 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:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:28:38,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:28:38,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:28:38,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:28:38,618 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-12-25 06:28:38,618 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-12-25 06:28:38,659 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:28:38,661 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:28:38,773 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:28:38,807 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:28:38,807 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:28:38,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:28:38 BoogieIcfgContainer [2023-12-25 06:28:38,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:28:38,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:28:38,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:28:38,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:28:38,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:28:38" (1/3) ... [2023-12-25 06:28:38,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234d01c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:28:38, skipping insertion in model container [2023-12-25 06:28:38,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:28:38" (2/3) ... [2023-12-25 06:28:38,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234d01c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:28:38, skipping insertion in model container [2023-12-25 06:28:38,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:28:38" (3/3) ... [2023-12-25 06:28:38,817 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2023-12-25 06:28:38,843 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:28:38,843 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:28:38,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:28:38,889 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;@17f79d93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:28:38,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:28:38,899 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:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:28:38,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:38,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:38,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:38,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:38,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1493244868, now seen corresponding path program 1 times [2023-12-25 06:28:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:38,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3857533] [2023-12-25 06:28:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:28:38,917 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:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:38,919 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:38,940 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:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:28:38,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:28:38,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:39,016 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:39,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:28:39,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:39,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3857533] [2023-12-25 06:28:39,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3857533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:28:39,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:28:39,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:28:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040553132] [2023-12-25 06:28:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:28:39,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:28:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:28:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:28:39,039 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:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:39,106 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-12-25 06:28:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:28:39,108 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:39,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:39,112 INFO L225 Difference]: With dead ends: 22 [2023-12-25 06:28:39,112 INFO L226 Difference]: Without dead ends: 14 [2023-12-25 06:28:39,121 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:39,124 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:39,125 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:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-25 06:28:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-25 06:28:39,152 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:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-25 06:28:39,154 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2023-12-25 06:28:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:39,154 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-25 06:28:39,154 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:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-25 06:28:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-25 06:28:39,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:39,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:39,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 06:28:39,358 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:39,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:39,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:39,360 INFO L85 PathProgramCache]: Analyzing trace with hash -642736818, now seen corresponding path program 1 times [2023-12-25 06:28:39,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:39,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216226585] [2023-12-25 06:28:39,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:28:39,360 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:39,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:39,362 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:39,363 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:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:28:39,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:28:39,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:39,502 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:39,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:39,718 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:39,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:39,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216226585] [2023-12-25 06:28:39,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216226585] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:39,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2023-12-25 06:28:39,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651326971] [2023-12-25 06:28:39,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:39,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 06:28:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:39,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 06:28:39,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:28:39,726 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:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:39,807 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-12-25 06:28:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:28:39,807 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:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:39,809 INFO L225 Difference]: With dead ends: 21 [2023-12-25 06:28:39,809 INFO L226 Difference]: Without dead ends: 17 [2023-12-25 06:28:39,810 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:39,811 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.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:39,812 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.0s Time] [2023-12-25 06:28:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-25 06:28:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-25 06:28:39,818 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:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-12-25 06:28:39,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2023-12-25 06:28:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:39,819 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-12-25 06:28:39,819 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:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-12-25 06:28:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:28:39,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:39,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:39,835 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:40,024 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:40,025 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:40,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2123675004, now seen corresponding path program 2 times [2023-12-25 06:28:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:40,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834677618] [2023-12-25 06:28:40,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:28:40,027 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:40,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:40,028 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:40,041 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:40,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:28:40,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:40,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:28:40,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:40,129 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:40,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:40,404 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:40,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834677618] [2023-12-25 06:28:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834677618] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:40,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2023-12-25 06:28:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31572759] [2023-12-25 06:28:40,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:40,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:28:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:28:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:28:40,407 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:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:40,520 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2023-12-25 06:28:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:28:40,520 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:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:40,521 INFO L225 Difference]: With dead ends: 24 [2023-12-25 06:28:40,521 INFO L226 Difference]: Without dead ends: 20 [2023-12-25 06:28:40,521 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:40,522 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:40,522 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:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-25 06:28:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-25 06:28:40,525 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:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2023-12-25 06:28:40,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2023-12-25 06:28:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:40,526 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2023-12-25 06:28:40,526 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:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2023-12-25 06:28:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-25 06:28:40,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:40,526 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:40,547 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:40,730 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:40,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:40,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:40,733 INFO L85 PathProgramCache]: Analyzing trace with hash 54189198, now seen corresponding path program 3 times [2023-12-25 06:28:40,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:40,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116135608] [2023-12-25 06:28:40,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:28:40,734 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:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:40,735 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:40,736 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:40,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:28:40,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:40,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 06:28:40,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:40,929 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:40,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:41,662 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:41,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:41,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116135608] [2023-12-25 06:28:41,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116135608] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:41,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:41,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 15 [2023-12-25 06:28:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348321620] [2023-12-25 06:28:41,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:41,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:28:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:28:41,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:28:41,664 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:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:41,837 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-12-25 06:28:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:28:41,839 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:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:41,840 INFO L225 Difference]: With dead ends: 27 [2023-12-25 06:28:41,840 INFO L226 Difference]: Without dead ends: 23 [2023-12-25 06:28:41,840 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:41,841 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:41,841 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:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-25 06:28:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-25 06:28:41,844 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:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-25 06:28:41,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2023-12-25 06:28:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:41,845 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-25 06:28:41,845 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:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-25 06:28:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:28:41,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:41,846 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:41,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 06:28:42,048 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:42,048 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:42,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1269749436, now seen corresponding path program 4 times [2023-12-25 06:28:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830218701] [2023-12-25 06:28:42,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:28:42,049 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:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:42,050 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:42,052 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:42,080 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:28:42,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:42,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:28:42,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:42,180 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:42,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:42,754 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:42,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830218701] [2023-12-25 06:28:42,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830218701] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:42,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:42,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2023-12-25 06:28:42,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607203423] [2023-12-25 06:28:42,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:42,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:28:42,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:42,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:28:42,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:28:42,756 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:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:42,930 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-12-25 06:28:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:28:42,931 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:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:42,931 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:28:42,931 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:28:42,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:28:42,932 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:42,932 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:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:28:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 06:28:42,935 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:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-12-25 06:28:42,936 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2023-12-25 06:28:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:42,936 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-12-25 06:28:42,936 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:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-12-25 06:28:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-25 06:28:42,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:42,937 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:42,951 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:43,139 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:43,140 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:43,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -4035634, now seen corresponding path program 5 times [2023-12-25 06:28:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909455527] [2023-12-25 06:28:43,141 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:28:43,141 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:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:43,142 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:43,143 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:43,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:28:43,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:43,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 06:28:43,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:43,379 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:43,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:44,649 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:44,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:44,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909455527] [2023-12-25 06:28:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909455527] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:44,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 19 [2023-12-25 06:28:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445629015] [2023-12-25 06:28:44,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 06:28:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:44,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 06:28:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:28:44,651 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:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:44,941 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2023-12-25 06:28:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:28:44,943 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:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:44,944 INFO L225 Difference]: With dead ends: 33 [2023-12-25 06:28:44,944 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 06:28:44,944 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:44,945 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:44,945 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:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 06:28:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-25 06:28:44,948 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:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-12-25 06:28:44,948 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2023-12-25 06:28:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:44,948 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-12-25 06:28:44,949 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:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-12-25 06:28:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 06:28:44,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:44,949 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:44,957 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:45,154 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:45,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:45,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:45,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1047611388, now seen corresponding path program 6 times [2023-12-25 06:28:45,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:45,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432589113] [2023-12-25 06:28:45,156 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:28:45,156 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:45,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:45,157 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:45,158 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:45,201 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:28:45,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:45,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 06:28:45,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:45,459 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:45,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:47,034 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:47,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432589113] [2023-12-25 06:28:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432589113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:47,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:47,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 21 [2023-12-25 06:28:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148630299] [2023-12-25 06:28:47,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:47,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 06:28:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:47,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 06:28:47,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:28:47,038 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:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:47,395 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2023-12-25 06:28:47,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:28:47,396 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:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:47,397 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:28:47,397 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:28:47,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2023-12-25 06:28:47,398 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:47,398 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:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:28:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-25 06:28:47,401 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:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-12-25 06:28:47,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2023-12-25 06:28:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:47,402 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-12-25 06:28:47,402 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:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-12-25 06:28:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-25 06:28:47,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:47,403 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:47,408 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:47,609 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:47,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:47,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1466649358, now seen corresponding path program 7 times [2023-12-25 06:28:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423017218] [2023-12-25 06:28:47,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:28:47,610 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:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:47,611 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:47,624 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:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:28:47,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 06:28:47,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:47,828 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:47,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:49,059 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:49,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:49,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423017218] [2023-12-25 06:28:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423017218] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:49,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2023-12-25 06:28:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980946480] [2023-12-25 06:28:49,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:49,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 06:28:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 06:28:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:28:49,061 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:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:49,335 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2023-12-25 06:28:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:28:49,336 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:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:49,336 INFO L225 Difference]: With dead ends: 39 [2023-12-25 06:28:49,336 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:28:49,337 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:49,337 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.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:49,337 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.2s Time] [2023-12-25 06:28:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:28:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:28:49,341 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:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-12-25 06:28:49,341 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2023-12-25 06:28:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:49,341 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-12-25 06:28:49,341 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:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-12-25 06:28:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 06:28:49,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:49,342 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:49,347 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 (9)] Ended with exit code 0 [2023-12-25 06:28:49,545 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:49,545 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:49,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash 335541956, now seen corresponding path program 8 times [2023-12-25 06:28:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935092321] [2023-12-25 06:28:49,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:28:49,546 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:49,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:49,550 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:49,556 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:49,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:28:49,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:49,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-25 06:28:49,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:49,869 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:49,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:51,302 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:51,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:51,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935092321] [2023-12-25 06:28:51,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935092321] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:51,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2023-12-25 06:28:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952790521] [2023-12-25 06:28:51,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:51,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:28:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:28:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:28:51,305 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:51,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:51,715 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-12-25 06:28:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:28:51,716 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:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:51,717 INFO L225 Difference]: With dead ends: 42 [2023-12-25 06:28:51,717 INFO L226 Difference]: Without dead ends: 38 [2023-12-25 06:28:51,717 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:51,718 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.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:51,718 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.3s Time] [2023-12-25 06:28:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-25 06:28:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-25 06:28:51,722 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:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2023-12-25 06:28:51,723 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2023-12-25 06:28:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:51,723 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2023-12-25 06:28:51,723 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:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2023-12-25 06:28:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-25 06:28:51,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:51,729 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:51,736 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:51,933 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:51,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:51,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash -682001842, now seen corresponding path program 9 times [2023-12-25 06:28:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005635041] [2023-12-25 06:28:51,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:28:51,935 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:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:51,936 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:51,967 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:52,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-25 06:28:52,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:52,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-25 06:28:52,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:52,468 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:52,468 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:55,473 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:55,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005635041] [2023-12-25 06:28:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005635041] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:55,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 27 [2023-12-25 06:28:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423789223] [2023-12-25 06:28:55,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:55,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 06:28:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 06:28:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2023-12-25 06:28:55,475 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:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:56,105 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2023-12-25 06:28:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:28:56,106 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:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:56,107 INFO L225 Difference]: With dead ends: 45 [2023-12-25 06:28:56,107 INFO L226 Difference]: Without dead ends: 41 [2023-12-25 06:28:56,108 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:56,108 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.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:56,108 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.4s Time] [2023-12-25 06:28:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-25 06:28:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-25 06:28:56,111 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:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2023-12-25 06:28:56,111 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2023-12-25 06:28:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:56,112 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2023-12-25 06:28:56,116 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:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2023-12-25 06:28:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-25 06:28:56,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:56,117 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:56,120 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 (11)] Ended with exit code 0 [2023-12-25 06:28:56,320 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:56,320 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:56,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1904272772, now seen corresponding path program 10 times [2023-12-25 06:28:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777283349] [2023-12-25 06:28:56,321 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:28:56,321 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:56,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:56,322 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:56,323 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:56,387 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:28:56,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:56,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 06:28:56,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:28:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-12-25 06:28:56,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:28:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-25 06:28:58,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:28:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777283349] [2023-12-25 06:28:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777283349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:28:58,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:28:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 27 [2023-12-25 06:28:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591847897] [2023-12-25 06:28:58,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:28:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 06:28:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:28:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 06:28:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2023-12-25 06:28:58,892 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2023-12-25 06:28:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:28:59,338 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2023-12-25 06:28:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:28:59,338 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) Word has length 69 [2023-12-25 06:28:59,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:28:59,339 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:28:59,339 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 06:28:59,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2023-12-25 06:28:59,340 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:28:59,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 308 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:28:59,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 06:28:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-25 06:28:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-25 06:28:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2023-12-25 06:28:59,344 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2023-12-25 06:28:59,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:28:59,344 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2023-12-25 06:28:59,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (22), 11 states have call predecessors, (22), 13 states have call successors, (22) [2023-12-25 06:28:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2023-12-25 06:28:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 06:28:59,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:28:59,345 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:28:59,350 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:59,546 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:59,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:28:59,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:28:59,546 INFO L85 PathProgramCache]: Analyzing trace with hash -776930930, now seen corresponding path program 11 times [2023-12-25 06:28:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:28:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206345616] [2023-12-25 06:28:59,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:28:59,547 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:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:28:59,548 INFO L229 MonitoredProcess]: Starting monitored process 13 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:59,549 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 (13)] Waiting until timeout for monitored process [2023-12-25 06:28:59,652 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-12-25 06:28:59,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:28:59,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 06:28:59,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 10 proven. 187 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2023-12-25 06:29:00,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-25 06:29:04,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206345616] [2023-12-25 06:29:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206345616] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:04,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28] total 31 [2023-12-25 06:29:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234730011] [2023-12-25 06:29:04,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:04,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-25 06:29:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-25 06:29:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2023-12-25 06:29:04,413 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 31 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) [2023-12-25 06:29:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:05,201 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2023-12-25 06:29:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:29:05,202 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) Word has length 75 [2023-12-25 06:29:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:05,202 INFO L225 Difference]: With dead ends: 51 [2023-12-25 06:29:05,202 INFO L226 Difference]: Without dead ends: 47 [2023-12-25 06:29:05,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=314, Invalid=1492, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 06:29:05,203 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 173 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:05,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 365 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:29:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-25 06:29:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-25 06:29:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-25 06:29:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2023-12-25 06:29:05,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2023-12-25 06:29:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:05,208 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2023-12-25 06:29:05,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 2.074074074074074) internal successors, (56), 30 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (24), 12 states have call predecessors, (24), 15 states have call successors, (24) [2023-12-25 06:29:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2023-12-25 06:29:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-25 06:29:05,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:05,209 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:05,215 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 (13)] Ended with exit code 0 [2023-12-25 06:29:05,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:29:05,412 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:05,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1158839228, now seen corresponding path program 12 times [2023-12-25 06:29:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442314883] [2023-12-25 06:29:05,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:29:05,413 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:29:05,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:05,420 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29:05,421 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 (14)] Waiting until timeout for monitored process [2023-12-25 06:29:05,524 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2023-12-25 06:29:05,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:29:05,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-25 06:29:05,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 11 proven. 222 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2023-12-25 06:29:06,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-25 06:29:11,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442314883] [2023-12-25 06:29:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442314883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:11,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30] total 33 [2023-12-25 06:29:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164241660] [2023-12-25 06:29:11,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:11,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 06:29:11,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 06:29:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 06:29:11,043 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 33 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 32 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (26), 13 states have call predecessors, (26), 16 states have call successors, (26) [2023-12-25 06:29:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:12,051 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2023-12-25 06:29:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:29:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 32 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (26), 13 states have call predecessors, (26), 16 states have call successors, (26) Word has length 81 [2023-12-25 06:29:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:12,053 INFO L225 Difference]: With dead ends: 54 [2023-12-25 06:29:12,053 INFO L226 Difference]: Without dead ends: 50 [2023-12-25 06:29:12,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=352, Invalid=1718, Unknown=0, NotChecked=0, Total=2070 [2023-12-25 06:29:12,054 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 265 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:12,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 426 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-25 06:29:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-25 06:29:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-25 06:29:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-25 06:29:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2023-12-25 06:29:12,057 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2023-12-25 06:29:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:12,058 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2023-12-25 06:29:12,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 32 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (26), 13 states have call predecessors, (26), 16 states have call successors, (26) [2023-12-25 06:29:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2023-12-25 06:29:12,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-25 06:29:12,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:12,058 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:12,062 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 (14)] Forceful destruction successful, exit code 0 [2023-12-25 06:29:12,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:29:12,262 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:12,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1570097358, now seen corresponding path program 13 times [2023-12-25 06:29:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:12,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758562952] [2023-12-25 06:29:12,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:29:12,263 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:29:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:12,264 INFO L229 MonitoredProcess]: Starting monitored process 15 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:29:12,268 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 (15)] Waiting until timeout for monitored process [2023-12-25 06:29:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:29:12,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 06:29:12,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-25 06:29:12,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-25 06:29:16,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:16,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758562952] [2023-12-25 06:29:16,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758562952] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:16,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 31] total 33 [2023-12-25 06:29:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513774241] [2023-12-25 06:29:16,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-25 06:29:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-25 06:29:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2023-12-25 06:29:16,132 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-25 06:29:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:16,804 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2023-12-25 06:29:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-25 06:29:16,804 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) Word has length 87 [2023-12-25 06:29:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:16,805 INFO L225 Difference]: With dead ends: 57 [2023-12-25 06:29:16,805 INFO L226 Difference]: Without dead ends: 53 [2023-12-25 06:29:16,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=1818, Unknown=0, NotChecked=0, Total=2162 [2023-12-25 06:29:16,806 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 397 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:16,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 481 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:29:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-25 06:29:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-25 06:29:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-25 06:29:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2023-12-25 06:29:16,810 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2023-12-25 06:29:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:16,810 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2023-12-25 06:29:16,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (28), 14 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-25 06:29:16,810 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2023-12-25 06:29:16,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-25 06:29:16,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:16,811 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:16,830 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 (15)] Ended with exit code 0 [2023-12-25 06:29:17,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:29:17,014 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:17,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:17,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1407069436, now seen corresponding path program 14 times [2023-12-25 06:29:17,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:17,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020563184] [2023-12-25 06:29:17,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:29:17,015 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:29:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:17,016 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:17,051 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 (16)] Waiting until timeout for monitored process [2023-12-25 06:29:17,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:29:17,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:29:17,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 06:29:17,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-12-25 06:29:17,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-12-25 06:29:21,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:21,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020563184] [2023-12-25 06:29:21,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020563184] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:21,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 35 [2023-12-25 06:29:21,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521717209] [2023-12-25 06:29:21,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:21,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-25 06:29:21,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-25 06:29:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2023-12-25 06:29:21,384 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2023-12-25 06:29:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:22,165 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2023-12-25 06:29:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 06:29:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) Word has length 93 [2023-12-25 06:29:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:22,166 INFO L225 Difference]: With dead ends: 60 [2023-12-25 06:29:22,166 INFO L226 Difference]: Without dead ends: 56 [2023-12-25 06:29:22,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 06:29:22,167 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 305 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:22,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 556 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:29:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-25 06:29:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-25 06:29:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-25 06:29:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-12-25 06:29:22,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2023-12-25 06:29:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:22,171 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-12-25 06:29:22,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (30), 15 states have call predecessors, (30), 17 states have call successors, (30) [2023-12-25 06:29:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-12-25 06:29:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-25 06:29:22,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:22,171 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:22,178 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 (16)] Ended with exit code 0 [2023-12-25 06:29:22,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:29:22,372 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:22,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1758730226, now seen corresponding path program 15 times [2023-12-25 06:29:22,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:22,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937648245] [2023-12-25 06:29:22,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:29:22,373 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:29:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:22,374 INFO L229 MonitoredProcess]: Starting monitored process 17 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:29:22,375 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 (17)] Waiting until timeout for monitored process [2023-12-25 06:29:22,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-12-25 06:29:22,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:29:22,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-25 06:29:22,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 14 proven. 345 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2023-12-25 06:29:23,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-25 06:29:30,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937648245] [2023-12-25 06:29:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937648245] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:30,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 36] total 39 [2023-12-25 06:29:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240308968] [2023-12-25 06:29:30,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:30,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 06:29:30,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 06:29:30,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 06:29:30,671 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 38 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (32), 16 states have call predecessors, (32), 19 states have call successors, (32) [2023-12-25 06:29:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:31,897 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2023-12-25 06:29:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:29:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 38 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (32), 16 states have call predecessors, (32), 19 states have call successors, (32) Word has length 99 [2023-12-25 06:29:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:31,898 INFO L225 Difference]: With dead ends: 63 [2023-12-25 06:29:31,899 INFO L226 Difference]: Without dead ends: 59 [2023-12-25 06:29:31,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=478, Invalid=2492, Unknown=0, NotChecked=0, Total=2970 [2023-12-25 06:29:31,900 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 198 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:31,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 582 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 06:29:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-25 06:29:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-25 06:29:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-25 06:29:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2023-12-25 06:29:31,903 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2023-12-25 06:29:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:31,903 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2023-12-25 06:29:31,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 38 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (32), 16 states have call predecessors, (32), 19 states have call successors, (32) [2023-12-25 06:29:31,904 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2023-12-25 06:29:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-25 06:29:31,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:31,904 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:31,915 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 06:29:32,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:29:32,105 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:32,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1678126652, now seen corresponding path program 16 times [2023-12-25 06:29:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060768472] [2023-12-25 06:29:32,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:29:32,106 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:29:32,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:32,107 INFO L229 MonitoredProcess]: Starting monitored process 18 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:29:32,142 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 (18)] Waiting until timeout for monitored process [2023-12-25 06:29:32,235 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:29:32,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:29:32,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-25 06:29:32,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2023-12-25 06:29:32,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-12-25 06:29:38,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060768472] [2023-12-25 06:29:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060768472] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:38,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 37] total 39 [2023-12-25 06:29:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141069901] [2023-12-25 06:29:38,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:38,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 06:29:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:38,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 06:29:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 06:29:38,870 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2023-12-25 06:29:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:39,990 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2023-12-25 06:29:39,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:29:39,991 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) Word has length 105 [2023-12-25 06:29:39,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:39,992 INFO L225 Difference]: With dead ends: 66 [2023-12-25 06:29:39,992 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 06:29:39,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=467, Invalid=2613, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 06:29:39,993 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 212 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:39,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 651 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-25 06:29:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 06:29:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-25 06:29:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-25 06:29:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2023-12-25 06:29:39,997 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2023-12-25 06:29:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:39,998 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2023-12-25 06:29:39,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (34), 17 states have call predecessors, (34), 19 states have call successors, (34) [2023-12-25 06:29:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2023-12-25 06:29:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 06:29:39,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:39,999 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:40,013 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 (18)] Forceful destruction successful, exit code 0 [2023-12-25 06:29:40,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:29:40,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:40,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:40,205 INFO L85 PathProgramCache]: Analyzing trace with hash -543729842, now seen corresponding path program 17 times [2023-12-25 06:29:40,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:40,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612354104] [2023-12-25 06:29:40,205 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:29:40,205 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:29:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:40,210 INFO L229 MonitoredProcess]: Starting monitored process 19 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:29:40,213 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 (19)] Waiting until timeout for monitored process [2023-12-25 06:29:40,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2023-12-25 06:29:40,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:29:40,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-25 06:29:40,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 16 proven. 442 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2023-12-25 06:29:41,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:29:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 06:29:50,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:29:50,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612354104] [2023-12-25 06:29:50,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612354104] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:29:50,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:29:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 40] total 43 [2023-12-25 06:29:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585042675] [2023-12-25 06:29:50,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:29:50,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 06:29:50,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:29:50,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 06:29:50,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1664, Unknown=0, NotChecked=0, Total=1806 [2023-12-25 06:29:50,572 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 43 states, 39 states have (on average 2.051282051282051) internal successors, (80), 42 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) [2023-12-25 06:29:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:29:52,111 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2023-12-25 06:29:52,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-25 06:29:52,112 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 2.051282051282051) internal successors, (80), 42 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) Word has length 111 [2023-12-25 06:29:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:29:52,113 INFO L225 Difference]: With dead ends: 69 [2023-12-25 06:29:52,113 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 06:29:52,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=572, Invalid=3088, Unknown=0, NotChecked=0, Total=3660 [2023-12-25 06:29:52,114 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 510 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 06:29:52,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 724 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 06:29:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 06:29:52,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-12-25 06:29:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-25 06:29:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2023-12-25 06:29:52,117 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2023-12-25 06:29:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:29:52,118 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2023-12-25 06:29:52,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 2.051282051282051) internal successors, (80), 42 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (36), 18 states have call predecessors, (36), 21 states have call successors, (36) [2023-12-25 06:29:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2023-12-25 06:29:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-25 06:29:52,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:29:52,119 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:29:52,139 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 (19)] Forceful destruction successful, exit code 0 [2023-12-25 06:29:52,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:29:52,322 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:29:52,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:29:52,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1011974276, now seen corresponding path program 18 times [2023-12-25 06:29:52,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:29:52,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134909107] [2023-12-25 06:29:52,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:29:52,323 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:29:52,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:29:52,324 INFO L229 MonitoredProcess]: Starting monitored process 20 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:29:52,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-25 06:29:52,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2023-12-25 06:29:52,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:29:52,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-25 06:29:52,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:29:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 17 proven. 495 refuted. 0 times theorem prover too weak. 478 trivial. 0 not checked. [2023-12-25 06:29:53,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:30:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-12-25 06:30:04,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:30:04,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134909107] [2023-12-25 06:30:04,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134909107] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:30:04,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:30:04,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 42] total 45 [2023-12-25 06:30:04,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284707088] [2023-12-25 06:30:04,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:30:04,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-25 06:30:04,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:30:04,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-25 06:30:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 06:30:04,451 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 45 states, 41 states have (on average 2.048780487804878) internal successors, (84), 44 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (38), 19 states have call predecessors, (38), 22 states have call successors, (38) [2023-12-25 06:30:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:30:06,515 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2023-12-25 06:30:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 06:30:06,516 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 2.048780487804878) internal successors, (84), 44 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (38), 19 states have call predecessors, (38), 22 states have call successors, (38) Word has length 117 [2023-12-25 06:30:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:30:06,516 INFO L225 Difference]: With dead ends: 72 [2023-12-25 06:30:06,516 INFO L226 Difference]: Without dead ends: 68 [2023-12-25 06:30:06,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=622, Invalid=3410, Unknown=0, NotChecked=0, Total=4032 [2023-12-25 06:30:06,518 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 500 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:30:06,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 803 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 06:30:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-25 06:30:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-25 06:30:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-25 06:30:06,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2023-12-25 06:30:06,522 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2023-12-25 06:30:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:30:06,522 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2023-12-25 06:30:06,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 2.048780487804878) internal successors, (84), 44 states have internal predecessors, (84), 22 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (38), 19 states have call predecessors, (38), 22 states have call successors, (38) [2023-12-25 06:30:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2023-12-25 06:30:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-25 06:30:06,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:30:06,524 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:30:06,532 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 (20)] Ended with exit code 0 [2023-12-25 06:30:06,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:30:06,731 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:30:06,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:30:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 486282894, now seen corresponding path program 19 times [2023-12-25 06:30:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:30:06,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140187283] [2023-12-25 06:30:06,732 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:30:06,732 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:30:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:30:06,733 INFO L229 MonitoredProcess]: Starting monitored process 21 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:30:06,734 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 (21)] Waiting until timeout for monitored process [2023-12-25 06:30:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:30:06,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-25 06:30:06,920 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:30:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-12-25 06:30:07,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:30:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-25 06:30:15,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:30:15,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140187283] [2023-12-25 06:30:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140187283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:30:15,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:30:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 43] total 45 [2023-12-25 06:30:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817803197] [2023-12-25 06:30:15,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:30:15,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-25 06:30:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:30:15,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-25 06:30:15,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2023-12-25 06:30:15,301 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) [2023-12-25 06:30:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:30:16,688 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-12-25 06:30:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-25 06:30:16,689 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) Word has length 123 [2023-12-25 06:30:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:30:16,690 INFO L225 Difference]: With dead ends: 75 [2023-12-25 06:30:16,690 INFO L226 Difference]: Without dead ends: 71 [2023-12-25 06:30:16,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=608, Invalid=3552, Unknown=0, NotChecked=0, Total=4160 [2023-12-25 06:30:16,691 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 328 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-25 06:30:16,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 896 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-25 06:30:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-25 06:30:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-25 06:30:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 48 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2023-12-25 06:30:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2023-12-25 06:30:16,694 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2023-12-25 06:30:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:30:16,694 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2023-12-25 06:30:16,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (40), 20 states have call predecessors, (40), 22 states have call successors, (40) [2023-12-25 06:30:16,695 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2023-12-25 06:30:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-25 06:30:16,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:30:16,695 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:30:16,703 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 (21)] Forceful destruction successful, exit code 0 [2023-12-25 06:30:16,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:30:16,896 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:30:16,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:30:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1510268740, now seen corresponding path program 20 times [2023-12-25 06:30:16,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:30:16,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429285274] [2023-12-25 06:30:16,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:30:16,897 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:30:16,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:30:16,898 INFO L229 MonitoredProcess]: Starting monitored process 22 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:30:16,922 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 (22)] Waiting until timeout for monitored process [2023-12-25 06:30:17,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:30:17,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 06:30:17,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:30:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:30:17,225 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:30:17,225 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:30:17,226 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:30:17,232 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 (22)] Forceful destruction successful, exit code 0 [2023-12-25 06:30:17,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:30:17,430 INFO L445 BasicCegarLoop]: Path program histogram: [20, 1] [2023-12-25 06:30:17,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:30:17,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:30:17 BoogieIcfgContainer [2023-12-25 06:30:17,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:30:17,459 INFO L158 Benchmark]: Toolchain (without parser) took 99119.53ms. Allocated memory was 212.9MB in the beginning and 288.4MB in the end (delta: 75.5MB). Free memory was 160.0MB in the beginning and 120.7MB in the end (delta: 39.3MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2023-12-25 06:30:17,459 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 212.9MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:30:17,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.82ms. Allocated memory is still 212.9MB. Free memory was 160.0MB in the beginning and 149.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:30:17,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.15ms. Allocated memory is still 212.9MB. Free memory was 149.2MB in the beginning and 147.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:30:17,459 INFO L158 Benchmark]: Boogie Preprocessor took 32.36ms. Allocated memory is still 212.9MB. Free memory was 147.7MB in the beginning and 146.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:30:17,459 INFO L158 Benchmark]: RCFGBuilder took 247.80ms. Allocated memory is still 212.9MB. Free memory was 146.1MB in the beginning and 135.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:30:17,460 INFO L158 Benchmark]: TraceAbstraction took 98645.32ms. Allocated memory was 212.9MB in the beginning and 288.4MB in the end (delta: 75.5MB). Free memory was 134.8MB in the beginning and 120.7MB in the end (delta: 14.1MB). Peak memory consumption was 89.9MB. Max. memory is 8.0GB. [2023-12-25 06:30:17,460 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.12ms. Allocated memory is still 212.9MB. Free memory is still 160.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 157.82ms. Allocated memory is still 212.9MB. Free memory was 160.0MB in the beginning and 149.2MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.15ms. Allocated memory is still 212.9MB. Free memory was 149.2MB in the beginning and 147.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.36ms. Allocated memory is still 212.9MB. Free memory was 147.7MB in the beginning and 146.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 247.80ms. Allocated memory is still 212.9MB. Free memory was 146.1MB in the beginning and 135.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 98645.32ms. Allocated memory was 212.9MB in the beginning and 288.4MB in the end (delta: 75.5MB). Free memory was 134.8MB in the beginning and 120.7MB in the end (delta: 14.1MB). Peak memory consumption was 89.9MB. 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 = 20; [L15] int b = 0; VAL [a=20, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=20, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b VAL [a=20, b=0, result=20] [L18] reach_error() VAL [a=20, b=0, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 98.6s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3621 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3371 mSDsluCounter, 6925 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6424 mSDsCounter, 1428 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5628 IncrementalHoareTripleChecker+Invalid, 7056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1428 mSolverCounterUnsat, 501 mSDtfsCounter, 5628 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2802 GetRequests, 2096 SyntacticMatches, 0 SemanticMatches, 706 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, InterpolantAutomatonStates: 299, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 78.1s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 121 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 18784 SizeOfPredicates, 210 NumberOfNonLiveVariables, 2440 ConjunctsInSsa, 469 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 5130/15200 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:30:17,473 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...