/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/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:22:58,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:22:58,884 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:22:58,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:22:58,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:22:58,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:22:58,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:22:58,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:22:58,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:22:58,907 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:22:58,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:22:58,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:22:58,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:22:58,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:22:58,908 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:22:58,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:22:58,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:22:58,909 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:22:58,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:22:58,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:22:58,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:22:58,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:22:58,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:22:58,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:22:58,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:22:58,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:22:58,929 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:22:58,929 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:22:58,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:22:58,930 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:22:58,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:22:58,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:22:58,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:22:58,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:22:58,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:22:58,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:22:58,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:22:58,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:22:58,932 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:22:58,932 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:22:58,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:22:58,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:22:58,933 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:22:58,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:22:58,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:22:58,933 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:22:58,933 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:22:59,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:22:59,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:22:59,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:22:59,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:22:59,164 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:22:59,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2023-12-25 06:23:00,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:23:00,433 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:23:00,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2023-12-25 06:23:00,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd9a2eef/c3bff9d67a1341fca382777ed58ddf7c/FLAG78fefc160 [2023-12-25 06:23:00,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd9a2eef/c3bff9d67a1341fca382777ed58ddf7c [2023-12-25 06:23:00,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:23:00,453 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:23:00,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:23:00,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:23:00,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:23:00,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d8e953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00, skipping insertion in model container [2023-12-25 06:23:00,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:23:00,607 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/fibo_2calls_6-2.c[946,959] [2023-12-25 06:23:00,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:23:00,620 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:23:00,635 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/fibo_2calls_6-2.c[946,959] [2023-12-25 06:23:00,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:23:00,646 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:23:00,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00 WrapperNode [2023-12-25 06:23:00,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:23:00,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:23:00,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:23:00,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:23:00,652 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:23:00" (1/1) ... [2023-12-25 06:23:00,658 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:23:00" (1/1) ... [2023-12-25 06:23:00,679 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2023-12-25 06:23:00,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:23:00,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:23:00,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:23:00,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:23:00,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,704 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:23:00,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:23:00,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:23:00,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:23:00,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:23:00,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (1/1) ... [2023-12-25 06:23:00,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:23:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:23:00,740 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:23:00,757 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:23:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:23:00,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:23:00,766 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-12-25 06:23:00,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-12-25 06:23:00,767 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-12-25 06:23:00,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-12-25 06:23:00,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:23:00,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:23:00,818 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:23:00,820 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:23:00,920 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:23:00,937 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:23:00,937 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:23:00,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:23:00 BoogieIcfgContainer [2023-12-25 06:23:00,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:23:00,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:23:00,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:23:00,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:23:00,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:23:00" (1/3) ... [2023-12-25 06:23:00,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be4a5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:23:00, skipping insertion in model container [2023-12-25 06:23:00,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:23:00" (2/3) ... [2023-12-25 06:23:00,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be4a5b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:23:00, skipping insertion in model container [2023-12-25 06:23:00,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:23:00" (3/3) ... [2023-12-25 06:23:00,943 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2023-12-25 06:23:00,954 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:23:00,955 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:23:00,987 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:23:00,991 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;@9f0fc4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:23:00,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:23:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:23:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 06:23:00,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:00,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:01,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:01,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1178273046, now seen corresponding path program 1 times [2023-12-25 06:23:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:01,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684003360] [2023-12-25 06:23:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 06:23:01,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:01,014 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:23:01,025 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:23:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:01,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:23:01,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:01,115 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:23:01,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:23:01,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:01,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684003360] [2023-12-25 06:23:01,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684003360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:23:01,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:23:01,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:23:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951728080] [2023-12-25 06:23:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:23:01,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:23:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:23:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:23:01,139 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 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:23:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:01,232 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-12-25 06:23:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:23:01,234 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:23:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:01,239 INFO L225 Difference]: With dead ends: 32 [2023-12-25 06:23:01,239 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 06:23:01,241 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:23:01,243 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:01,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:23:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 06:23:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 06:23:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:23:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 06:23:01,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 9 [2023-12-25 06:23:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:01,281 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 06:23:01,282 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:23:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 06:23:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-25 06:23:01,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:01,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:01,287 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:23:01,484 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:23:01,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:01,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:01,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1422996679, now seen corresponding path program 1 times [2023-12-25 06:23:01,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:01,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551044698] [2023-12-25 06:23:01,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:01,486 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:23:01,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:01,487 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:23:01,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 06:23:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:01,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-25 06:23:01,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:01,529 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:23:01,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:23:01,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551044698] [2023-12-25 06:23:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551044698] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:23:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:23:01,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 06:23:01,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176677872] [2023-12-25 06:23:01,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:23:01,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 06:23:01,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 06:23:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 06:23:01,532 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:23:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:01,589 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-12-25 06:23:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 06:23:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2023-12-25 06:23:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:01,591 INFO L225 Difference]: With dead ends: 30 [2023-12-25 06:23:01,591 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 06:23:01,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:23:01,592 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:01,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 65 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:23:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 06:23:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-25 06:23:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-25 06:23:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-25 06:23:01,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2023-12-25 06:23:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:01,597 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-25 06:23:01,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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:23:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-25 06:23:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-25 06:23:01,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:01,598 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:01,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:01,799 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:23:01,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:01,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1917903498, now seen corresponding path program 1 times [2023-12-25 06:23:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370346085] [2023-12-25 06:23:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:01,801 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:23:01,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:01,802 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:23:01,802 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:23:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:01,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:23:01,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:01,913 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:23:01,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:02,126 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:23:02,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:02,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370346085] [2023-12-25 06:23:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370346085] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:02,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:23:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327856318] [2023-12-25 06:23:02,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:02,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:23:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:23:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:23:02,128 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:23:02,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:02,271 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2023-12-25 06:23:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:23:02,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 21 [2023-12-25 06:23:02,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:02,273 INFO L225 Difference]: With dead ends: 36 [2023-12-25 06:23:02,273 INFO L226 Difference]: Without dead ends: 32 [2023-12-25 06:23:02,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:23:02,274 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:02,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:02,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-25 06:23:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-25 06:23:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2023-12-25 06:23:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-25 06:23:02,280 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2023-12-25 06:23:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:02,280 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-25 06:23:02,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:23:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-25 06:23:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 06:23:02,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:02,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:02,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 06:23:02,482 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:23:02,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:02,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -773369340, now seen corresponding path program 1 times [2023-12-25 06:23:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807205805] [2023-12-25 06:23:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:02,486 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:23:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:02,487 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:23:02,494 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:23:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:02,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:23:02,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:02,545 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:23:02,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:02,662 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:23:02,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807205805] [2023-12-25 06:23:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807205805] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:02,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:23:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648992842] [2023-12-25 06:23:02,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:23:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:23:02,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:23:02,669 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:23:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:02,808 INFO L93 Difference]: Finished difference Result 60 states and 95 transitions. [2023-12-25 06:23:02,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:23:02,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 22 [2023-12-25 06:23:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:02,812 INFO L225 Difference]: With dead ends: 60 [2023-12-25 06:23:02,812 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 06:23:02,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:23:02,814 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:02,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 06:23:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 06:23:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (16), 8 states have call predecessors, (16), 7 states have call successors, (16) [2023-12-25 06:23:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-12-25 06:23:02,828 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 22 [2023-12-25 06:23:02,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:02,829 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-12-25 06:23:02,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 10 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 06:23:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2023-12-25 06:23:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-25 06:23:02,831 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:02,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:02,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:03,037 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:23:03,038 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:03,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1000055446, now seen corresponding path program 1 times [2023-12-25 06:23:03,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385263900] [2023-12-25 06:23:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:03,039 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:23:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:03,041 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:23:03,042 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:23:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:03,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:23:03,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-25 06:23:03,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:23:03,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385263900] [2023-12-25 06:23:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385263900] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:03,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:03,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:23:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614736557] [2023-12-25 06:23:03,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:03,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:23:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:23:03,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:23:03,504 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:23:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:03,695 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2023-12-25 06:23:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:23:03,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 33 [2023-12-25 06:23:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:03,698 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:23:03,698 INFO L226 Difference]: Without dead ends: 44 [2023-12-25 06:23:03,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:23:03,699 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:03,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 87 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-25 06:23:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-12-25 06:23:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (21), 10 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-25 06:23:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-12-25 06:23:03,707 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 33 [2023-12-25 06:23:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:03,707 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-12-25 06:23:03,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 12 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:23:03,708 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-12-25 06:23:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-25 06:23:03,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:03,709 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:03,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:03,909 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:23:03,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:03,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1077323161, now seen corresponding path program 1 times [2023-12-25 06:23:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231669132] [2023-12-25 06:23:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:03,913 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:23:03,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:03,914 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:23:03,915 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:23:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:03,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:23:03,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-25 06:23:03,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 06:23:04,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231669132] [2023-12-25 06:23:04,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231669132] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:04,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:04,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:23:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171492562] [2023-12-25 06:23:04,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:04,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:23:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:04,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:23:04,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:23:04,189 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:23:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:04,358 INFO L93 Difference]: Finished difference Result 78 states and 149 transitions. [2023-12-25 06:23:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:23:04,359 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 34 [2023-12-25 06:23:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:04,360 INFO L225 Difference]: With dead ends: 78 [2023-12-25 06:23:04,360 INFO L226 Difference]: Without dead ends: 45 [2023-12-25 06:23:04,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:23:04,362 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:04,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 126 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-25 06:23:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-25 06:23:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 9 states have return successors, (37), 14 states have call predecessors, (37), 10 states have call successors, (37) [2023-12-25 06:23:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2023-12-25 06:23:04,370 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 34 [2023-12-25 06:23:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:04,370 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. [2023-12-25 06:23:04,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 12 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 06:23:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. [2023-12-25 06:23:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-25 06:23:04,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:04,372 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:04,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-25 06:23:04,574 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:23:04,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:04,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash -797673590, now seen corresponding path program 2 times [2023-12-25 06:23:04,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:04,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819403079] [2023-12-25 06:23:04,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:23:04,576 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:23:04,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:04,577 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:23:04,578 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:23:04,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:23:04,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:04,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:23:04,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 06:23:04,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:23:05,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:05,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819403079] [2023-12-25 06:23:05,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819403079] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:05,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:05,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-25 06:23:05,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416798391] [2023-12-25 06:23:05,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:05,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:23:05,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:05,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:23:05,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:23:05,179 INFO L87 Difference]: Start difference. First operand 45 states and 76 transitions. Second operand has 14 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:23:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:05,587 INFO L93 Difference]: Finished difference Result 69 states and 141 transitions. [2023-12-25 06:23:05,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:23:05,588 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) Word has length 45 [2023-12-25 06:23:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:05,590 INFO L225 Difference]: With dead ends: 69 [2023-12-25 06:23:05,590 INFO L226 Difference]: Without dead ends: 65 [2023-12-25 06:23:05,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:23:05,591 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:05,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 140 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:23:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-25 06:23:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2023-12-25 06:23:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 11 states have call successors, (11), 2 states have call predecessors, (11), 10 states have return successors, (47), 16 states have call predecessors, (47), 11 states have call successors, (47) [2023-12-25 06:23:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. [2023-12-25 06:23:05,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 45 [2023-12-25 06:23:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:05,609 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 89 transitions. [2023-12-25 06:23:05,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:23:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 89 transitions. [2023-12-25 06:23:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 06:23:05,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:05,611 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:05,614 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:23:05,817 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:23:05,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:05,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1078970546, now seen corresponding path program 1 times [2023-12-25 06:23:05,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:05,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887714180] [2023-12-25 06:23:05,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:05,819 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:23:05,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:05,820 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:23:05,823 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:23:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:05,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:23:05,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-25 06:23:05,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 06:23:06,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:06,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887714180] [2023-12-25 06:23:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887714180] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:06,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-25 06:23:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660409165] [2023-12-25 06:23:06,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:06,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:23:06,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:06,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:23:06,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:23:06,217 INFO L87 Difference]: Start difference. First operand 49 states and 89 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:23:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:06,434 INFO L93 Difference]: Finished difference Result 107 states and 251 transitions. [2023-12-25 06:23:06,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 06:23:06,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) Word has length 46 [2023-12-25 06:23:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:06,437 INFO L225 Difference]: With dead ends: 107 [2023-12-25 06:23:06,437 INFO L226 Difference]: Without dead ends: 60 [2023-12-25 06:23:06,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:23:06,442 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:06,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 181 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:23:06,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-25 06:23:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-25 06:23:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 13 states have return successors, (69), 21 states have call predecessors, (69), 13 states have call successors, (69) [2023-12-25 06:23:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2023-12-25 06:23:06,456 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 46 [2023-12-25 06:23:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:06,457 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2023-12-25 06:23:06,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 14 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (11), 4 states have call predecessors, (11), 10 states have call successors, (11) [2023-12-25 06:23:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2023-12-25 06:23:06,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-25 06:23:06,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:06,458 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:06,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:06,669 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:23:06,669 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:06,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 82175210, now seen corresponding path program 3 times [2023-12-25 06:23:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557163803] [2023-12-25 06:23:06,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:23:06,670 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:23:06,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:06,671 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:23:06,672 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:23:06,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 06:23:06,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:06,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 06:23:06,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 06:23:06,744 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 06:23:06,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557163803] [2023-12-25 06:23:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557163803] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:06,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-25 06:23:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592663352] [2023-12-25 06:23:06,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 06:23:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:06,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 06:23:06,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 06:23:06,923 INFO L87 Difference]: Start difference. First operand 60 states and 119 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:23:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:07,030 INFO L93 Difference]: Finished difference Result 82 states and 162 transitions. [2023-12-25 06:23:07,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 06:23:07,031 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 57 [2023-12-25 06:23:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:07,032 INFO L225 Difference]: With dead ends: 82 [2023-12-25 06:23:07,032 INFO L226 Difference]: Without dead ends: 78 [2023-12-25 06:23:07,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:23:07,033 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:07,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-25 06:23:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2023-12-25 06:23:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 2 states have call predecessors, (13), 13 states have return successors, (69), 21 states have call predecessors, (69), 13 states have call successors, (69) [2023-12-25 06:23:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2023-12-25 06:23:07,043 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 57 [2023-12-25 06:23:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:07,043 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2023-12-25 06:23:07,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 06:23:07,043 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2023-12-25 06:23:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-25 06:23:07,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:07,045 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:07,051 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:23:07,249 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:23:07,249 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:07,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1783295408, now seen corresponding path program 2 times [2023-12-25 06:23:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37504022] [2023-12-25 06:23:07,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:23:07,250 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:23:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:07,251 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:23:07,255 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:23:07,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:23:07,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:07,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:07,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-25 06:23:07,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 06:23:08,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:08,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37504022] [2023-12-25 06:23:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37504022] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:08,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:23:08,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332998507] [2023-12-25 06:23:08,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:08,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:23:08,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:23:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:23:08,045 INFO L87 Difference]: Start difference. First operand 60 states and 119 transitions. Second operand has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) [2023-12-25 06:23:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:08,538 INFO L93 Difference]: Finished difference Result 162 states and 459 transitions. [2023-12-25 06:23:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:23:08,538 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) Word has length 58 [2023-12-25 06:23:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:08,540 INFO L225 Difference]: With dead ends: 162 [2023-12-25 06:23:08,540 INFO L226 Difference]: Without dead ends: 104 [2023-12-25 06:23:08,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:23:08,541 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:08,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 161 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:23:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-25 06:23:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-25 06:23:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 59 states have internal predecessors, (61), 20 states have call successors, (20), 5 states have call predecessors, (20), 22 states have return successors, (150), 33 states have call predecessors, (150), 20 states have call successors, (150) [2023-12-25 06:23:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 231 transitions. [2023-12-25 06:23:08,554 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 231 transitions. Word has length 58 [2023-12-25 06:23:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:08,555 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 231 transitions. [2023-12-25 06:23:08,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 16 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (14), 5 states have call predecessors, (14), 12 states have call successors, (14) [2023-12-25 06:23:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 231 transitions. [2023-12-25 06:23:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 06:23:08,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:08,560 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:08,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:08,762 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:23:08,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:08,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2115449141, now seen corresponding path program 2 times [2023-12-25 06:23:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839622267] [2023-12-25 06:23:08,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:23:08,764 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:23:08,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:08,765 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:23:08,766 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:23:08,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:23:08,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:08,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:08,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-25 06:23:08,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-25 06:23:09,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839622267] [2023-12-25 06:23:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839622267] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:09,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:23:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160811203] [2023-12-25 06:23:09,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:09,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:23:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:23:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:23:09,263 INFO L87 Difference]: Start difference. First operand 98 states and 231 transitions. Second operand has 16 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 16 states have internal predecessors, (45), 13 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2023-12-25 06:23:09,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:09,525 INFO L93 Difference]: Finished difference Result 208 states and 647 transitions. [2023-12-25 06:23:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 06:23:09,525 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 16 states have internal predecessors, (45), 13 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) Word has length 70 [2023-12-25 06:23:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:09,527 INFO L225 Difference]: With dead ends: 208 [2023-12-25 06:23:09,527 INFO L226 Difference]: Without dead ends: 112 [2023-12-25 06:23:09,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:23:09,529 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:09,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 209 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:23:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-25 06:23:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2023-12-25 06:23:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 61 states have (on average 1.098360655737705) internal successors, (67), 65 states have internal predecessors, (67), 22 states have call successors, (22), 5 states have call predecessors, (22), 25 states have return successors, (186), 38 states have call predecessors, (186), 22 states have call successors, (186) [2023-12-25 06:23:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 275 transitions. [2023-12-25 06:23:09,550 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 275 transitions. Word has length 70 [2023-12-25 06:23:09,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:09,551 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 275 transitions. [2023-12-25 06:23:09,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 16 states have internal predecessors, (45), 13 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (16), 6 states have call predecessors, (16), 13 states have call successors, (16) [2023-12-25 06:23:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 275 transitions. [2023-12-25 06:23:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 06:23:09,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:09,554 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:09,556 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:23:09,756 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:23:09,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:09,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1424247677, now seen corresponding path program 3 times [2023-12-25 06:23:09,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:09,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492086177] [2023-12-25 06:23:09,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:23:09,758 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:23:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:09,759 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:23:09,760 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:23:09,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-25 06:23:09,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:09,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 06:23:09,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 263 proven. 5 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2023-12-25 06:23:09,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 195 proven. 19 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2023-12-25 06:23:10,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:10,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492086177] [2023-12-25 06:23:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492086177] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:10,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-25 06:23:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154452359] [2023-12-25 06:23:10,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:10,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:23:10,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:10,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:23:10,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:23:10,369 INFO L87 Difference]: Start difference. First operand 109 states and 275 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-25 06:23:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:10,636 INFO L93 Difference]: Finished difference Result 222 states and 707 transitions. [2023-12-25 06:23:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:23:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) Word has length 142 [2023-12-25 06:23:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:10,639 INFO L225 Difference]: With dead ends: 222 [2023-12-25 06:23:10,639 INFO L226 Difference]: Without dead ends: 115 [2023-12-25 06:23:10,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-25 06:23:10,641 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:10,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 159 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:23:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-25 06:23:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-25 06:23:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 69 states have internal predecessors, (71), 22 states have call successors, (22), 5 states have call predecessors, (22), 27 states have return successors, (179), 40 states have call predecessors, (179), 22 states have call successors, (179) [2023-12-25 06:23:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 272 transitions. [2023-12-25 06:23:10,655 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 272 transitions. Word has length 142 [2023-12-25 06:23:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:10,655 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 272 transitions. [2023-12-25 06:23:10,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 8 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (21), 6 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-25 06:23:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 272 transitions. [2023-12-25 06:23:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-25 06:23:10,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:10,658 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:10,677 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:23:10,860 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:23:10,861 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:10,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 705383518, now seen corresponding path program 3 times [2023-12-25 06:23:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571366130] [2023-12-25 06:23:10,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:23:10,861 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:23:10,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:10,862 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:23:10,866 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:23:10,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 06:23:10,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:10,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 06:23:10,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-25 06:23:10,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:23:10,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571366130] [2023-12-25 06:23:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571366130] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:23:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:23:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 06:23:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792590987] [2023-12-25 06:23:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:23:10,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:23:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:23:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:23:10,935 INFO L87 Difference]: Start difference. First operand 115 states and 272 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 06:23:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:10,991 INFO L93 Difference]: Finished difference Result 210 states and 572 transitions. [2023-12-25 06:23:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:23:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2023-12-25 06:23:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:10,993 INFO L225 Difference]: With dead ends: 210 [2023-12-25 06:23:10,993 INFO L226 Difference]: Without dead ends: 95 [2023-12-25 06:23:10,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:23:10,995 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:10,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 75 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:23:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-25 06:23:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-25 06:23:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 57 states have internal predecessors, (59), 19 states have call successors, (19), 5 states have call predecessors, (19), 21 states have return successors, (113), 32 states have call predecessors, (113), 19 states have call successors, (113) [2023-12-25 06:23:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 191 transitions. [2023-12-25 06:23:11,006 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 191 transitions. Word has length 94 [2023-12-25 06:23:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:11,006 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 191 transitions. [2023-12-25 06:23:11,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 06:23:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 191 transitions. [2023-12-25 06:23:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-25 06:23:11,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:11,008 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:11,023 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:23:11,211 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:23:11,211 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:11,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -187948887, now seen corresponding path program 1 times [2023-12-25 06:23:11,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:11,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820875114] [2023-12-25 06:23:11,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:11,212 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:23:11,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:11,214 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:23:11,214 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:23:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:11,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:11,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 54 proven. 112 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-12-25 06:23:11,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 54 proven. 120 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-12-25 06:23:12,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:12,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820875114] [2023-12-25 06:23:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820875114] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:12,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:12,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:23:12,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98168591] [2023-12-25 06:23:12,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:12,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:23:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:12,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:23:12,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:23:12,149 INFO L87 Difference]: Start difference. First operand 95 states and 191 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-25 06:23:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:12,715 INFO L93 Difference]: Finished difference Result 333 states and 1132 transitions. [2023-12-25 06:23:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:23:12,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 120 [2023-12-25 06:23:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:12,721 INFO L225 Difference]: With dead ends: 333 [2023-12-25 06:23:12,721 INFO L226 Difference]: Without dead ends: 238 [2023-12-25 06:23:12,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:23:12,725 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:12,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 150 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 06:23:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-25 06:23:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 218. [2023-12-25 06:23:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 123 states have (on average 1.0731707317073171) internal successors, (132), 127 states have internal predecessors, (132), 43 states have call successors, (43), 9 states have call predecessors, (43), 51 states have return successors, (467), 81 states have call predecessors, (467), 43 states have call successors, (467) [2023-12-25 06:23:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 642 transitions. [2023-12-25 06:23:12,762 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 642 transitions. Word has length 120 [2023-12-25 06:23:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:12,762 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 642 transitions. [2023-12-25 06:23:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-25 06:23:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 642 transitions. [2023-12-25 06:23:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2023-12-25 06:23:12,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:12,771 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 22, 22, 19, 17, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 8, 7, 6, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:12,783 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:12,974 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:23:12,975 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:12,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash 227938724, now seen corresponding path program 2 times [2023-12-25 06:23:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130236891] [2023-12-25 06:23:12,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:23:12,976 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:23:12,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:12,977 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:23:12,978 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:23:13,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:23:13,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:13,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:13,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 90 proven. 418 refuted. 0 times theorem prover too weak. 2286 trivial. 0 not checked. [2023-12-25 06:23:13,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2794 backedges. 90 proven. 426 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2023-12-25 06:23:14,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130236891] [2023-12-25 06:23:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130236891] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:14,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:14,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:23:14,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382312625] [2023-12-25 06:23:14,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:14,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:23:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:23:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:23:14,321 INFO L87 Difference]: Start difference. First operand 218 states and 642 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-25 06:23:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:14,883 INFO L93 Difference]: Finished difference Result 603 states and 2677 transitions. [2023-12-25 06:23:14,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:23:14,883 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 298 [2023-12-25 06:23:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:14,891 INFO L225 Difference]: With dead ends: 603 [2023-12-25 06:23:14,891 INFO L226 Difference]: Without dead ends: 387 [2023-12-25 06:23:14,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:23:14,897 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 43 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:14,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:23:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-12-25 06:23:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 227. [2023-12-25 06:23:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 129 states have (on average 1.069767441860465) internal successors, (138), 133 states have internal predecessors, (138), 43 states have call successors, (43), 9 states have call predecessors, (43), 54 states have return successors, (485), 84 states have call predecessors, (485), 43 states have call successors, (485) [2023-12-25 06:23:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 666 transitions. [2023-12-25 06:23:14,959 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 666 transitions. Word has length 298 [2023-12-25 06:23:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:14,959 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 666 transitions. [2023-12-25 06:23:14,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-25 06:23:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 666 transitions. [2023-12-25 06:23:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-25 06:23:14,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:14,964 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:14,982 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:15,168 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:23:15,168 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:15,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1286916725, now seen corresponding path program 3 times [2023-12-25 06:23:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673726074] [2023-12-25 06:23:15,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:23:15,169 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:23:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:15,170 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:23:15,171 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:23:15,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 06:23:15,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:15,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 06:23:15,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 244 proven. 2 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [2023-12-25 06:23:15,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 190 proven. 3 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2023-12-25 06:23:15,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673726074] [2023-12-25 06:23:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673726074] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:15,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:15,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-25 06:23:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715256360] [2023-12-25 06:23:15,631 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:15,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-25 06:23:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-25 06:23:15,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:23:15,632 INFO L87 Difference]: Start difference. First operand 227 states and 666 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:23:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:15,783 INFO L93 Difference]: Finished difference Result 548 states and 2056 transitions. [2023-12-25 06:23:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-25 06:23:15,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 175 [2023-12-25 06:23:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:15,788 INFO L225 Difference]: With dead ends: 548 [2023-12-25 06:23:15,788 INFO L226 Difference]: Without dead ends: 323 [2023-12-25 06:23:15,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:23:15,792 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:15,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 146 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-25 06:23:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2023-12-25 06:23:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 130 states have (on average 1.0846153846153845) internal successors, (141), 134 states have internal predecessors, (141), 53 states have call successors, (53), 10 states have call predecessors, (53), 53 states have return successors, (511), 92 states have call predecessors, (511), 53 states have call successors, (511) [2023-12-25 06:23:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 705 transitions. [2023-12-25 06:23:15,825 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 705 transitions. Word has length 175 [2023-12-25 06:23:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:15,826 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 705 transitions. [2023-12-25 06:23:15,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 5 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2023-12-25 06:23:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 705 transitions. [2023-12-25 06:23:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-25 06:23:15,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:15,830 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:15,835 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:23:16,035 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:23:16,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:16,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1775084750, now seen corresponding path program 1 times [2023-12-25 06:23:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317703295] [2023-12-25 06:23:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:23:16,036 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:23:16,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:16,037 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:23:16,048 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:23:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:16,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:16,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 68 proven. 112 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2023-12-25 06:23:16,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 68 proven. 120 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2023-12-25 06:23:16,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:16,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317703295] [2023-12-25 06:23:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317703295] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:16,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-25 06:23:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10277988] [2023-12-25 06:23:16,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:16,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:23:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:23:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:23:16,881 INFO L87 Difference]: Start difference. First operand 237 states and 705 transitions. Second operand has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 12 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2023-12-25 06:23:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:17,302 INFO L93 Difference]: Finished difference Result 645 states and 3410 transitions. [2023-12-25 06:23:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:23:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 12 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) Word has length 124 [2023-12-25 06:23:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:17,308 INFO L225 Difference]: With dead ends: 645 [2023-12-25 06:23:17,308 INFO L226 Difference]: Without dead ends: 259 [2023-12-25 06:23:17,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-12-25 06:23:17,316 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:17,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 06:23:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-12-25 06:23:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2023-12-25 06:23:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 137 states have internal predecessors, (145), 61 states have call successors, (61), 13 states have call predecessors, (61), 51 states have return successors, (499), 96 states have call predecessors, (499), 61 states have call successors, (499) [2023-12-25 06:23:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 705 transitions. [2023-12-25 06:23:17,350 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 705 transitions. Word has length 124 [2023-12-25 06:23:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:17,350 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 705 transitions. [2023-12-25 06:23:17,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 16 states have internal predecessors, (50), 12 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (22), 11 states have call predecessors, (22), 12 states have call successors, (22) [2023-12-25 06:23:17,350 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 705 transitions. [2023-12-25 06:23:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-25 06:23:17,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:17,355 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:17,375 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 (18)] Ended with exit code 0 [2023-12-25 06:23:17,557 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:23:17,558 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:17,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:17,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1202290018, now seen corresponding path program 4 times [2023-12-25 06:23:17,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:17,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144864510] [2023-12-25 06:23:17,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:23:17,559 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:23:17,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:17,560 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:23:17,590 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:23:17,618 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:23:17,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:17,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:23:17,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-25 06:23:17,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 50 proven. 52 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2023-12-25 06:23:17,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:17,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144864510] [2023-12-25 06:23:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144864510] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:17,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-25 06:23:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422624418] [2023-12-25 06:23:17,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:17,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-25 06:23:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-25 06:23:17,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-25 06:23:17,888 INFO L87 Difference]: Start difference. First operand 247 states and 705 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-25 06:23:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:18,049 INFO L93 Difference]: Finished difference Result 293 states and 863 transitions. [2023-12-25 06:23:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:23:18,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) Word has length 111 [2023-12-25 06:23:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:18,053 INFO L225 Difference]: With dead ends: 293 [2023-12-25 06:23:18,054 INFO L226 Difference]: Without dead ends: 282 [2023-12-25 06:23:18,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:23:18,055 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:18,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 132 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-25 06:23:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 247. [2023-12-25 06:23:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 134 states have (on average 1.0820895522388059) internal successors, (145), 137 states have internal predecessors, (145), 61 states have call successors, (61), 13 states have call predecessors, (61), 51 states have return successors, (499), 96 states have call predecessors, (499), 61 states have call successors, (499) [2023-12-25 06:23:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 705 transitions. [2023-12-25 06:23:18,088 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 705 transitions. Word has length 111 [2023-12-25 06:23:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:18,089 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 705 transitions. [2023-12-25 06:23:18,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (13), 1 states have call predecessors, (13), 4 states have return successors, (13), 6 states have call predecessors, (13), 8 states have call successors, (13) [2023-12-25 06:23:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 705 transitions. [2023-12-25 06:23:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-12-25 06:23:18,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:18,094 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 15, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:18,097 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:23:18,297 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:23:18,297 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:18,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1695690340, now seen corresponding path program 5 times [2023-12-25 06:23:18,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:18,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850540536] [2023-12-25 06:23:18,298 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:23:18,298 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:23:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:18,299 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:23:18,325 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:23:18,372 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-25 06:23:18,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:18,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 06:23:18,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1695 backedges. 939 proven. 3 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2023-12-25 06:23:18,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1695 backedges. 183 proven. 224 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2023-12-25 06:23:19,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850540536] [2023-12-25 06:23:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850540536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:19,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:19,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-25 06:23:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454374154] [2023-12-25 06:23:19,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 06:23:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 06:23:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-25 06:23:19,097 INFO L87 Difference]: Start difference. First operand 247 states and 705 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 9 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-25 06:23:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:19,329 INFO L93 Difference]: Finished difference Result 468 states and 1674 transitions. [2023-12-25 06:23:19,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 06:23:19,330 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 9 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) Word has length 235 [2023-12-25 06:23:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:19,332 INFO L225 Difference]: With dead ends: 468 [2023-12-25 06:23:19,332 INFO L226 Difference]: Without dead ends: 174 [2023-12-25 06:23:19,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-12-25 06:23:19,336 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:19,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 123 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-25 06:23:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2023-12-25 06:23:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.072289156626506) internal successors, (89), 85 states have internal predecessors, (89), 34 states have call successors, (34), 9 states have call predecessors, (34), 30 states have return successors, (206), 53 states have call predecessors, (206), 34 states have call successors, (206) [2023-12-25 06:23:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 329 transitions. [2023-12-25 06:23:19,350 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 329 transitions. Word has length 235 [2023-12-25 06:23:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:19,350 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 329 transitions. [2023-12-25 06:23:19,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 9 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (22), 6 states have call predecessors, (22), 9 states have call successors, (22) [2023-12-25 06:23:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 329 transitions. [2023-12-25 06:23:19,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2023-12-25 06:23:19,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:19,354 INFO L195 NwaCegarLoop]: trace histogram [37, 37, 30, 30, 26, 23, 18, 18, 18, 18, 18, 18, 15, 15, 15, 15, 15, 15, 14, 8, 8, 4, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:19,366 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 (20)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:19,557 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:23:19,557 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:19,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1074613524, now seen corresponding path program 6 times [2023-12-25 06:23:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240827226] [2023-12-25 06:23:19,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-25 06:23:19,558 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:23:19,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:19,559 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:23:19,574 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:23:19,654 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-12-25 06:23:19,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:19,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:23:19,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5756 backedges. 873 proven. 0 refuted. 0 times theorem prover too weak. 4883 trivial. 0 not checked. [2023-12-25 06:23:19,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:23:19,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240827226] [2023-12-25 06:23:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240827226] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:23:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:23:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 06:23:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365873017] [2023-12-25 06:23:19,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:23:19,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 06:23:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 06:23:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-25 06:23:19,718 INFO L87 Difference]: Start difference. First operand 148 states and 329 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 06:23:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:19,767 INFO L93 Difference]: Finished difference Result 272 states and 710 transitions. [2023-12-25 06:23:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 06:23:19,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 421 [2023-12-25 06:23:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:19,769 INFO L225 Difference]: With dead ends: 272 [2023-12-25 06:23:19,769 INFO L226 Difference]: Without dead ends: 128 [2023-12-25 06:23:19,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:23:19,771 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:19,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:23:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-25 06:23:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2023-12-25 06:23:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 73 states have internal predecessors, (77), 31 states have call successors, (31), 9 states have call predecessors, (31), 24 states have return successors, (155), 45 states have call predecessors, (155), 31 states have call successors, (155) [2023-12-25 06:23:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 263 transitions. [2023-12-25 06:23:19,780 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 263 transitions. Word has length 421 [2023-12-25 06:23:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:19,781 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 263 transitions. [2023-12-25 06:23:19,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-12-25 06:23:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 263 transitions. [2023-12-25 06:23:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2023-12-25 06:23:19,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:19,785 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 30, 30, 25, 24, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 9, 9, 9, 5, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:19,788 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:23:19,987 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:23:19,988 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:19,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:19,988 INFO L85 PathProgramCache]: Analyzing trace with hash 126266773, now seen corresponding path program 7 times [2023-12-25 06:23:19,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:19,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388317455] [2023-12-25 06:23:19,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-25 06:23:19,989 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:23:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:19,990 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:23:20,016 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:23:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:23:20,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:20,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5103 backedges. 180 proven. 577 refuted. 0 times theorem prover too weak. 4346 trivial. 0 not checked. [2023-12-25 06:23:20,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5103 backedges. 180 proven. 587 refuted. 0 times theorem prover too weak. 4336 trivial. 0 not checked. [2023-12-25 06:23:21,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388317455] [2023-12-25 06:23:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388317455] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:21,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 15 [2023-12-25 06:23:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841623049] [2023-12-25 06:23:21,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:21,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:23:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:23:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:23:21,105 INFO L87 Difference]: Start difference. First operand 128 states and 263 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2023-12-25 06:23:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:21,343 INFO L93 Difference]: Finished difference Result 266 states and 538 transitions. [2023-12-25 06:23:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:23:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) Word has length 399 [2023-12-25 06:23:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:21,345 INFO L225 Difference]: With dead ends: 266 [2023-12-25 06:23:21,345 INFO L226 Difference]: Without dead ends: 152 [2023-12-25 06:23:21,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-25 06:23:21,347 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:21,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 96 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:23:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-25 06:23:21,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 135. [2023-12-25 06:23:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 78 states have internal predecessors, (84), 32 states have call successors, (32), 11 states have call predecessors, (32), 24 states have return successors, (158), 45 states have call predecessors, (158), 32 states have call successors, (158) [2023-12-25 06:23:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 274 transitions. [2023-12-25 06:23:21,359 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 274 transitions. Word has length 399 [2023-12-25 06:23:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:21,360 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 274 transitions. [2023-12-25 06:23:21,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2023-12-25 06:23:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 274 transitions. [2023-12-25 06:23:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-25 06:23:21,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:21,363 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 16, 15, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 7, 5, 5, 3, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:21,370 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:23:21,568 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:23:21,569 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:21,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1915605921, now seen corresponding path program 8 times [2023-12-25 06:23:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318251957] [2023-12-25 06:23:21,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:23:21,570 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:23:21,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:21,585 INFO L229 MonitoredProcess]: Starting monitored process 23 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:23:21,616 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 (23)] Waiting until timeout for monitored process [2023-12-25 06:23:21,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:23:21,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:21,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 06:23:21,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 265 proven. 178 refuted. 0 times theorem prover too weak. 1477 trivial. 0 not checked. [2023-12-25 06:23:21,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 265 proven. 188 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2023-12-25 06:23:22,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318251957] [2023-12-25 06:23:22,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318251957] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:22,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:22,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 15 [2023-12-25 06:23:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007789744] [2023-12-25 06:23:22,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:22,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-25 06:23:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:22,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-25 06:23:22,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-25 06:23:22,393 INFO L87 Difference]: Start difference. First operand 135 states and 274 transitions. Second operand has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2023-12-25 06:23:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:22,652 INFO L93 Difference]: Finished difference Result 154 states and 328 transitions. [2023-12-25 06:23:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 06:23:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) Word has length 249 [2023-12-25 06:23:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:22,656 INFO L225 Difference]: With dead ends: 154 [2023-12-25 06:23:22,656 INFO L226 Difference]: Without dead ends: 141 [2023-12-25 06:23:22,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 483 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-25 06:23:22,657 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:22,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 110 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:23:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-25 06:23:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2023-12-25 06:23:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 29 states have call successors, (29), 11 states have call predecessors, (29), 23 states have return successors, (118), 41 states have call predecessors, (118), 29 states have call successors, (118) [2023-12-25 06:23:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 229 transitions. [2023-12-25 06:23:22,671 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 229 transitions. Word has length 249 [2023-12-25 06:23:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:22,671 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 229 transitions. [2023-12-25 06:23:22,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 15 states have internal predecessors, (50), 12 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (20), 9 states have call predecessors, (20), 12 states have call successors, (20) [2023-12-25 06:23:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 229 transitions. [2023-12-25 06:23:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-12-25 06:23:22,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:22,674 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 16, 16, 14, 14, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:22,694 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 (23)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:22,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:23:22,878 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:22,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1339997342, now seen corresponding path program 9 times [2023-12-25 06:23:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:22,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458436577] [2023-12-25 06:23:22,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:23:22,879 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:23:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:22,886 INFO L229 MonitoredProcess]: Starting monitored process 24 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:23:22,888 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 (24)] Waiting until timeout for monitored process [2023-12-25 06:23:22,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-25 06:23:22,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:22,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 06:23:22,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 478 proven. 21 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2023-12-25 06:23:23,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 398 proven. 26 refuted. 0 times theorem prover too weak. 1114 trivial. 0 not checked. [2023-12-25 06:23:23,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:23,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458436577] [2023-12-25 06:23:23,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458436577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:23,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:23,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2023-12-25 06:23:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039945379] [2023-12-25 06:23:23,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:23,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:23:23,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:23:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:23:23,762 INFO L87 Difference]: Start difference. First operand 129 states and 229 transitions. Second operand has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 10 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2023-12-25 06:23:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:24,104 INFO L93 Difference]: Finished difference Result 224 states and 432 transitions. [2023-12-25 06:23:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 06:23:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 10 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) Word has length 224 [2023-12-25 06:23:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:24,106 INFO L225 Difference]: With dead ends: 224 [2023-12-25 06:23:24,106 INFO L226 Difference]: Without dead ends: 92 [2023-12-25 06:23:24,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-12-25 06:23:24,108 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:24,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 06:23:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-25 06:23:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-12-25 06:23:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 57 states have internal predecessors, (62), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (31), 21 states have call predecessors, (31), 17 states have call successors, (31) [2023-12-25 06:23:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2023-12-25 06:23:24,129 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 224 [2023-12-25 06:23:24,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:24,129 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2023-12-25 06:23:24,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 10 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2023-12-25 06:23:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2023-12-25 06:23:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-25 06:23:24,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:24,145 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:24,160 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 (24)] Ended with exit code 0 [2023-12-25 06:23:24,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:23:24,345 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:24,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1716142794, now seen corresponding path program 10 times [2023-12-25 06:23:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037361852] [2023-12-25 06:23:24,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 06:23:24,346 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:23:24,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:24,348 INFO L229 MonitoredProcess]: Starting monitored process 25 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:23:24,376 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 (25)] Waiting until timeout for monitored process [2023-12-25 06:23:24,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 06:23:24,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:23:24,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-25 06:23:24,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:23:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2023-12-25 06:23:24,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:23:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 207 proven. 77 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2023-12-25 06:23:24,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:23:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037361852] [2023-12-25 06:23:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037361852] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:23:24,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:23:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2023-12-25 06:23:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947456041] [2023-12-25 06:23:24,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:23:24,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:23:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:23:24,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:23:24,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:23:24,983 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 9 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2023-12-25 06:23:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:23:25,144 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2023-12-25 06:23:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:23:25,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 9 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) Word has length 199 [2023-12-25 06:23:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:23:25,146 INFO L225 Difference]: With dead ends: 100 [2023-12-25 06:23:25,146 INFO L226 Difference]: Without dead ends: 90 [2023-12-25 06:23:25,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-25 06:23:25,147 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:23:25,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 70 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:23:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-25 06:23:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-25 06:23:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 57 states have internal predecessors, (62), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (29), 21 states have call predecessors, (29), 17 states have call successors, (29) [2023-12-25 06:23:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2023-12-25 06:23:25,155 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 199 [2023-12-25 06:23:25,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:23:25,155 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2023-12-25 06:23:25,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 9 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2023-12-25 06:23:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2023-12-25 06:23:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-25 06:23:25,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:23:25,156 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 06:23:25,178 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 (25)] Forceful destruction successful, exit code 0 [2023-12-25 06:23:25,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:23:25,363 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:23:25,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:23:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash 861305390, now seen corresponding path program 11 times [2023-12-25 06:23:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:23:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193362545] [2023-12-25 06:23:25,364 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-25 06:23:25,364 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:23:25,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:23:25,382 INFO L229 MonitoredProcess]: Starting monitored process 26 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:23:25,408 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 (26)] Waiting until timeout for monitored process [2023-12-25 06:23:25,527 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-12-25 06:23:25,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-25 06:23:25,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 06:23:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 06:23:25,647 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 06:23:25,648 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 06:23:25,648 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:23:25,680 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 (26)] Ended with exit code 0 [2023-12-25 06:23:25,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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:23:25,854 INFO L445 BasicCegarLoop]: Path program histogram: [11, 3, 3, 3, 1, 1, 1, 1, 1] [2023-12-25 06:23:25,857 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:23:25,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:23:25 BoogieIcfgContainer [2023-12-25 06:23:25,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:23:25,893 INFO L158 Benchmark]: Toolchain (without parser) took 25440.31ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 199.0MB in the beginning and 259.3MB in the end (delta: -60.3MB). Peak memory consumption was 51.1MB. Max. memory is 8.0GB. [2023-12-25 06:23:25,894 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 203.4MB. Free memory was 152.2MB in the beginning and 152.0MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:23:25,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.50ms. Allocated memory is still 251.7MB. Free memory was 199.0MB in the beginning and 187.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-25 06:23:25,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 251.7MB. Free memory was 187.7MB in the beginning and 186.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 06:23:25,898 INFO L158 Benchmark]: Boogie Preprocessor took 38.07ms. Allocated memory is still 251.7MB. Free memory was 186.4MB in the beginning and 184.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:23:25,898 INFO L158 Benchmark]: RCFGBuilder took 219.44ms. Allocated memory is still 251.7MB. Free memory was 184.8MB in the beginning and 173.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 06:23:25,900 INFO L158 Benchmark]: TraceAbstraction took 24953.66ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 172.6MB in the beginning and 259.3MB in the end (delta: -86.7MB). Peak memory consumption was 24.9MB. Max. memory is 8.0GB. [2023-12-25 06:23:25,900 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.19ms. Allocated memory is still 203.4MB. Free memory was 152.2MB in the beginning and 152.0MB in the end (delta: 152.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.50ms. Allocated memory is still 251.7MB. Free memory was 199.0MB in the beginning and 187.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 251.7MB. Free memory was 187.7MB in the beginning and 186.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.07ms. Allocated memory is still 251.7MB. Free memory was 186.4MB in the beginning and 184.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 219.44ms. Allocated memory is still 251.7MB. Free memory was 184.8MB in the beginning and 173.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 24953.66ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 172.6MB in the beginning and 259.3MB in the end (delta: -86.7MB). Peak memory consumption was 24.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: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 6; VAL [x=6] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=6] [L39] int result = fibo1(x); [L40] COND TRUE result == 8 VAL [result=8, x=6] [L41] reach_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 25, TraceHistogramMax: 37, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.1s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 713 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 584 mSDsluCounter, 2893 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2412 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4181 IncrementalHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 481 mSDtfsCounter, 4181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5956 GetRequests, 5594 SyntacticMatches, 0 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=17, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 431 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 3357 NumberOfCodeBlocks, 2451 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5814 ConstructedInterpolants, 0 QuantifiedInterpolants, 9651 SizeOfPredicates, 79 NumberOfNonLiveVariables, 3451 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 44 InterpolantComputations, 4 PerfectInterpolantSequences, 36871/40617 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:23:25,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...