/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/bitvector-regression/recHanoi03-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 21:33:18,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 21:33:18,924 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-21 21:33:18,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 21:33:18,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 21:33:18,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 21:33:18,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 21:33:18,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 21:33:18,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 21:33:18,959 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 21:33:18,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 21:33:18,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 21:33:18,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 21:33:18,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 21:33:18,961 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 21:33:18,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 21:33:18,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 21:33:18,962 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 21:33:18,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 21:33:18,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 21:33:18,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 21:33:18,963 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 21:33:18,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 21:33:18,964 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 21:33:18,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 21:33:18,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 21:33:18,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 21:33:18,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 21:33:18,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:33:18,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 21:33:18,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 21:33:18,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 21:33:18,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 21:33:18,967 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 21:33:18,967 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-21 21:33:19,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 21:33:19,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 21:33:19,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 21:33:19,138 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 21:33:19,139 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 21:33:19,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c [2023-12-21 21:33:20,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 21:33:20,285 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 21:33:20,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c [2023-12-21 21:33:20,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434ebd0e9/fff02f4087ff4c26a36c259d8d1af278/FLAG9fbe843ee [2023-12-21 21:33:20,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/434ebd0e9/fff02f4087ff4c26a36c259d8d1af278 [2023-12-21 21:33:20,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 21:33:20,314 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 21:33:20,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 21:33:20,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 21:33:20,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 21:33:20,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20, skipping insertion in model container [2023-12-21 21:33:20,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,336 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 21:33:20,460 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c[838,851] [2023-12-21 21:33:20,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:33:20,475 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 21:33:20,484 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-regression/recHanoi03-1.c[838,851] [2023-12-21 21:33:20,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 21:33:20,493 INFO L206 MainTranslator]: Completed translation [2023-12-21 21:33:20,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20 WrapperNode [2023-12-21 21:33:20,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 21:33:20,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 21:33:20,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 21:33:20,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 21:33:20,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,514 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2023-12-21 21:33:20,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 21:33:20,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 21:33:20,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 21:33:20,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 21:33:20,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,530 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-21 21:33:20,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,533 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 21:33:20,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 21:33:20,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 21:33:20,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 21:33:20,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (1/1) ... [2023-12-21 21:33:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 21:33:20,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 21:33:20,574 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-21 21:33:20,576 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-21 21:33:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 21:33:20,594 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2023-12-21 21:33:20,594 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2023-12-21 21:33:20,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 21:33:20,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 21:33:20,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 21:33:20,643 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 21:33:20,647 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 21:33:20,786 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 21:33:20,801 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 21:33:20,801 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 21:33:20,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:33:20 BoogieIcfgContainer [2023-12-21 21:33:20,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 21:33:20,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 21:33:20,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 21:33:20,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 21:33:20,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 09:33:20" (1/3) ... [2023-12-21 21:33:20,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efe8bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:33:20, skipping insertion in model container [2023-12-21 21:33:20,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:33:20" (2/3) ... [2023-12-21 21:33:20,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efe8bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 09:33:20, skipping insertion in model container [2023-12-21 21:33:20,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:33:20" (3/3) ... [2023-12-21 21:33:20,807 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2023-12-21 21:33:20,824 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 21:33:20,824 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 21:33:20,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 21:33:20,861 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;@444dc86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 21:33:20,861 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 21:33:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 21:33:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 21:33:20,872 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:20,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:20,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:20,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:20,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1546859687, now seen corresponding path program 1 times [2023-12-21 21:33:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14347472] [2023-12-21 21:33:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:33:20,886 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-21 21:33:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:20,888 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-21 21:33:20,894 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-21 21:33:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:33:20,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 21:33:20,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:21,098 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-21 21:33:21,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 21:33:21,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14347472] [2023-12-21 21:33:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14347472] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 21:33:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 21:33:21,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 21:33:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377460460] [2023-12-21 21:33:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 21:33:21,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 21:33:21,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 21:33:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 21:33:21,129 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 21:33:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:21,222 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-21 21:33:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 21:33:21,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 21:33:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:21,229 INFO L225 Difference]: With dead ends: 25 [2023-12-21 21:33:21,229 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 21:33:21,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-21 21:33:21,233 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:21,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 21 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:33:21,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 21:33:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 21:33:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 21:33:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-21 21:33:21,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2023-12-21 21:33:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:21,259 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-21 21:33:21,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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-21 21:33:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-21 21:33:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 21:33:21,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:21,261 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:21,263 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-21 21:33:21,461 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-21 21:33:21,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:21,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash -797183849, now seen corresponding path program 1 times [2023-12-21 21:33:21,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:21,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236829797] [2023-12-21 21:33:21,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 21:33:21,463 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-21 21:33:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:21,482 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-21 21:33:21,484 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-21 21:33:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:33:21,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 21:33:21,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 21:33:21,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:21,932 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-21 21:33:21,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236829797] [2023-12-21 21:33:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236829797] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:21,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-21 21:33:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60715220] [2023-12-21 21:33:21,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:21,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 21:33:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 21:33:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-21 21:33:21,935 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 21:33:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:22,231 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2023-12-21 21:33:22,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 21:33:22,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2023-12-21 21:33:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:22,232 INFO L225 Difference]: With dead ends: 27 [2023-12-21 21:33:22,232 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 21:33:22,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-12-21 21:33:22,233 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:22,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 21:33:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 21:33:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 21:33:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 21:33:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-12-21 21:33:22,237 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2023-12-21 21:33:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:22,238 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-12-21 21:33:22,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 21:33:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-12-21 21:33:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 21:33:22,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:22,239 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:22,244 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-21 21:33:22,440 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-21 21:33:22,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:22,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1671831511, now seen corresponding path program 2 times [2023-12-21 21:33:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:22,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963984862] [2023-12-21 21:33:22,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:33:22,442 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-21 21:33:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:22,443 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-21 21:33:22,444 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-21 21:33:22,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:33:22,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:33:22,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 21:33:22,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 21:33:22,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 21:33:23,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963984862] [2023-12-21 21:33:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963984862] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:23,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2023-12-21 21:33:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821566378] [2023-12-21 21:33:23,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:23,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 21:33:23,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 21:33:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-12-21 21:33:23,484 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-21 21:33:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:23,918 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2023-12-21 21:33:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 21:33:23,919 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 28 [2023-12-21 21:33:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:23,919 INFO L225 Difference]: With dead ends: 33 [2023-12-21 21:33:23,919 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 21:33:23,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2023-12-21 21:33:23,921 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 26 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:23,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 21:33:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 21:33:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 21:33:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 21:33:23,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-12-21 21:33:23,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2023-12-21 21:33:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:23,925 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-12-21 21:33:23,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-21 21:33:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-12-21 21:33:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 21:33:23,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:23,926 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:23,931 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-21 21:33:24,128 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-21 21:33:24,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:24,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -695406825, now seen corresponding path program 3 times [2023-12-21 21:33:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440276757] [2023-12-21 21:33:24,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:33:24,130 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-21 21:33:24,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:24,131 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-21 21:33:24,133 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-21 21:33:24,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 21:33:24,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:33:24,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 21:33:24,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-21 21:33:24,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 21:33:25,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440276757] [2023-12-21 21:33:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440276757] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:25,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2023-12-21 21:33:25,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602711531] [2023-12-21 21:33:25,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:25,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-21 21:33:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-21 21:33:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 21:33:25,784 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-21 21:33:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:26,476 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-12-21 21:33:26,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 21:33:26,478 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 40 [2023-12-21 21:33:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:26,478 INFO L225 Difference]: With dead ends: 39 [2023-12-21 21:33:26,479 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 21:33:26,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2023-12-21 21:33:26,482 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:26,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 163 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 21:33:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 21:33:26,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-21 21:33:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 21:33:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-12-21 21:33:26,486 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 40 [2023-12-21 21:33:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:26,486 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-12-21 21:33:26,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2023-12-21 21:33:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-12-21 21:33:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-21 21:33:26,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:26,487 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:26,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 21:33:26,690 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-21 21:33:26,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:26,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1239392681, now seen corresponding path program 4 times [2023-12-21 21:33:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351163559] [2023-12-21 21:33:26,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:33:26,691 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-21 21:33:26,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:26,692 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-21 21:33:26,696 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-21 21:33:26,728 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:33:26,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:33:26,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 21:33:26,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-21 21:33:27,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-21 21:33:29,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351163559] [2023-12-21 21:33:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351163559] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:29,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2023-12-21 21:33:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890838960] [2023-12-21 21:33:29,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:29,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-21 21:33:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:29,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-21 21:33:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2023-12-21 21:33:29,324 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 30 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-21 21:33:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:30,327 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-12-21 21:33:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-21 21:33:30,327 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 30 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 52 [2023-12-21 21:33:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:30,328 INFO L225 Difference]: With dead ends: 45 [2023-12-21 21:33:30,328 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 21:33:30,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=414, Invalid=3746, Unknown=0, NotChecked=0, Total=4160 [2023-12-21 21:33:30,330 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 96 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:30,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 241 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 21:33:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 21:33:30,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-21 21:33:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-21 21:33:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-12-21 21:33:30,334 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 52 [2023-12-21 21:33:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:30,335 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-12-21 21:33:30,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 30 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-21 21:33:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-12-21 21:33:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-21 21:33:30,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:30,336 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:30,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 21:33:30,538 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-21 21:33:30,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:30,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -11506281, now seen corresponding path program 5 times [2023-12-21 21:33:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076237736] [2023-12-21 21:33:30,539 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 21:33:30,540 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-21 21:33:30,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:30,540 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-21 21:33:30,541 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-21 21:33:30,585 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2023-12-21 21:33:30,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:33:30,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 21:33:30,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-12-21 21:33:30,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-21 21:33:34,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:34,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076237736] [2023-12-21 21:33:34,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076237736] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:34,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:34,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2023-12-21 21:33:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673754370] [2023-12-21 21:33:34,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:34,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-21 21:33:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-21 21:33:34,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2023-12-21 21:33:34,153 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 36 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2023-12-21 21:33:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:35,597 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-12-21 21:33:35,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-21 21:33:35,597 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 36 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 64 [2023-12-21 21:33:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:35,598 INFO L225 Difference]: With dead ends: 51 [2023-12-21 21:33:35,598 INFO L226 Difference]: Without dead ends: 45 [2023-12-21 21:33:35,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=554, Invalid=5608, Unknown=0, NotChecked=0, Total=6162 [2023-12-21 21:33:35,600 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 204 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:35,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 408 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 21:33:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-21 21:33:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-21 21:33:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-21 21:33:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2023-12-21 21:33:35,605 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 64 [2023-12-21 21:33:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:35,605 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2023-12-21 21:33:35,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 36 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2023-12-21 21:33:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2023-12-21 21:33:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 21:33:35,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:35,607 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:35,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-21 21:33:35,807 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-21 21:33:35,810 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:35,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:35,810 INFO L85 PathProgramCache]: Analyzing trace with hash 520953047, now seen corresponding path program 6 times [2023-12-21 21:33:35,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:35,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621368043] [2023-12-21 21:33:35,811 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 21:33:35,811 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-21 21:33:35,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:35,812 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-21 21:33:35,813 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-21 21:33:35,870 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-12-21 21:33:35,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:33:35,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-21 21:33:35,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-12-21 21:33:36,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-21 21:33:40,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:40,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621368043] [2023-12-21 21:33:40,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621368043] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:40,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:40,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2023-12-21 21:33:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731067623] [2023-12-21 21:33:40,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:40,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-21 21:33:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:40,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-21 21:33:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2023-12-21 21:33:40,574 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 66 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 42 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2023-12-21 21:33:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:42,471 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2023-12-21 21:33:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 21:33:42,472 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 42 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 76 [2023-12-21 21:33:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:42,473 INFO L225 Difference]: With dead ends: 57 [2023-12-21 21:33:42,473 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 21:33:42,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=710, Invalid=7846, Unknown=0, NotChecked=0, Total=8556 [2023-12-21 21:33:42,476 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 344 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:42,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 529 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 21:33:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 21:33:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-21 21:33:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 21:33:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2023-12-21 21:33:42,481 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 76 [2023-12-21 21:33:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:42,481 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-12-21 21:33:42,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 42 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2023-12-21 21:33:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2023-12-21 21:33:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-21 21:33:42,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:42,483 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:42,500 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 (8)] Ended with exit code 0 [2023-12-21 21:33:42,683 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-21 21:33:42,686 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:42,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash -230265833, now seen corresponding path program 7 times [2023-12-21 21:33:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003313845] [2023-12-21 21:33:42,687 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 21:33:42,687 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-21 21:33:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:42,689 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-21 21:33:42,690 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-21 21:33:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:33:42,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-21 21:33:42,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-21 21:33:43,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 21:33:48,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003313845] [2023-12-21 21:33:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003313845] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:48,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:48,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2023-12-21 21:33:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017544465] [2023-12-21 21:33:48,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:48,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-12-21 21:33:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-12-21 21:33:48,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2023-12-21 21:33:48,860 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 76 states, 75 states have (on average 1.24) internal successors, (93), 48 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-21 21:33:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:33:51,173 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2023-12-21 21:33:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-21 21:33:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.24) internal successors, (93), 48 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 88 [2023-12-21 21:33:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:33:51,176 INFO L225 Difference]: With dead ends: 63 [2023-12-21 21:33:51,176 INFO L226 Difference]: Without dead ends: 57 [2023-12-21 21:33:51,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=882, Invalid=10460, Unknown=0, NotChecked=0, Total=11342 [2023-12-21 21:33:51,179 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 396 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:33:51,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 650 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 21:33:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-21 21:33:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-12-21 21:33:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 21:33:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2023-12-21 21:33:51,189 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 88 [2023-12-21 21:33:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:33:51,190 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2023-12-21 21:33:51,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.24) internal successors, (93), 48 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2023-12-21 21:33:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2023-12-21 21:33:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-21 21:33:51,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:33:51,192 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:33:51,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-21 21:33:51,399 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-21 21:33:51,399 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:33:51,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:33:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -974365865, now seen corresponding path program 8 times [2023-12-21 21:33:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:33:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854619926] [2023-12-21 21:33:51,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:33:51,400 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-21 21:33:51,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:33:51,401 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-21 21:33:51,402 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-21 21:33:51,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:33:51,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:33:51,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-21 21:33:51,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:33:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-12-21 21:33:52,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:33:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-21 21:33:59,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:33:59,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854619926] [2023-12-21 21:33:59,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854619926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:33:59,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:33:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2023-12-21 21:33:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760955457] [2023-12-21 21:33:59,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:33:59,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-12-21 21:33:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:33:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-12-21 21:33:59,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2023-12-21 21:33:59,060 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 86 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 54 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2023-12-21 21:34:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:34:01,987 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2023-12-21 21:34:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-21 21:34:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 54 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 100 [2023-12-21 21:34:01,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:34:01,989 INFO L225 Difference]: With dead ends: 69 [2023-12-21 21:34:01,989 INFO L226 Difference]: Without dead ends: 63 [2023-12-21 21:34:01,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1906 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1070, Invalid=13450, Unknown=0, NotChecked=0, Total=14520 [2023-12-21 21:34:01,993 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 516 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 21:34:01,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 855 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 21:34:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-21 21:34:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-12-21 21:34:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-21 21:34:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2023-12-21 21:34:02,004 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 100 [2023-12-21 21:34:02,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:34:02,005 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2023-12-21 21:34:02,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 54 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2023-12-21 21:34:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2023-12-21 21:34:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-21 21:34:02,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:34:02,006 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:34:02,013 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 (10)] Ended with exit code 0 [2023-12-21 21:34:02,208 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-21 21:34:02,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:34:02,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:34:02,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1458498199, now seen corresponding path program 9 times [2023-12-21 21:34:02,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:34:02,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858836453] [2023-12-21 21:34:02,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:34:02,209 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-21 21:34:02,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:34:02,210 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-21 21:34:02,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 21:34:02,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-12-21 21:34:02,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:34:02,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 76 conjunts are in the unsatisfiable core [2023-12-21 21:34:02,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:34:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-12-21 21:34:03,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:34:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-21 21:34:11,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:34:11,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858836453] [2023-12-21 21:34:11,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858836453] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:34:11,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:34:11,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2023-12-21 21:34:11,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975539945] [2023-12-21 21:34:11,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:34:11,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 21:34:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:34:11,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 21:34:11,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 21:34:11,671 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 60 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2023-12-21 21:34:14,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:34:14,972 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2023-12-21 21:34:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-21 21:34:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 60 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 112 [2023-12-21 21:34:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:34:14,976 INFO L225 Difference]: With dead ends: 75 [2023-12-21 21:34:14,976 INFO L226 Difference]: Without dead ends: 69 [2023-12-21 21:34:14,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2377 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1274, Invalid=16816, Unknown=0, NotChecked=0, Total=18090 [2023-12-21 21:34:14,979 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 690 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:34:14,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1041 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-21 21:34:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-21 21:34:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-21 21:34:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-21 21:34:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2023-12-21 21:34:14,982 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 112 [2023-12-21 21:34:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:34:14,983 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2023-12-21 21:34:14,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 60 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2023-12-21 21:34:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2023-12-21 21:34:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-21 21:34:14,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:34:14,984 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:34:14,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-21 21:34:15,196 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-21 21:34:15,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:34:15,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:34:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -767682089, now seen corresponding path program 10 times [2023-12-21 21:34:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:34:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297614387] [2023-12-21 21:34:15,197 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:34:15,198 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-21 21:34:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:34:15,199 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-21 21:34:15,206 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-21 21:34:15,289 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:34:15,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:34:15,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 84 conjunts are in the unsatisfiable core [2023-12-21 21:34:15,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:34:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2023-12-21 21:34:16,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:34:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 21:34:26,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:34:26,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297614387] [2023-12-21 21:34:26,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297614387] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:34:26,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:34:26,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2023-12-21 21:34:26,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244018869] [2023-12-21 21:34:26,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:34:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-12-21 21:34:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:34:26,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-12-21 21:34:26,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2023-12-21 21:34:26,927 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 66 states have internal predecessors, (129), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2023-12-21 21:34:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:34:31,117 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2023-12-21 21:34:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-21 21:34:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 66 states have internal predecessors, (129), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 124 [2023-12-21 21:34:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:34:31,119 INFO L225 Difference]: With dead ends: 81 [2023-12-21 21:34:31,119 INFO L226 Difference]: Without dead ends: 75 [2023-12-21 21:34:31,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1494, Invalid=20558, Unknown=0, NotChecked=0, Total=22052 [2023-12-21 21:34:31,121 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 762 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 3069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-21 21:34:31,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1284 Invalid, 3069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-21 21:34:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-21 21:34:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-21 21:34:31,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.02) internal successors, (51), 51 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2023-12-21 21:34:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2023-12-21 21:34:31,125 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 124 [2023-12-21 21:34:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:34:31,125 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2023-12-21 21:34:31,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 66 states have internal predecessors, (129), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2023-12-21 21:34:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2023-12-21 21:34:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 21:34:31,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:34:31,127 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:34:31,131 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-21 21:34:31,330 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-21 21:34:31,330 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:34:31,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:34:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash -724965097, now seen corresponding path program 11 times [2023-12-21 21:34:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:34:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960127904] [2023-12-21 21:34:31,331 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 21:34:31,331 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-21 21:34:31,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:34:31,332 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-21 21:34:31,333 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-21 21:34:31,468 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2023-12-21 21:34:31,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:34:31,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-21 21:34:31,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:34:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-12-21 21:34:32,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:34:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-21 21:34:45,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:34:45,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960127904] [2023-12-21 21:34:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960127904] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:34:45,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:34:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2023-12-21 21:34:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269112050] [2023-12-21 21:34:45,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:34:45,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2023-12-21 21:34:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:34:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2023-12-21 21:34:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2023-12-21 21:34:45,131 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 116 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 72 states have internal predecessors, (141), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2023-12-21 21:34:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:34:49,939 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-12-21 21:34:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-21 21:34:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 72 states have internal predecessors, (141), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 136 [2023-12-21 21:34:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:34:49,941 INFO L225 Difference]: With dead ends: 87 [2023-12-21 21:34:49,941 INFO L226 Difference]: Without dead ends: 81 [2023-12-21 21:34:49,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1730, Invalid=24676, Unknown=0, NotChecked=0, Total=26406 [2023-12-21 21:34:49,943 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 98 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:34:49,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1517 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3183 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-21 21:34:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-21 21:34:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-21 21:34:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 55 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-21 21:34:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2023-12-21 21:34:49,949 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 136 [2023-12-21 21:34:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:34:49,949 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2023-12-21 21:34:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 72 states have internal predecessors, (141), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2023-12-21 21:34:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2023-12-21 21:34:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-21 21:34:49,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:34:49,950 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:34:49,955 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-21 21:34:50,153 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-21 21:34:50,153 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:34:50,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:34:50,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1803704407, now seen corresponding path program 12 times [2023-12-21 21:34:50,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:34:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420733597] [2023-12-21 21:34:50,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 21:34:50,154 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-21 21:34:50,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:34:50,155 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-21 21:34:50,156 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-21 21:34:50,358 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2023-12-21 21:34:50,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:34:50,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 100 conjunts are in the unsatisfiable core [2023-12-21 21:34:50,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:34:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2023-12-21 21:34:51,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:35:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-21 21:35:06,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:35:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420733597] [2023-12-21 21:35:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420733597] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:35:06,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:35:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 75] total 126 [2023-12-21 21:35:06,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596421304] [2023-12-21 21:35:06,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:35:06,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2023-12-21 21:35:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:35:06,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2023-12-21 21:35:06,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=15289, Unknown=0, NotChecked=0, Total=15750 [2023-12-21 21:35:06,026 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 126 states, 125 states have (on average 1.224) internal successors, (153), 78 states have internal predecessors, (153), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2023-12-21 21:35:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:35:11,711 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2023-12-21 21:35:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-12-21 21:35:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 125 states have (on average 1.224) internal successors, (153), 78 states have internal predecessors, (153), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) Word has length 148 [2023-12-21 21:35:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:35:11,712 INFO L225 Difference]: With dead ends: 93 [2023-12-21 21:35:11,712 INFO L226 Difference]: Without dead ends: 87 [2023-12-21 21:35:11,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1982, Invalid=29170, Unknown=0, NotChecked=0, Total=31152 [2023-12-21 21:35:11,714 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 106 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 4302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-21 21:35:11,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 2018 Invalid, 4302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4275 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-21 21:35:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-21 21:35:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-21 21:35:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 26 states have return successors, (27), 26 states have call predecessors, (27), 2 states have call successors, (27) [2023-12-21 21:35:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2023-12-21 21:35:11,718 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 148 [2023-12-21 21:35:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:35:11,718 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2023-12-21 21:35:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 125 states have (on average 1.224) internal successors, (153), 78 states have internal predecessors, (153), 26 states have call successors, (26), 1 states have call predecessors, (26), 48 states have return successors, (48), 48 states have call predecessors, (48), 26 states have call successors, (48) [2023-12-21 21:35:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2023-12-21 21:35:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-21 21:35:11,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:35:11,719 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:35:11,724 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-21 21:35:11,922 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-21 21:35:11,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:35:11,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:35:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 324495255, now seen corresponding path program 13 times [2023-12-21 21:35:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:35:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674215591] [2023-12-21 21:35:11,923 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 21:35:11,923 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-21 21:35:11,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:35:11,925 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-21 21:35:11,925 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-21 21:35:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:35:12,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 108 conjunts are in the unsatisfiable core [2023-12-21 21:35:12,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:35:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2023-12-21 21:35:13,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:35:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1900 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-21 21:35:30,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:35:30,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674215591] [2023-12-21 21:35:30,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674215591] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:35:30,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:35:30,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 81] total 136 [2023-12-21 21:35:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952579250] [2023-12-21 21:35:30,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:35:30,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2023-12-21 21:35:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:35:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2023-12-21 21:35:30,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=17861, Unknown=0, NotChecked=0, Total=18360 [2023-12-21 21:35:30,152 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 136 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 84 states have internal predecessors, (165), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2023-12-21 21:35:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:35:36,610 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2023-12-21 21:35:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-21 21:35:36,611 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 84 states have internal predecessors, (165), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) Word has length 160 [2023-12-21 21:35:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:35:36,612 INFO L225 Difference]: With dead ends: 99 [2023-12-21 21:35:36,612 INFO L226 Difference]: Without dead ends: 93 [2023-12-21 21:35:36,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4781 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=2250, Invalid=34040, Unknown=0, NotChecked=0, Total=36290 [2023-12-21 21:35:36,614 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 546 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 4847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 4602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-21 21:35:36,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 2167 Invalid, 4847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 4602 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-21 21:35:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-21 21:35:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-21 21:35:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 63 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 28 states have return successors, (29), 28 states have call predecessors, (29), 2 states have call successors, (29) [2023-12-21 21:35:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2023-12-21 21:35:36,617 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 160 [2023-12-21 21:35:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:35:36,618 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2023-12-21 21:35:36,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 84 states have internal predecessors, (165), 28 states have call successors, (28), 1 states have call predecessors, (28), 52 states have return successors, (52), 52 states have call predecessors, (52), 28 states have call successors, (52) [2023-12-21 21:35:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2023-12-21 21:35:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-21 21:35:36,619 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:35:36,619 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:35:36,628 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-21 21:35:36,822 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-21 21:35:36,822 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:35:36,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:35:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1187440937, now seen corresponding path program 14 times [2023-12-21 21:35:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:35:36,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007084638] [2023-12-21 21:35:36,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:35:36,823 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-21 21:35:36,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:35:36,824 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-21 21:35:36,827 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-21 21:35:37,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:35:37,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:35:37,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 116 conjunts are in the unsatisfiable core [2023-12-21 21:35:37,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:35:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [2023-12-21 21:35:38,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:35:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 21:35:57,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:35:57,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007084638] [2023-12-21 21:35:57,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007084638] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:35:57,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:35:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 87] total 146 [2023-12-21 21:35:57,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761670770] [2023-12-21 21:35:57,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:35:57,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2023-12-21 21:35:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:35:57,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2023-12-21 21:35:57,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=20633, Unknown=0, NotChecked=0, Total=21170 [2023-12-21 21:35:57,858 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 146 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 90 states have internal predecessors, (177), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2023-12-21 21:36:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:36:04,925 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2023-12-21 21:36:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-12-21 21:36:04,926 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 90 states have internal predecessors, (177), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) Word has length 172 [2023-12-21 21:36:04,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:36:04,926 INFO L225 Difference]: With dead ends: 105 [2023-12-21 21:36:04,926 INFO L226 Difference]: Without dead ends: 99 [2023-12-21 21:36:04,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=2534, Invalid=39286, Unknown=0, NotChecked=0, Total=41820 [2023-12-21 21:36:04,929 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 586 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 5053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-21 21:36:04,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2231 Invalid, 5053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-21 21:36:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-21 21:36:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-21 21:36:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 67 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 30 states have return successors, (31), 30 states have call predecessors, (31), 2 states have call successors, (31) [2023-12-21 21:36:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2023-12-21 21:36:04,932 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 172 [2023-12-21 21:36:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:36:04,932 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2023-12-21 21:36:04,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 145 states have (on average 1.2206896551724138) internal successors, (177), 90 states have internal predecessors, (177), 30 states have call successors, (30), 1 states have call predecessors, (30), 56 states have return successors, (56), 56 states have call predecessors, (56), 30 states have call successors, (56) [2023-12-21 21:36:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2023-12-21 21:36:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-21 21:36:04,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:36:04,933 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:36:04,941 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-21 21:36:05,137 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-21 21:36:05,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:36:05,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:36:05,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1172871657, now seen corresponding path program 15 times [2023-12-21 21:36:05,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:36:05,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545182389] [2023-12-21 21:36:05,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:36:05,138 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-21 21:36:05,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:36:05,139 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-21 21:36:05,140 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-21 21:36:05,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2023-12-21 21:36:05,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:36:05,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-21 21:36:05,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:36:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2023-12-21 21:36:07,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:36:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2552 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-21 21:36:29,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:36:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545182389] [2023-12-21 21:36:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545182389] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:36:29,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:36:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 93] total 156 [2023-12-21 21:36:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588366675] [2023-12-21 21:36:29,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:36:29,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 156 states [2023-12-21 21:36:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:36:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2023-12-21 21:36:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=23605, Unknown=0, NotChecked=0, Total=24180 [2023-12-21 21:36:29,092 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 156 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 96 states have internal predecessors, (189), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2023-12-21 21:36:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:36:37,626 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2023-12-21 21:36:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-21 21:36:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 156 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 96 states have internal predecessors, (189), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) Word has length 184 [2023-12-21 21:36:37,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:36:37,627 INFO L225 Difference]: With dead ends: 111 [2023-12-21 21:36:37,628 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 21:36:37,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6295 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2834, Invalid=44908, Unknown=0, NotChecked=0, Total=47742 [2023-12-21 21:36:37,630 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1866 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 6315 mSolverCounterSat, 901 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 7216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 901 IncrementalHoareTripleChecker+Valid, 6315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:36:37,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1900 Valid, 2981 Invalid, 7216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [901 Valid, 6315 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-21 21:36:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 21:36:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-21 21:36:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2023-12-21 21:36:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2023-12-21 21:36:37,634 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 184 [2023-12-21 21:36:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:36:37,634 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2023-12-21 21:36:37,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 156 states, 155 states have (on average 1.2193548387096773) internal successors, (189), 96 states have internal predecessors, (189), 32 states have call successors, (32), 1 states have call predecessors, (32), 60 states have return successors, (60), 60 states have call predecessors, (60), 32 states have call successors, (60) [2023-12-21 21:36:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2023-12-21 21:36:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-12-21 21:36:37,635 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:36:37,635 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:36:37,641 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-21 21:36:37,839 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-21 21:36:37,839 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:36:37,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:36:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash -488483497, now seen corresponding path program 16 times [2023-12-21 21:36:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:36:37,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355569286] [2023-12-21 21:36:37,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:36:37,840 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-21 21:36:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:36:37,841 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-21 21:36:37,841 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-21 21:36:38,091 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:36:38,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-21 21:36:38,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 21:36:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 21:36:38,211 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 21:36:38,211 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 21:36:38,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 21:36:38,217 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-21 21:36:38,417 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-21 21:36:38,420 INFO L445 BasicCegarLoop]: Path program histogram: [16, 1] [2023-12-21 21:36:38,422 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 21:36:38,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 09:36:38 BoogieIcfgContainer [2023-12-21 21:36:38,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 21:36:38,456 INFO L158 Benchmark]: Toolchain (without parser) took 198142.20ms. Allocated memory was 198.2MB in the beginning and 570.4MB in the end (delta: 372.2MB). Free memory was 153.0MB in the beginning and 490.2MB in the end (delta: -337.3MB). Peak memory consumption was 356.3MB. Max. memory is 8.0GB. [2023-12-21 21:36:38,457 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 198.2MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:36:38,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.74ms. Allocated memory is still 198.2MB. Free memory was 153.0MB in the beginning and 141.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 21:36:38,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.34ms. Allocated memory is still 198.2MB. Free memory was 141.4MB in the beginning and 140.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 21:36:38,457 INFO L158 Benchmark]: Boogie Preprocessor took 20.97ms. Allocated memory is still 198.2MB. Free memory was 140.0MB in the beginning and 138.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:36:38,457 INFO L158 Benchmark]: RCFGBuilder took 259.78ms. Allocated memory is still 198.2MB. Free memory was 138.3MB in the beginning and 127.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 21:36:38,457 INFO L158 Benchmark]: TraceAbstraction took 197653.39ms. Allocated memory was 198.2MB in the beginning and 570.4MB in the end (delta: 372.2MB). Free memory was 126.3MB in the beginning and 490.2MB in the end (delta: -363.9MB). Peak memory consumption was 330.1MB. Max. memory is 8.0GB. [2023-12-21 21:36:38,458 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.16ms. Allocated memory is still 198.2MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.74ms. Allocated memory is still 198.2MB. Free memory was 153.0MB in the beginning and 141.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.34ms. Allocated memory is still 198.2MB. Free memory was 141.4MB in the beginning and 140.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.97ms. Allocated memory is still 198.2MB. Free memory was 140.0MB in the beginning and 138.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 259.78ms. Allocated memory is still 198.2MB. Free memory was 138.3MB in the beginning and 127.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 197653.39ms. Allocated memory was 198.2MB in the beginning and 570.4MB in the end (delta: 372.2MB). Free memory was 126.3MB in the beginning and 490.2MB in the end (delta: -363.9MB). Peak memory consumption was 330.1MB. 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: 36]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=32] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=32] [L19] COND FALSE !(n == 1) VAL [\old(n)=32, n=32] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=31] [L19] COND FALSE !(n == 1) VAL [\old(n)=31, n=31] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=30] [L19] COND FALSE !(n == 1) VAL [\old(n)=30, n=30] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=29] [L19] COND FALSE !(n == 1) VAL [\old(n)=29, n=29] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=28] [L19] COND FALSE !(n == 1) VAL [\old(n)=28, n=28] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=27] [L19] COND FALSE !(n == 1) VAL [\old(n)=27, n=27] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=26] [L19] COND FALSE !(n == 1) VAL [\old(n)=26, n=26] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=25] [L19] COND FALSE !(n == 1) VAL [\old(n)=25, n=25] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=24] [L19] COND FALSE !(n == 1) VAL [\old(n)=24, n=24] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=23] [L19] COND FALSE !(n == 1) VAL [\old(n)=23, n=23] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=22] [L19] COND FALSE !(n == 1) VAL [\old(n)=22, n=22] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=21] [L19] COND FALSE !(n == 1) VAL [\old(n)=21, n=21] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=20] [L19] COND FALSE !(n == 1) VAL [\old(n)=20, n=20] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=19] [L19] COND FALSE !(n == 1) VAL [\old(n)=19, n=19] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=18] [L19] COND FALSE !(n == 1) VAL [\old(n)=18, n=18] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=17] [L19] COND FALSE !(n == 1) VAL [\old(n)=17, n=17] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=16] [L19] COND FALSE !(n == 1) VAL [\old(n)=16, n=16] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=15] [L19] COND FALSE !(n == 1) VAL [\old(n)=15, n=15] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=14] [L19] COND FALSE !(n == 1) VAL [\old(n)=14, n=14] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=13] [L19] COND FALSE !(n == 1) VAL [\old(n)=13, n=13] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=12] [L19] COND FALSE !(n == 1) VAL [\old(n)=12, n=12] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=11] [L19] COND FALSE !(n == 1) VAL [\old(n)=11, n=11] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=10] [L19] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=9] [L19] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR hanoi(n-1) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=2, n=2] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=3, n=3] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=4, n=4] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=5, n=5] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=6, n=6] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=7, n=7] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=8, n=8] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=9, n=9] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=10, n=10] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=11, n=11] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=12, n=12] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=13, n=13] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=14, n=14] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=15, n=15] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=16, n=16] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=17, n=17] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=18, n=18] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=19, n=19] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=20, n=20] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=21, n=21] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=22, n=22] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=23, n=23] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=24, n=24] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=25, n=25] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=26, n=26] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=27, n=27] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=28, n=28] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=29, n=29] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=30, n=30] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=31, n=31] [L22] return 2 * (hanoi(n-1)) + 1; [L22] RET, EXPR hanoi(n-1) VAL [\old(n)=32, n=32] [L22] return 2 * (hanoi(n-1)) + 1; [L31] RET, EXPR hanoi(n) VAL [n=32] [L31] unsigned result = hanoi(n); [L33] COND FALSE !(result+1>0 && result+1 == 1<