/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_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 17:45:36,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 17:45:36,348 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-16 17:45:36,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 17:45:36,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 17:45:36,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 17:45:36,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 17:45:36,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 17:45:36,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 17:45:36,365 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 17:45:36,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 17:45:36,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 17:45:36,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 17:45:36,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 17:45:36,366 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 17:45:36,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 17:45:36,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 17:45:36,367 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 17:45:36,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 17:45:36,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 17:45:36,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 17:45:36,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 17:45:36,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 17:45:36,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 17:45:36,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 17:45:36,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 17:45:36,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 17:45:36,369 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 17:45:36,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 17:45:36,370 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 17:45:36,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 17:45:36,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 17:45:36,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 17:45:36,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 17:45:36,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:45:36,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 17:45:36,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 17:45:36,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 17:45:36,372 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 17:45:36,372 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 17:45:36,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 17:45:36,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 17:45:36,373 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 17:45:36,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 17:45:36,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 17:45:36,373 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 17:45:36,374 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-16 17:45:36,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 17:45:36,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 17:45:36,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 17:45:36,526 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 17:45:36,526 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 17:45:36,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2023-12-16 17:45:37,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 17:45:37,631 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 17:45:37,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2023-12-16 17:45:37,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1a7668f/e601882c6a50447fb71f57cf2fabfc89/FLAG1ad414c3a [2023-12-16 17:45:37,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1a7668f/e601882c6a50447fb71f57cf2fabfc89 [2023-12-16 17:45:37,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 17:45:37,654 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 17:45:37,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 17:45:37,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 17:45:37,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 17:45:37,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a341241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37, skipping insertion in model container [2023-12-16 17:45:37,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,673 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 17:45:37,794 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_5-2.c[946,959] [2023-12-16 17:45:37,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:45:37,811 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 17:45:37,824 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_5-2.c[946,959] [2023-12-16 17:45:37,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 17:45:37,835 INFO L206 MainTranslator]: Completed translation [2023-12-16 17:45:37,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37 WrapperNode [2023-12-16 17:45:37,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 17:45:37,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 17:45:37,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 17:45:37,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 17:45:37,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,850 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,864 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2023-12-16 17:45:37,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 17:45:37,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 17:45:37,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 17:45:37,865 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 17:45:37,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,892 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-16 17:45:37,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 17:45:37,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 17:45:37,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 17:45:37,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 17:45:37,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (1/1) ... [2023-12-16 17:45:37,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 17:45:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 17:45:37,923 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-16 17:45:37,935 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-16 17:45:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 17:45:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 17:45:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-12-16 17:45:37,958 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-12-16 17:45:37,958 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-12-16 17:45:37,959 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-12-16 17:45:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 17:45:37,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 17:45:38,002 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 17:45:38,004 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 17:45:38,091 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 17:45:38,120 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 17:45:38,120 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 17:45:38,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:45:38 BoogieIcfgContainer [2023-12-16 17:45:38,120 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 17:45:38,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 17:45:38,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 17:45:38,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 17:45:38,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:45:37" (1/3) ... [2023-12-16 17:45:38,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e5bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:45:38, skipping insertion in model container [2023-12-16 17:45:38,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:45:37" (2/3) ... [2023-12-16 17:45:38,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e5bbf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:45:38, skipping insertion in model container [2023-12-16 17:45:38,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:45:38" (3/3) ... [2023-12-16 17:45:38,125 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2023-12-16 17:45:38,142 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 17:45:38,143 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 17:45:38,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 17:45:38,181 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;@1aa45fe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 17:45:38,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 17:45:38,183 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-16 17:45:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 17:45:38,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:38,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:38,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:38,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1178273046, now seen corresponding path program 1 times [2023-12-16 17:45:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051629253] [2023-12-16 17:45:38,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:38,202 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-16 17:45:38,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:38,204 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-16 17:45:38,210 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-16 17:45:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:38,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:45:38,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:38,348 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-16 17:45:38,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:45:38,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:38,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051629253] [2023-12-16 17:45:38,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051629253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:45:38,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:45:38,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:45:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57070932] [2023-12-16 17:45:38,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:45:38,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:45:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:38,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:45:38,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:45:38,383 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-16 17:45:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:38,487 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2023-12-16 17:45:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:45:38,489 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-16 17:45:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:38,495 INFO L225 Difference]: With dead ends: 32 [2023-12-16 17:45:38,495 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 17:45:38,500 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-16 17:45:38,503 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:38,503 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.1s Time] [2023-12-16 17:45:38,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 17:45:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-16 17:45:38,535 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-16 17:45:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-16 17:45:38,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 9 [2023-12-16 17:45:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:38,537 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-16 17:45:38,538 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-16 17:45:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-16 17:45:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 17:45:38,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:38,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:38,542 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-16 17:45:38,742 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-16 17:45:38,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:38,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:38,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1422996679, now seen corresponding path program 1 times [2023-12-16 17:45:38,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:38,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628618651] [2023-12-16 17:45:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:38,743 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-16 17:45:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:38,744 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-16 17:45:38,745 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-16 17:45:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:38,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 17:45:38,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:38,792 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-16 17:45:38,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 17:45:38,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628618651] [2023-12-16 17:45:38,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628618651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 17:45:38,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 17:45:38,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 17:45:38,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341359583] [2023-12-16 17:45:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 17:45:38,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 17:45:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 17:45:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 17:45:38,795 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-16 17:45:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:38,839 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2023-12-16 17:45:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 17:45:38,839 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-16 17:45:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:38,840 INFO L225 Difference]: With dead ends: 30 [2023-12-16 17:45:38,840 INFO L226 Difference]: Without dead ends: 26 [2023-12-16 17:45:38,841 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-16 17:45:38,842 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-16 17:45:38,842 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-16 17:45:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-16 17:45:38,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-12-16 17:45:38,846 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-16 17:45:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-16 17:45:38,847 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 10 [2023-12-16 17:45:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:38,848 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-16 17:45:38,848 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-16 17:45:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-16 17:45:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 17:45:38,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:38,851 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-16 17:45:38,853 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-16 17:45:39,053 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-16 17:45:39,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:39,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1917903498, now seen corresponding path program 1 times [2023-12-16 17:45:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:39,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265337211] [2023-12-16 17:45:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:39,055 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-16 17:45:39,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:39,056 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-16 17:45:39,057 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-16 17:45:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:39,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:45:39,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:39,171 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-16 17:45:39,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:39,363 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-16 17:45:39,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:39,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265337211] [2023-12-16 17:45:39,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265337211] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:39,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:39,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-16 17:45:39,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145815366] [2023-12-16 17:45:39,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:39,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 17:45:39,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:39,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 17:45:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:45:39,366 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-16 17:45:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:39,511 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2023-12-16 17:45:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:45:39,512 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-16 17:45:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:39,513 INFO L225 Difference]: With dead ends: 36 [2023-12-16 17:45:39,513 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 17:45:39,513 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-16 17:45:39,514 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-16 17:45:39,515 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-16 17:45:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 17:45:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-12-16 17:45:39,519 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-16 17:45:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-16 17:45:39,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 21 [2023-12-16 17:45:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:39,520 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-16 17:45:39,521 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-16 17:45:39,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-16 17:45:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 17:45:39,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:39,522 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-16 17:45:39,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 17:45:39,723 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-16 17:45:39,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:39,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -773369340, now seen corresponding path program 1 times [2023-12-16 17:45:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120644520] [2023-12-16 17:45:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:39,725 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-16 17:45:39,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:39,726 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-16 17:45:39,728 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-16 17:45:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:39,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:45:39,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:39,794 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-16 17:45:39,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:39,938 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-16 17:45:39,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:39,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120644520] [2023-12-16 17:45:39,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120644520] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:39,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:39,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-16 17:45:39,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838294582] [2023-12-16 17:45:39,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:39,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 17:45:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:39,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 17:45:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:45:39,945 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-16 17:45:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:40,069 INFO L93 Difference]: Finished difference Result 60 states and 95 transitions. [2023-12-16 17:45:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:45:40,069 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-16 17:45:40,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:40,073 INFO L225 Difference]: With dead ends: 60 [2023-12-16 17:45:40,073 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 17:45:40,077 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-16 17:45:40,078 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-16 17:45:40,079 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-16 17:45:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 17:45:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-16 17:45:40,093 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-16 17:45:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-12-16 17:45:40,096 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 22 [2023-12-16 17:45:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:40,096 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-12-16 17:45:40,097 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-16 17:45:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2023-12-16 17:45:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 17:45:40,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:40,098 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-16 17:45:40,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 17:45:40,298 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-16 17:45:40,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:40,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:40,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1000055446, now seen corresponding path program 1 times [2023-12-16 17:45:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302122222] [2023-12-16 17:45:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:40,300 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-16 17:45:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:40,301 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-16 17:45:40,317 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-16 17:45:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:40,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:45:40,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:40,420 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-16 17:45:40,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:40,708 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-16 17:45:40,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302122222] [2023-12-16 17:45:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302122222] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:40,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-16 17:45:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418404006] [2023-12-16 17:45:40,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:45:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:45:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:45:40,710 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-16 17:45:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:40,912 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2023-12-16 17:45:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:45:40,914 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-16 17:45:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:40,915 INFO L225 Difference]: With dead ends: 48 [2023-12-16 17:45:40,915 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 17:45:40,916 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-16 17:45:40,916 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-16 17:45:40,916 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-16 17:45:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 17:45:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2023-12-16 17:45:40,922 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-16 17:45:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2023-12-16 17:45:40,923 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 33 [2023-12-16 17:45:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:40,923 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2023-12-16 17:45:40,923 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-16 17:45:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2023-12-16 17:45:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 17:45:40,925 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:40,925 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-16 17:45:40,929 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-16 17:45:41,127 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-16 17:45:41,128 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:41,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1077323161, now seen corresponding path program 1 times [2023-12-16 17:45:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825237705] [2023-12-16 17:45:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:41,129 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-16 17:45:41,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:41,130 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-16 17:45:41,132 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-16 17:45:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:41,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:45:41,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:41,203 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-16 17:45:41,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:41,378 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-16 17:45:41,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:41,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825237705] [2023-12-16 17:45:41,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825237705] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:41,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:41,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-16 17:45:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130685329] [2023-12-16 17:45:41,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:41,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:45:41,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:41,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:45:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:45:41,380 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-16 17:45:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:41,518 INFO L93 Difference]: Finished difference Result 78 states and 149 transitions. [2023-12-16 17:45:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:45:41,519 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-16 17:45:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:41,520 INFO L225 Difference]: With dead ends: 78 [2023-12-16 17:45:41,520 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 17:45:41,521 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-16 17:45:41,521 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-16 17:45:41,522 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-16 17:45:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 17:45:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-16 17:45:41,529 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-16 17:45:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 76 transitions. [2023-12-16 17:45:41,530 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 76 transitions. Word has length 34 [2023-12-16 17:45:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:41,531 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 76 transitions. [2023-12-16 17:45:41,531 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-16 17:45:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 76 transitions. [2023-12-16 17:45:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-16 17:45:41,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:41,532 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-16 17:45:41,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 17:45:41,733 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-16 17:45:41,733 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:41,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash -797673590, now seen corresponding path program 2 times [2023-12-16 17:45:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618561216] [2023-12-16 17:45:41,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:45:41,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 17:45:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:41,735 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-16 17:45:41,740 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-16 17:45:41,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:45:41,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:41,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:45:41,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:41,859 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-16 17:45:41,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:42,271 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-16 17:45:42,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618561216] [2023-12-16 17:45:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618561216] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:42,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:42,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-16 17:45:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373162967] [2023-12-16 17:45:42,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:42,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:45:42,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:45:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:45:42,273 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-16 17:45:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:42,598 INFO L93 Difference]: Finished difference Result 69 states and 141 transitions. [2023-12-16 17:45:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:45:42,599 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-16 17:45:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:42,600 INFO L225 Difference]: With dead ends: 69 [2023-12-16 17:45:42,600 INFO L226 Difference]: Without dead ends: 65 [2023-12-16 17:45:42,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-16 17:45:42,601 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.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:42,601 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.2s Time] [2023-12-16 17:45:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-12-16 17:45:42,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 49. [2023-12-16 17:45:42,615 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-16 17:45:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. [2023-12-16 17:45:42,615 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 45 [2023-12-16 17:45:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:42,616 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 89 transitions. [2023-12-16 17:45:42,616 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-16 17:45:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 89 transitions. [2023-12-16 17:45:42,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 17:45:42,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:42,617 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-16 17:45:42,626 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-16 17:45:42,824 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-16 17:45:42,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:42,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1078970546, now seen corresponding path program 1 times [2023-12-16 17:45:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463012956] [2023-12-16 17:45:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:42,825 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-16 17:45:42,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:42,826 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-16 17:45:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:42,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:45:42,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:42,871 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-16 17:45:42,929 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-16 17:45:42,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:43,158 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-16 17:45:43,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463012956] [2023-12-16 17:45:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463012956] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:43,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-16 17:45:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053993070] [2023-12-16 17:45:43,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:45:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:45:43,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:45:43,160 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-16 17:45:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:43,345 INFO L93 Difference]: Finished difference Result 107 states and 251 transitions. [2023-12-16 17:45:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 17:45:43,346 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-16 17:45:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:43,347 INFO L225 Difference]: With dead ends: 107 [2023-12-16 17:45:43,347 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 17:45:43,348 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-16 17:45:43,348 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.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:43,349 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.1s Time] [2023-12-16 17:45:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 17:45:43,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-16 17:45:43,357 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-16 17:45:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2023-12-16 17:45:43,358 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 46 [2023-12-16 17:45:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:43,358 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2023-12-16 17:45:43,358 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-16 17:45:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2023-12-16 17:45:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 17:45:43,360 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:43,360 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-16 17:45:43,365 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-16 17:45:43,562 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-16 17:45:43,562 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:43,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 82175210, now seen corresponding path program 3 times [2023-12-16 17:45:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912529749] [2023-12-16 17:45:43,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:45:43,563 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-16 17:45:43,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:43,564 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-16 17:45:43,565 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-16 17:45:43,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 17:45:43,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:43,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 17:45:43,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:43,648 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-16 17:45:43,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:43,815 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-16 17:45:43,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912529749] [2023-12-16 17:45:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912529749] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:43,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-16 17:45:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713926426] [2023-12-16 17:45:43,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 17:45:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 17:45:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-16 17:45:43,817 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-16 17:45:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:43,923 INFO L93 Difference]: Finished difference Result 82 states and 162 transitions. [2023-12-16 17:45:43,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 17:45:43,923 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-16 17:45:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:43,924 INFO L225 Difference]: With dead ends: 82 [2023-12-16 17:45:43,924 INFO L226 Difference]: Without dead ends: 78 [2023-12-16 17:45:43,925 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-16 17:45:43,925 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-16 17:45:43,925 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-16 17:45:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-16 17:45:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2023-12-16 17:45:43,934 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-16 17:45:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 119 transitions. [2023-12-16 17:45:43,934 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 119 transitions. Word has length 57 [2023-12-16 17:45:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:43,935 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 119 transitions. [2023-12-16 17:45:43,935 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-16 17:45:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 119 transitions. [2023-12-16 17:45:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 17:45:43,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:43,936 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-16 17:45:43,942 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-16 17:45:44,143 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-16 17:45:44,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:44,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1783295408, now seen corresponding path program 2 times [2023-12-16 17:45:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:44,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47024569] [2023-12-16 17:45:44,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:45:44,144 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-16 17:45:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:44,145 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-16 17:45:44,148 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-16 17:45:44,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:45:44,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:44,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 17:45:44,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:44,298 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-16 17:45:44,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:44,924 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-16 17:45:44,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47024569] [2023-12-16 17:45:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47024569] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:44,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:44,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 16 [2023-12-16 17:45:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225561287] [2023-12-16 17:45:44,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 17:45:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 17:45:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-16 17:45:44,926 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-16 17:45:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:45,447 INFO L93 Difference]: Finished difference Result 162 states and 459 transitions. [2023-12-16 17:45:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 17:45:45,447 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-16 17:45:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:45,449 INFO L225 Difference]: With dead ends: 162 [2023-12-16 17:45:45,449 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 17:45:45,450 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-16 17:45:45,451 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-16 17:45:45,451 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-16 17:45:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 17:45:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-16 17:45:45,466 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-16 17:45:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 231 transitions. [2023-12-16 17:45:45,468 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 231 transitions. Word has length 58 [2023-12-16 17:45:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:45,468 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 231 transitions. [2023-12-16 17:45:45,468 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-16 17:45:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 231 transitions. [2023-12-16 17:45:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-16 17:45:45,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:45,470 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-16 17:45:45,480 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-16 17:45:45,678 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-16 17:45:45,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:45,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:45,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2115449141, now seen corresponding path program 2 times [2023-12-16 17:45:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:45,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451298304] [2023-12-16 17:45:45,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:45:45,679 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-16 17:45:45,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:45,680 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-16 17:45:45,680 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-16 17:45:45,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:45:45,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:45,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:45:45,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-16 17:45:45,814 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 41 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-16 17:45:46,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:46,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451298304] [2023-12-16 17:45:46,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451298304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:46,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:46,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 14 [2023-12-16 17:45:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165699564] [2023-12-16 17:45:46,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:46,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:45:46,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:46,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:45:46,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:45:46,268 INFO L87 Difference]: Start difference. First operand 98 states and 231 transitions. Second operand has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-16 17:45:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:46,551 INFO L93 Difference]: Finished difference Result 164 states and 546 transitions. [2023-12-16 17:45:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 17:45:46,552 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) Word has length 70 [2023-12-16 17:45:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:46,554 INFO L225 Difference]: With dead ends: 164 [2023-12-16 17:45:46,554 INFO L226 Difference]: Without dead ends: 160 [2023-12-16 17:45:46,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-16 17:45:46,555 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:46,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 123 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 17:45:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-16 17:45:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 104. [2023-12-16 17:45:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 63 states have internal predecessors, (65), 20 states have call successors, (20), 5 states have call predecessors, (20), 24 states have return successors, (162), 35 states have call predecessors, (162), 20 states have call successors, (162) [2023-12-16 17:45:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 247 transitions. [2023-12-16 17:45:46,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 247 transitions. Word has length 70 [2023-12-16 17:45:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:46,589 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 247 transitions. [2023-12-16 17:45:46,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 14 states have internal predecessors, (40), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (14), 7 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-16 17:45:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 247 transitions. [2023-12-16 17:45:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 17:45:46,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:46,591 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:46,599 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 (12)] Ended with exit code 0 [2023-12-16 17:45:46,793 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-16 17:45:46,793 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:46,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:46,794 INFO L85 PathProgramCache]: Analyzing trace with hash 961346532, now seen corresponding path program 1 times [2023-12-16 17:45:46,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:46,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489608325] [2023-12-16 17:45:46,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:46,794 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-16 17:45:46,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:46,795 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-16 17:45:46,800 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-16 17:45:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:46,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:45:46,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:46,895 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 29 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-16 17:45:46,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-16 17:45:47,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489608325] [2023-12-16 17:45:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489608325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:47,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-16 17:45:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431227891] [2023-12-16 17:45:47,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:47,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:45:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:45:47,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:45:47,171 INFO L87 Difference]: Start difference. First operand 104 states and 247 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 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-16 17:45:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:47,335 INFO L93 Difference]: Finished difference Result 165 states and 488 transitions. [2023-12-16 17:45:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:45:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 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 72 [2023-12-16 17:45:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:47,338 INFO L225 Difference]: With dead ends: 165 [2023-12-16 17:45:47,339 INFO L226 Difference]: Without dead ends: 161 [2023-12-16 17:45:47,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 132 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-16 17:45:47,339 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:47,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:45:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-16 17:45:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 105. [2023-12-16 17:45:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 20 states have call successors, (20), 5 states have call predecessors, (20), 24 states have return successors, (160), 36 states have call predecessors, (160), 20 states have call successors, (160) [2023-12-16 17:45:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 246 transitions. [2023-12-16 17:45:47,355 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 246 transitions. Word has length 72 [2023-12-16 17:45:47,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:47,356 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 246 transitions. [2023-12-16 17:45:47,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 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-16 17:45:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 246 transitions. [2023-12-16 17:45:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 17:45:47,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:47,357 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:47,374 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 17:45:47,560 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-16 17:45:47,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:47,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1409128243, now seen corresponding path program 2 times [2023-12-16 17:45:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134693527] [2023-12-16 17:45:47,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:45:47,561 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-16 17:45:47,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:47,562 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-16 17:45:47,609 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-16 17:45:47,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:45:47,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:47,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 17:45:47,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-16 17:45:47,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 29 proven. 32 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-12-16 17:45:47,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:47,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134693527] [2023-12-16 17:45:47,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134693527] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:47,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:47,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2023-12-16 17:45:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632911404] [2023-12-16 17:45:47,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:47,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 17:45:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 17:45:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-12-16 17:45:47,872 INFO L87 Difference]: Start difference. First operand 105 states and 246 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 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-16 17:45:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:47,998 INFO L93 Difference]: Finished difference Result 252 states and 817 transitions. [2023-12-16 17:45:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 17:45:47,999 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 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 73 [2023-12-16 17:45:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:48,001 INFO L225 Difference]: With dead ends: 252 [2023-12-16 17:45:48,001 INFO L226 Difference]: Without dead ends: 149 [2023-12-16 17:45:48,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 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-16 17:45:48,002 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:48,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 126 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:45:48,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-16 17:45:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 120. [2023-12-16 17:45:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.088235294117647) internal successors, (74), 71 states have internal predecessors, (74), 23 states have call successors, (23), 5 states have call predecessors, (23), 28 states have return successors, (216), 43 states have call predecessors, (216), 23 states have call successors, (216) [2023-12-16 17:45:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 313 transitions. [2023-12-16 17:45:48,016 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 313 transitions. Word has length 73 [2023-12-16 17:45:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:48,017 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 313 transitions. [2023-12-16 17:45:48,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 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-16 17:45:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 313 transitions. [2023-12-16 17:45:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-16 17:45:48,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:48,018 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:48,036 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-16 17:45:48,221 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-16 17:45:48,221 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:48,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1607563537, now seen corresponding path program 1 times [2023-12-16 17:45:48,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:48,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133761377] [2023-12-16 17:45:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 17:45:48,222 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-16 17:45:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:48,223 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-16 17:45:48,225 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-16 17:45:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 17:45:48,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:45:48,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 82 proven. 109 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-12-16 17:45:48,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 82 proven. 114 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2023-12-16 17:45:48,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133761377] [2023-12-16 17:45:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133761377] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:48,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2023-12-16 17:45:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605844393] [2023-12-16 17:45:48,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:48,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 17:45:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:48,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 17:45:48,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-16 17:45:48,735 INFO L87 Difference]: Start difference. First operand 120 states and 313 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-16 17:45:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:48,895 INFO L93 Difference]: Finished difference Result 197 states and 579 transitions. [2023-12-16 17:45:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 17:45:48,896 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), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) Word has length 147 [2023-12-16 17:45:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:48,898 INFO L225 Difference]: With dead ends: 197 [2023-12-16 17:45:48,899 INFO L226 Difference]: Without dead ends: 171 [2023-12-16 17:45:48,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-16 17:45:48,899 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:48,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 94 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:45:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-16 17:45:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 127. [2023-12-16 17:45:48,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 24 states have call successors, (24), 7 states have call predecessors, (24), 28 states have return successors, (217), 43 states have call predecessors, (217), 24 states have call successors, (217) [2023-12-16 17:45:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 324 transitions. [2023-12-16 17:45:48,921 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 324 transitions. Word has length 147 [2023-12-16 17:45:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:48,922 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 324 transitions. [2023-12-16 17:45:48,922 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), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-16 17:45:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 324 transitions. [2023-12-16 17:45:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 17:45:48,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:48,924 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:48,929 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-16 17:45:49,126 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-16 17:45:49,126 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:49,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash -681928779, now seen corresponding path program 2 times [2023-12-16 17:45:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:49,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127621412] [2023-12-16 17:45:49,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 17:45:49,128 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-16 17:45:49,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:49,129 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-16 17:45:49,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-16 17:45:49,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 17:45:49,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:49,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 17:45:49,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 95 proven. 36 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-16 17:45:49,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 95 proven. 41 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-12-16 17:45:49,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127621412] [2023-12-16 17:45:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127621412] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:49,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2023-12-16 17:45:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116259764] [2023-12-16 17:45:49,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:49,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 17:45:49,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 17:45:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-12-16 17:45:49,621 INFO L87 Difference]: Start difference. First operand 127 states and 324 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-16 17:45:49,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:49,789 INFO L93 Difference]: Finished difference Result 149 states and 381 transitions. [2023-12-16 17:45:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 17:45:49,790 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), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) Word has length 111 [2023-12-16 17:45:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:49,791 INFO L225 Difference]: With dead ends: 149 [2023-12-16 17:45:49,792 INFO L226 Difference]: Without dead ends: 145 [2023-12-16 17:45:49,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-16 17:45:49,793 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:49,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 96 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:45:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-16 17:45:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2023-12-16 17:45:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 24 states have call successors, (24), 7 states have call predecessors, (24), 28 states have return successors, (217), 43 states have call predecessors, (217), 24 states have call successors, (217) [2023-12-16 17:45:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 324 transitions. [2023-12-16 17:45:49,807 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 324 transitions. Word has length 111 [2023-12-16 17:45:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:49,808 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 324 transitions. [2023-12-16 17:45:49,808 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), 10 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2023-12-16 17:45:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 324 transitions. [2023-12-16 17:45:49,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 17:45:49,811 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:49,811 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:49,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-16 17:45:50,014 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-16 17:45:50,015 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:50,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash -849286803, now seen corresponding path program 3 times [2023-12-16 17:45:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734181214] [2023-12-16 17:45:50,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 17:45:50,016 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-16 17:45:50,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:50,017 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-16 17:45:50,017 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-16 17:45:50,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 17:45:50,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 17:45:50,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 17:45:50,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 17:45:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 92 proven. 5 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-12-16 17:45:50,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 17:45:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 92 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 17:45:50,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 17:45:50,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734181214] [2023-12-16 17:45:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734181214] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 17:45:50,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 17:45:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-16 17:45:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556313862] [2023-12-16 17:45:50,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 17:45:50,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 17:45:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 17:45:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 17:45:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-16 17:45:50,404 INFO L87 Difference]: Start difference. First operand 127 states and 324 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2023-12-16 17:45:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 17:45:50,590 INFO L93 Difference]: Finished difference Result 247 states and 785 transitions. [2023-12-16 17:45:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 17:45:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 97 [2023-12-16 17:45:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 17:45:50,592 INFO L225 Difference]: With dead ends: 247 [2023-12-16 17:45:50,592 INFO L226 Difference]: Without dead ends: 129 [2023-12-16 17:45:50,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-12-16 17:45:50,594 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 17:45:50,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 17:45:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-16 17:45:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2023-12-16 17:45:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 70 states have internal predecessors, (77), 23 states have call successors, (23), 7 states have call predecessors, (23), 25 states have return successors, (174), 39 states have call predecessors, (174), 23 states have call successors, (174) [2023-12-16 17:45:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 274 transitions. [2023-12-16 17:45:50,606 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 274 transitions. Word has length 97 [2023-12-16 17:45:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 17:45:50,606 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 274 transitions. [2023-12-16 17:45:50,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 7 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2023-12-16 17:45:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 274 transitions. [2023-12-16 17:45:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 17:45:50,608 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 17:45:50,608 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 17:45:50,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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 17:45:50,810 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-16 17:45:50,811 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 17:45:50,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 17:45:50,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1714529634, now seen corresponding path program 4 times [2023-12-16 17:45:50,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 17:45:50,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311054678] [2023-12-16 17:45:50,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 17:45:50,812 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-16 17:45:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 17:45:50,829 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-16 17:45:50,830 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-16 17:45:50,885 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 17:45:50,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 17:45:50,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 17:45:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 17:45:50,946 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 17:45:50,946 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 17:45:50,947 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 17:45:50,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-16 17:45:51,149 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-16 17:45:51,152 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1] [2023-12-16 17:45:51,154 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 17:45:51,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:45:51 BoogieIcfgContainer [2023-12-16 17:45:51,195 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 17:45:51,196 INFO L158 Benchmark]: Toolchain (without parser) took 13541.05ms. Allocated memory was 302.0MB in the beginning and 385.9MB in the end (delta: 83.9MB). Free memory was 261.7MB in the beginning and 187.6MB in the end (delta: 74.1MB). Peak memory consumption was 158.5MB. Max. memory is 8.0GB. [2023-12-16 17:45:51,196 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 17:45:51,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.24ms. Allocated memory is still 302.0MB. Free memory was 261.2MB in the beginning and 250.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 17:45:51,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.82ms. Allocated memory is still 302.0MB. Free memory was 250.2MB in the beginning and 248.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 17:45:51,197 INFO L158 Benchmark]: Boogie Preprocessor took 37.15ms. Allocated memory is still 302.0MB. Free memory was 248.7MB in the beginning and 247.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 17:45:51,197 INFO L158 Benchmark]: RCFGBuilder took 218.32ms. Allocated memory is still 302.0MB. Free memory was 247.1MB in the beginning and 234.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 17:45:51,197 INFO L158 Benchmark]: TraceAbstraction took 13073.26ms. Allocated memory was 302.0MB in the beginning and 385.9MB in the end (delta: 83.9MB). Free memory was 234.0MB in the beginning and 187.6MB in the end (delta: 46.3MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. [2023-12-16 17:45:51,201 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.13ms. Allocated memory is still 182.5MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.24ms. Allocated memory is still 302.0MB. Free memory was 261.2MB in the beginning and 250.2MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.82ms. Allocated memory is still 302.0MB. Free memory was 250.2MB in the beginning and 248.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.15ms. Allocated memory is still 302.0MB. Free memory was 248.7MB in the beginning and 247.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 218.32ms. Allocated memory is still 302.0MB. Free memory was 247.1MB in the beginning and 234.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13073.26ms. Allocated memory was 302.0MB in the beginning and 385.9MB in the end (delta: 83.9MB). Free memory was 234.0MB in the beginning and 187.6MB in the end (delta: 46.3MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 5; VAL [x=5] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=5] [L39] int result = fibo1(x); [L40] COND TRUE result == 5 VAL [result=5, x=5] [L41] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 1709 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1417 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2433 IncrementalHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 292 mSDtfsCounter, 2433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1848 GetRequests, 1633 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=14, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 273 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1003 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1761 ConstructedInterpolants, 0 QuantifiedInterpolants, 4111 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1343 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3734 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-16 17:45:51,235 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...