/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/combinations/square_5+soft_float_3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 02:49:36,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 02:49:36,135 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-22 02:49:36,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 02:49:36,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 02:49:36,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 02:49:36,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 02:49:36,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 02:49:36,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 02:49:36,164 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 02:49:36,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 02:49:36,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 02:49:36,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 02:49:36,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 02:49:36,166 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 02:49:36,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 02:49:36,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 02:49:36,167 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 02:49:36,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 02:49:36,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 02:49:36,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 02:49:36,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 02:49:36,170 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 02:49:36,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 02:49:36,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:49:36,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 02:49:36,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 02:49:36,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 02:49:36,172 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 02:49:36,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 02:49:36,172 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 02:49:36,172 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 02:49:36,172 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-22 02:49:36,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 02:49:36,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 02:49:36,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 02:49:36,410 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 02:49:36,411 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 02:49:36,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/square_5+soft_float_3a.c.cil.c [2023-12-22 02:49:37,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 02:49:37,661 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 02:49:37,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_3a.c.cil.c [2023-12-22 02:49:37,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554e58830/9953c5d67339470bb27e7bfa95873907/FLAG2ca01b141 [2023-12-22 02:49:37,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554e58830/9953c5d67339470bb27e7bfa95873907 [2023-12-22 02:49:37,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 02:49:37,690 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 02:49:37,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 02:49:37,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 02:49:37,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 02:49:37,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:37,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610b12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37, skipping insertion in model container [2023-12-22 02:49:37,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:37,731 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 02:49:37,858 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_3a.c.cil.c[1998,2011] [2023-12-22 02:49:37,863 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_3a.c.cil.c[2367,2380] [2023-12-22 02:49:37,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:49:37,922 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 02:49:37,932 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_3a.c.cil.c[1998,2011] [2023-12-22 02:49:37,934 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/square_5+soft_float_3a.c.cil.c[2367,2380] [2023-12-22 02:49:37,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 02:49:37,970 INFO L206 MainTranslator]: Completed translation [2023-12-22 02:49:37,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37 WrapperNode [2023-12-22 02:49:37,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 02:49:37,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 02:49:37,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 02:49:37,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 02:49:37,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:37,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,018 INFO L138 Inliner]: procedures = 28, calls = 17, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2023-12-22 02:49:38,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 02:49:38,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 02:49:38,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 02:49:38,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 02:49:38,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,046 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-22 02:49:38,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 02:49:38,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 02:49:38,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 02:49:38,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 02:49:38,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (1/1) ... [2023-12-22 02:49:38,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 02:49:38,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 02:49:38,097 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-22 02:49:38,120 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-22 02:49:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 02:49:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 02:49:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-22 02:49:38,127 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-22 02:49:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 02:49:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 02:49:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-22 02:49:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-22 02:49:38,185 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 02:49:38,187 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 02:49:42,740 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 02:49:42,757 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 02:49:42,757 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-22 02:49:42,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:49:42 BoogieIcfgContainer [2023-12-22 02:49:42,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 02:49:42,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 02:49:42,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 02:49:42,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 02:49:42,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 02:49:37" (1/3) ... [2023-12-22 02:49:42,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692d57ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:49:42, skipping insertion in model container [2023-12-22 02:49:42,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 02:49:37" (2/3) ... [2023-12-22 02:49:42,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692d57ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 02:49:42, skipping insertion in model container [2023-12-22 02:49:42,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 02:49:42" (3/3) ... [2023-12-22 02:49:42,763 INFO L112 eAbstractionObserver]: Analyzing ICFG square_5+soft_float_3a.c.cil.c [2023-12-22 02:49:42,774 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 02:49:42,775 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-22 02:49:42,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 02:49:42,820 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;@6ce0ed8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 02:49:42,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-22 02:49:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 47 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-22 02:49:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 02:49:42,828 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:49:42,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 02:49:42,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:49:42,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:49:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1825724097, now seen corresponding path program 1 times [2023-12-22 02:49:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:49:42,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321832693] [2023-12-22 02:49:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:49:42,848 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-22 02:49:42,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:49:42,851 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-22 02:49:42,885 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-22 02:49:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:49:43,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 02:49:43,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:49:43,251 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-22 02:49:43,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 02:49:43,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 02:49:43,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321832693] [2023-12-22 02:49:43,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321832693] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 02:49:43,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 02:49:43,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 02:49:43,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044741771] [2023-12-22 02:49:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 02:49:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 02:49:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 02:49:43,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 02:49:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 02:49:43,285 INFO L87 Difference]: Start difference. First operand has 54 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 47 states have internal predecessors, (72), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:49:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 02:49:43,339 INFO L93 Difference]: Finished difference Result 104 states and 162 transitions. [2023-12-22 02:49:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 02:49:43,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-22 02:49:43,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 02:49:43,347 INFO L225 Difference]: With dead ends: 104 [2023-12-22 02:49:43,347 INFO L226 Difference]: Without dead ends: 48 [2023-12-22 02:49:43,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 02:49:43,353 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 02:49:43,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 02:49:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-22 02:49:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-22 02:49:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-22 02:49:43,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2023-12-22 02:49:43,404 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 6 [2023-12-22 02:49:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 02:49:43,404 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2023-12-22 02:49:43,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 02:49:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2023-12-22 02:49:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 02:49:43,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 02:49:43,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 02:49:43,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 02:49:43,624 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-22 02:49:43,625 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 02:49:43,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 02:49:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1825664515, now seen corresponding path program 1 times [2023-12-22 02:49:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 02:49:43,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923775177] [2023-12-22 02:49:43,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 02:49:43,628 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-22 02:49:43,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 02:49:43,629 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-22 02:49:43,633 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-22 02:59:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 02:59:26,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 02:59:26,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 02:59:35,080 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:59:47,220 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 02:59:51,325 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-22 03:00:07,802 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:00:15,984 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:00:24,296 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:00:36,553 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:00:44,872 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:00:53,177 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 03:00:57,344 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 2797.0 2000.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from false [2023-12-22 03:01:01,406 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 8.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 16.0))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (/ 5.0 128.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (_ +zero 8 24))) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))) (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (not (fp.lt (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 2797.0 2000.0)))) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0))))) is different from true [2023-12-22 03:01:01,406 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-22 03:01:01,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:01,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923775177] [2023-12-22 03:01:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923775177] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:01:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055258814] [2023-12-22 03:01:01,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:01,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 03:01:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 03:01:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-12-22 03:01:01,409 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 03:01:05,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 03:01:09,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 03:01:14,052 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_main1_~IN~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main1_~IN~0#1| .cse0) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 8.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 16.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 5.0 128.0)) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|) |ULTIMATE.start_main1_~IN~0#1|)) |c_ULTIMATE.start_main1_~result~0#1|) (fp.geq |ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)))) (fp.lt |c_ULTIMATE.start_main1_~IN~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main1_~IN~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 03:01:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:14,352 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2023-12-22 03:01:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 03:01:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-22 03:01:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:14,354 INFO L225 Difference]: With dead ends: 48 [2023-12-22 03:01:14,354 INFO L226 Difference]: Without dead ends: 43 [2023-12-22 03:01:14,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=20, Invalid=18, Unknown=4, NotChecked=30, Total=72 [2023-12-22 03:01:14,355 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:14,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 159 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 134 Unchecked, 8.6s Time] [2023-12-22 03:01:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-22 03:01:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-22 03:01:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 36 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-22 03:01:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2023-12-22 03:01:14,360 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 6 [2023-12-22 03:01:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:14,360 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2023-12-22 03:01:14,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 03:01:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2023-12-22 03:01:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-22 03:01:14,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:14,361 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:14,406 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-22 03:01:14,572 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-22 03:01:14,572 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:14,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:14,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1555454217, now seen corresponding path program 1 times [2023-12-22 03:01:14,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519945642] [2023-12-22 03:01:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:14,574 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-22 03:01:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:14,575 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-22 03:01:14,576 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-22 03:01:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:14,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:01:14,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:14,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:14,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519945642] [2023-12-22 03:01:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519945642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:01:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107249132] [2023-12-22 03:01:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:14,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:01:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:14,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:01:14,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:01:14,774 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:15,334 INFO L93 Difference]: Finished difference Result 95 states and 141 transitions. [2023-12-22 03:01:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:01:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2023-12-22 03:01:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:15,338 INFO L225 Difference]: With dead ends: 95 [2023-12-22 03:01:15,338 INFO L226 Difference]: Without dead ends: 55 [2023-12-22 03:01:15,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:01:15,340 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:15,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 03:01:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-22 03:01:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2023-12-22 03:01:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-22 03:01:15,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2023-12-22 03:01:15,353 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 36 [2023-12-22 03:01:15,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:15,353 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2023-12-22 03:01:15,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2023-12-22 03:01:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 03:01:15,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:15,354 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:15,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-22 03:01:15,560 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-22 03:01:15,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:15,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1540474015, now seen corresponding path program 1 times [2023-12-22 03:01:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749328861] [2023-12-22 03:01:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:15,562 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-22 03:01:15,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:15,564 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-22 03:01:15,569 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-22 03:01:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:15,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:01:15,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:15,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:15,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:15,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:15,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749328861] [2023-12-22 03:01:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749328861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:15,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:01:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780129073] [2023-12-22 03:01:15,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:15,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:01:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:15,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:01:15,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:01:15,807 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:16,324 INFO L93 Difference]: Finished difference Result 97 states and 142 transitions. [2023-12-22 03:01:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 03:01:16,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-12-22 03:01:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:16,326 INFO L225 Difference]: With dead ends: 97 [2023-12-22 03:01:16,326 INFO L226 Difference]: Without dead ends: 57 [2023-12-22 03:01:16,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:01:16,327 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:16,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 137 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 03:01:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-22 03:01:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2023-12-22 03:01:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:01:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2023-12-22 03:01:16,333 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 39 [2023-12-22 03:01:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:16,333 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-12-22 03:01:16,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2023-12-22 03:01:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-22 03:01:16,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:16,334 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:16,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-22 03:01:16,537 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-22 03:01:16,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:16,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:16,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2118278156, now seen corresponding path program 1 times [2023-12-22 03:01:16,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:16,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071527133] [2023-12-22 03:01:16,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:16,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-22 03:01:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:16,541 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-22 03:01:16,543 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-22 03:01:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:16,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:01:16,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:16,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:16,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071527133] [2023-12-22 03:01:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071527133] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:01:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004895554] [2023-12-22 03:01:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:16,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:01:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:01:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:01:16,786 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:17,356 INFO L93 Difference]: Finished difference Result 104 states and 152 transitions. [2023-12-22 03:01:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-22 03:01:17,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-12-22 03:01:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:17,357 INFO L225 Difference]: With dead ends: 104 [2023-12-22 03:01:17,357 INFO L226 Difference]: Without dead ends: 60 [2023-12-22 03:01:17,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:01:17,359 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:17,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 128 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 03:01:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-22 03:01:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2023-12-22 03:01:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 44 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:01:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2023-12-22 03:01:17,367 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 40 [2023-12-22 03:01:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:17,367 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2023-12-22 03:01:17,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2023-12-22 03:01:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-22 03:01:17,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:17,368 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:17,378 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-22 03:01:17,571 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-22 03:01:17,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:17,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1070392928, now seen corresponding path program 1 times [2023-12-22 03:01:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891789445] [2023-12-22 03:01:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:17,573 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-22 03:01:17,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:17,574 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-22 03:01:17,575 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-22 03:01:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:17,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 03:01:17,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:17,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:17,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:17,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891789445] [2023-12-22 03:01:17,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891789445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:17,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:17,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-22 03:01:17,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275858269] [2023-12-22 03:01:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:17,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-22 03:01:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:17,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-22 03:01:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:01:17,933 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:18,922 INFO L93 Difference]: Finished difference Result 111 states and 162 transitions. [2023-12-22 03:01:18,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 03:01:18,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-12-22 03:01:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:18,923 INFO L225 Difference]: With dead ends: 111 [2023-12-22 03:01:18,924 INFO L226 Difference]: Without dead ends: 66 [2023-12-22 03:01:18,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:01:18,925 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 15 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:18,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 166 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-22 03:01:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-22 03:01:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2023-12-22 03:01:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:01:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2023-12-22 03:01:18,933 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 41 [2023-12-22 03:01:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:18,933 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2023-12-22 03:01:18,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-22 03:01:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2023-12-22 03:01:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-22 03:01:18,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:18,935 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:18,940 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-22 03:01:19,138 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-22 03:01:19,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:19,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1793957559, now seen corresponding path program 1 times [2023-12-22 03:01:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145472117] [2023-12-22 03:01:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:19,139 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-22 03:01:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:19,141 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-22 03:01:19,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-22 03:01:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:19,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 03:01:19,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:19,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:01:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:01:20,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145472117] [2023-12-22 03:01:20,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145472117] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:01:20,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:01:20,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 03:01:20,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014928166] [2023-12-22 03:01:20,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:01:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 03:01:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 03:01:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-22 03:01:20,314 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:21,355 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2023-12-22 03:01:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-22 03:01:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2023-12-22 03:01:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:21,357 INFO L225 Difference]: With dead ends: 128 [2023-12-22 03:01:21,358 INFO L226 Difference]: Without dead ends: 82 [2023-12-22 03:01:21,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-22 03:01:21,359 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 52 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:21,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 154 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-22 03:01:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-22 03:01:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2023-12-22 03:01:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:01:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2023-12-22 03:01:21,369 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 42 [2023-12-22 03:01:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:21,369 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2023-12-22 03:01:21,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2023-12-22 03:01:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-22 03:01:21,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:21,374 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:21,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-22 03:01:21,575 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-22 03:01:21,575 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:21,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -727253130, now seen corresponding path program 1 times [2023-12-22 03:01:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:21,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496330307] [2023-12-22 03:01:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:21,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 03:01:21,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:21,581 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-22 03:01:21,582 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-22 03:01:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:21,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 03:01:21,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:22,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:01:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:01:22,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:22,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496330307] [2023-12-22 03:01:22,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496330307] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:01:22,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:01:22,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-22 03:01:22,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688471016] [2023-12-22 03:01:22,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:01:22,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-22 03:01:22,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-22 03:01:22,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-22 03:01:22,975 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:24,823 INFO L93 Difference]: Finished difference Result 144 states and 216 transitions. [2023-12-22 03:01:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-22 03:01:24,824 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2023-12-22 03:01:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:24,825 INFO L225 Difference]: With dead ends: 144 [2023-12-22 03:01:24,825 INFO L226 Difference]: Without dead ends: 90 [2023-12-22 03:01:24,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-22 03:01:24,826 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:24,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 188 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-22 03:01:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-22 03:01:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2023-12-22 03:01:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-22 03:01:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-12-22 03:01:24,838 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 44 [2023-12-22 03:01:24,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:24,839 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-12-22 03:01:24,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-12-22 03:01:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 03:01:24,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:24,841 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:24,844 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-22 03:01:25,041 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-22 03:01:25,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:25,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:25,042 INFO L85 PathProgramCache]: Analyzing trace with hash 105085921, now seen corresponding path program 2 times [2023-12-22 03:01:25,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081242518] [2023-12-22 03:01:25,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 03:01:25,043 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-22 03:01:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:25,044 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-22 03:01:25,045 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-22 03:01:25,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 03:01:25,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 03:01:25,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:01:25,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-22 03:01:25,357 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:25,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081242518] [2023-12-22 03:01:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081242518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-22 03:01:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323068447] [2023-12-22 03:01:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:25,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 03:01:25,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 03:01:25,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-22 03:01:25,359 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:01:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:25,716 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2023-12-22 03:01:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 03:01:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2023-12-22 03:01:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:25,718 INFO L225 Difference]: With dead ends: 93 [2023-12-22 03:01:25,718 INFO L226 Difference]: Without dead ends: 73 [2023-12-22 03:01:25,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-22 03:01:25,719 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:25,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 272 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-22 03:01:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-22 03:01:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2023-12-22 03:01:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 63 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:01:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2023-12-22 03:01:25,728 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 51 [2023-12-22 03:01:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:25,728 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 106 transitions. [2023-12-22 03:01:25,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:01:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2023-12-22 03:01:25,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-22 03:01:25,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:25,729 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:25,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 03:01:25,932 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-22 03:01:25,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:25,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash -287941089, now seen corresponding path program 1 times [2023-12-22 03:01:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834711454] [2023-12-22 03:01:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:25,933 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-22 03:01:25,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:25,935 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-22 03:01:25,937 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-22 03:01:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:26,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 03:01:26,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:26,748 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:26,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:01:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:01:28,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834711454] [2023-12-22 03:01:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834711454] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:01:28,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:01:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-22 03:01:28,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699474784] [2023-12-22 03:01:28,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:01:28,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-22 03:01:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:28,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-22 03:01:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-12-22 03:01:28,394 INFO L87 Difference]: Start difference. First operand 72 states and 106 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:32,509 INFO L93 Difference]: Finished difference Result 193 states and 290 transitions. [2023-12-22 03:01:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-22 03:01:32,510 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2023-12-22 03:01:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:32,511 INFO L225 Difference]: With dead ends: 193 [2023-12-22 03:01:32,511 INFO L226 Difference]: Without dead ends: 128 [2023-12-22 03:01:32,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2023-12-22 03:01:32,512 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 111 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:32,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 353 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-22 03:01:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-22 03:01:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 86. [2023-12-22 03:01:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.48) internal successors, (111), 77 states have internal predecessors, (111), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:01:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2023-12-22 03:01:32,541 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 129 transitions. Word has length 51 [2023-12-22 03:01:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:32,541 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 129 transitions. [2023-12-22 03:01:32,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 129 transitions. [2023-12-22 03:01:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-22 03:01:32,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:32,542 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:32,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-22 03:01:32,745 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-22 03:01:32,746 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:32,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1893265716, now seen corresponding path program 1 times [2023-12-22 03:01:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522653615] [2023-12-22 03:01:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:32,747 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-22 03:01:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:32,748 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-22 03:01:32,751 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-22 03:01:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:32,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 03:01:32,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:33,814 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:33,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:01:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:01:36,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522653615] [2023-12-22 03:01:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522653615] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:01:36,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:01:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-22 03:01:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495565680] [2023-12-22 03:01:36,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:01:36,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-22 03:01:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-22 03:01:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-12-22 03:01:36,002 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:41,670 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2023-12-22 03:01:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-22 03:01:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 56 [2023-12-22 03:01:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:41,672 INFO L225 Difference]: With dead ends: 216 [2023-12-22 03:01:41,672 INFO L226 Difference]: Without dead ends: 137 [2023-12-22 03:01:41,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=354, Invalid=638, Unknown=0, NotChecked=0, Total=992 [2023-12-22 03:01:41,673 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 243 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:41,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 440 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-22 03:01:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-22 03:01:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 96. [2023-12-22 03:01:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 87 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:01:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2023-12-22 03:01:41,689 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 56 [2023-12-22 03:01:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:41,689 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2023-12-22 03:01:41,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:01:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2023-12-22 03:01:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-22 03:01:41,690 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:41,690 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:41,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-22 03:01:41,901 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-22 03:01:41,901 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:41,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash -498968865, now seen corresponding path program 2 times [2023-12-22 03:01:41,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404707939] [2023-12-22 03:01:41,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 03:01:41,902 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-22 03:01:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:41,903 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-22 03:01:41,905 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-22 03:01:41,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 03:01:41,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 03:01:41,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 03:01:41,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2023-12-22 03:01:42,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:01:42,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:42,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404707939] [2023-12-22 03:01:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404707939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:01:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:01:42,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 03:01:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536149453] [2023-12-22 03:01:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:01:42,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 03:01:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:42,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 03:01:42,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 03:01:42,023 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:01:42,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:01:42,097 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2023-12-22 03:01:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 03:01:42,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2023-12-22 03:01:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:01:42,099 INFO L225 Difference]: With dead ends: 105 [2023-12-22 03:01:42,099 INFO L226 Difference]: Without dead ends: 96 [2023-12-22 03:01:42,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 03:01:42,099 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 03:01:42,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 03:01:42,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-22 03:01:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-22 03:01:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 87 states have internal predecessors, (127), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:01:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2023-12-22 03:01:42,111 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 69 [2023-12-22 03:01:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:01:42,111 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2023-12-22 03:01:42,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:01:42,111 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2023-12-22 03:01:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-22 03:01:42,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:01:42,112 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:01:42,116 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-22 03:01:42,316 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-22 03:01:42,317 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:01:42,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:01:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2017792795, now seen corresponding path program 1 times [2023-12-22 03:01:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:01:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685456359] [2023-12-22 03:01:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:01:42,318 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-22 03:01:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:01:42,319 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-22 03:01:42,320 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-22 03:01:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:01:42,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-22 03:01:42,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:01:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 19 proven. 155 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:01:44,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:01:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 3 proven. 161 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:01:48,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:01:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685456359] [2023-12-22 03:01:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685456359] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:01:48,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:01:48,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-12-22 03:01:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843254151] [2023-12-22 03:01:48,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:01:48,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-22 03:01:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:01:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-22 03:01:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-12-22 03:01:48,883 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:02:06,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:02:06,401 INFO L93 Difference]: Finished difference Result 301 states and 458 transitions. [2023-12-22 03:02:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-22 03:02:06,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2023-12-22 03:02:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:02:06,403 INFO L225 Difference]: With dead ends: 301 [2023-12-22 03:02:06,403 INFO L226 Difference]: Without dead ends: 212 [2023-12-22 03:02:06,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=729, Invalid=1433, Unknown=0, NotChecked=0, Total=2162 [2023-12-22 03:02:06,404 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 356 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-12-22 03:02:06,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1045 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2023-12-22 03:02:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-22 03:02:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 122. [2023-12-22 03:02:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 113 states have internal predecessors, (170), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:02:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 188 transitions. [2023-12-22 03:02:06,426 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 188 transitions. Word has length 71 [2023-12-22 03:02:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:02:06,427 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 188 transitions. [2023-12-22 03:02:06,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:02:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 188 transitions. [2023-12-22 03:02:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-22 03:02:06,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:02:06,428 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:02:06,438 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 (14)] Ended with exit code 0 [2023-12-22 03:02:06,632 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-22 03:02:06,632 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:02:06,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:02:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -926620422, now seen corresponding path program 1 times [2023-12-22 03:02:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:02:06,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604822480] [2023-12-22 03:02:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:02:06,634 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-22 03:02:06,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:02:06,635 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-22 03:02:06,636 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-22 03:02:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:02:06,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-22 03:02:06,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:02:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 19 proven. 273 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:02:09,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:02:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 3 proven. 279 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:02:15,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:02:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604822480] [2023-12-22 03:02:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604822480] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:02:15,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:02:15,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-12-22 03:02:15,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403027093] [2023-12-22 03:02:15,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:02:15,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-22 03:02:15,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:02:15,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-22 03:02:15,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-12-22 03:02:15,533 INFO L87 Difference]: Start difference. First operand 122 states and 188 transitions. Second operand has 34 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 34 states have internal predecessors, (117), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:02:31,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:02:31,435 INFO L93 Difference]: Finished difference Result 310 states and 472 transitions. [2023-12-22 03:02:31,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-22 03:02:31,436 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 34 states have internal predecessors, (117), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 82 [2023-12-22 03:02:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:02:31,437 INFO L225 Difference]: With dead ends: 310 [2023-12-22 03:02:31,437 INFO L226 Difference]: Without dead ends: 195 [2023-12-22 03:02:31,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=991, Invalid=2315, Unknown=0, NotChecked=0, Total=3306 [2023-12-22 03:02:31,439 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 430 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2023-12-22 03:02:31,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1156 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2023-12-22 03:02:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-22 03:02:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 126. [2023-12-22 03:02:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 117 states have internal predecessors, (177), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:02:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2023-12-22 03:02:31,473 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 82 [2023-12-22 03:02:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:02:31,473 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2023-12-22 03:02:31,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 34 states have internal predecessors, (117), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:02:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2023-12-22 03:02:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-22 03:02:31,474 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:02:31,474 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:02:31,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-22 03:02:31,678 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-22 03:02:31,678 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:02:31,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:02:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -207720859, now seen corresponding path program 2 times [2023-12-22 03:02:31,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:02:31,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701364659] [2023-12-22 03:02:31,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 03:02:31,680 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-22 03:02:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:02:31,681 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-22 03:02:31,683 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-22 03:02:31,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-22 03:02:31,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-22 03:02:31,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 03:02:31,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:02:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2023-12-22 03:02:31,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 03:02:31,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:02:31,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701364659] [2023-12-22 03:02:31,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701364659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 03:02:31,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 03:02:31,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 03:02:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122600598] [2023-12-22 03:02:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 03:02:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 03:02:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:02:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 03:02:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 03:02:31,821 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:02:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:02:31,985 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2023-12-22 03:02:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 03:02:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2023-12-22 03:02:31,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:02:32,000 INFO L225 Difference]: With dead ends: 136 [2023-12-22 03:02:32,000 INFO L226 Difference]: Without dead ends: 126 [2023-12-22 03:02:32,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 03:02:32,002 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 03:02:32,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 166 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 03:02:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-22 03:02:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-22 03:02:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 115 states have (on average 1.5304347826086957) internal successors, (176), 117 states have internal predecessors, (176), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:02:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 194 transitions. [2023-12-22 03:02:32,011 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 194 transitions. Word has length 107 [2023-12-22 03:02:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:02:32,012 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 194 transitions. [2023-12-22 03:02:32,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-22 03:02:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 194 transitions. [2023-12-22 03:02:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-22 03:02:32,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:02:32,013 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:02:32,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-22 03:02:32,215 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-22 03:02:32,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:02:32,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:02:32,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1017067485, now seen corresponding path program 1 times [2023-12-22 03:02:32,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:02:32,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188520398] [2023-12-22 03:02:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:02:32,217 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-22 03:02:32,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:02:32,218 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-22 03:02:32,247 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-22 03:02:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:02:32,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-22 03:02:32,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:02:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 19 proven. 737 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 03:02:38,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 03:02:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 3 proven. 743 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-22 03:02:51,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 03:02:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188520398] [2023-12-22 03:02:51,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188520398] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 03:02:51,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 03:02:51,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-12-22 03:02:51,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046084872] [2023-12-22 03:02:51,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 03:02:51,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-22 03:02:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 03:02:51,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-22 03:02:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2023-12-22 03:02:51,893 INFO L87 Difference]: Start difference. First operand 126 states and 194 transitions. Second operand has 50 states, 50 states have (on average 3.34) internal successors, (167), 50 states have internal predecessors, (167), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:04:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 03:04:00,914 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2023-12-22 03:04:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-22 03:04:00,915 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.34) internal successors, (167), 50 states have internal predecessors, (167), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2023-12-22 03:04:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 03:04:00,916 INFO L225 Difference]: With dead ends: 499 [2023-12-22 03:04:00,917 INFO L226 Difference]: Without dead ends: 380 [2023-12-22 03:04:00,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=2901, Invalid=6029, Unknown=0, NotChecked=0, Total=8930 [2023-12-22 03:04:00,919 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1264 mSDsluCounter, 2599 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 5569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.0s IncrementalHoareTripleChecker+Time [2023-12-22 03:04:00,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 2711 Invalid, 5569 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 45.0s Time] [2023-12-22 03:04:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-12-22 03:04:00,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 194. [2023-12-22 03:04:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 183 states have (on average 1.5792349726775956) internal successors, (289), 185 states have internal predecessors, (289), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-22 03:04:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 307 transitions. [2023-12-22 03:04:00,938 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 307 transitions. Word has length 107 [2023-12-22 03:04:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 03:04:00,938 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 307 transitions. [2023-12-22 03:04:00,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.34) internal successors, (167), 50 states have internal predecessors, (167), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-22 03:04:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions. [2023-12-22 03:04:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-22 03:04:00,939 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 03:04:00,939 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 23, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:04:00,943 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-22 03:04:01,143 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-22 03:04:01,144 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 03:04:01,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 03:04:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1695105672, now seen corresponding path program 1 times [2023-12-22 03:04:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 03:04:01,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888468796] [2023-12-22 03:04:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 03:04:01,145 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-22 03:04:01,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 03:04:01,146 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-22 03:04:01,147 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-22 03:04:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 03:04:01,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-22 03:04:01,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 03:04:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 7 proven. 834 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-22 03:04:14,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-22 03:04:24,501 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-22 03:04:24,505 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 03:04:24,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-22 03:04:24,507 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 03:04:24,702 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-22 03:04:24,702 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 113 with TraceHistMax 24,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. [2023-12-22 03:04:24,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-22 03:04:24,706 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 03:04:24,709 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 03:04:24,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 03:04:24 BoogieIcfgContainer [2023-12-22 03:04:24,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 03:04:24,712 INFO L158 Benchmark]: Toolchain (without parser) took 887021.50ms. Allocated memory is still 294.6MB. Free memory was 252.5MB in the beginning and 233.7MB in the end (delta: 18.8MB). Peak memory consumption was 19.0MB. Max. memory is 8.0GB. [2023-12-22 03:04:24,712 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 177.2MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 03:04:24,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.63ms. Allocated memory is still 294.6MB. Free memory was 252.1MB in the beginning and 237.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-22 03:04:24,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.53ms. Allocated memory is still 294.6MB. Free memory was 237.0MB in the beginning and 235.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 03:04:24,713 INFO L158 Benchmark]: Boogie Preprocessor took 50.49ms. Allocated memory is still 294.6MB. Free memory was 235.3MB in the beginning and 232.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 03:04:24,713 INFO L158 Benchmark]: RCFGBuilder took 4687.63ms. Allocated memory is still 294.6MB. Free memory was 232.6MB in the beginning and 214.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-22 03:04:24,713 INFO L158 Benchmark]: TraceAbstraction took 881952.59ms. Allocated memory is still 294.6MB. Free memory was 213.7MB in the beginning and 233.7MB in the end (delta: -20.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 03:04:24,716 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.14ms. Allocated memory is still 177.2MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.63ms. Allocated memory is still 294.6MB. Free memory was 252.1MB in the beginning and 237.0MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.53ms. Allocated memory is still 294.6MB. Free memory was 237.0MB in the beginning and 235.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.49ms. Allocated memory is still 294.6MB. Free memory was 235.3MB in the beginning and 232.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 4687.63ms. Allocated memory is still 294.6MB. Free memory was 232.6MB in the beginning and 214.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 881952.59ms. Allocated memory is still 294.6MB. Free memory was 213.7MB in the beginning and 233.7MB in the end (delta: -20.0MB). There was no memory consumed. 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 - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 60). Cancelled while NwaCegarLoop was analyzing trace of length 113 with TraceHistMax 24,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 48). Cancelled while NwaCegarLoop was analyzing trace of length 113 with TraceHistMax 24,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 881.9s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 131.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2685 SdHoareTripleChecker+Valid, 88.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2685 mSDsluCounter, 7383 SdHoareTripleChecker+Invalid, 85.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 134 IncrementalHoareTripleChecker+Unchecked, 6423 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10054 IncrementalHoareTripleChecker+Invalid, 10362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 960 mSDtfsCounter, 10054 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1508 GetRequests, 1210 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2427 ImplicationChecksByTransitivity, 85.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=16, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 510 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 583.3s SatisfiabilityAnalysisTime, 139.4s InterpolantComputationTime, 848 NumberOfCodeBlocks, 677 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1278 ConstructedInterpolants, 2 QuantifiedInterpolants, 5720 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1364 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 1380/3904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown