/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/eca-rers2012/Problem11_label31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 09:31:22,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 09:31:22,050 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 09:31:22,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 09:31:22,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 09:31:22,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 09:31:22,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 09:31:22,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 09:31:22,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 09:31:22,069 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 09:31:22,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 09:31:22,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 09:31:22,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 09:31:22,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 09:31:22,071 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 09:31:22,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 09:31:22,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 09:31:22,074 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 09:31:22,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 09:31:22,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 09:31:22,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 09:31:22,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 09:31:22,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 09:31:22,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 09:31:22,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 09:31:22,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 09:31:22,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 09:31:22,077 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 09:31:22,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 09:31:22,078 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 09:31:22,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 09:31:22,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 09:31:22,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 09:31:22,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 09:31:22,080 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 09:31:22,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 09:31:22,080 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 09:31:22,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 09:31:22,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 09:31:22,081 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 09:31:22,081 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 09:31:22,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 09:31:22,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 09:31:22,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 09:31:22,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 09:31:22,304 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 09:31:22,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label31.c [2023-12-22 09:31:23,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 09:31:23,662 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 09:31:23,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label31.c [2023-12-22 09:31:23,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda2a01fa/2af2bb87de68458cb7571ac442cbebaf/FLAG6fe67b003 [2023-12-22 09:31:23,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda2a01fa/2af2bb87de68458cb7571ac442cbebaf [2023-12-22 09:31:23,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 09:31:23,693 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 09:31:23,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 09:31:23,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 09:31:23,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 09:31:23,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 09:31:23" (1/1) ... [2023-12-22 09:31:23,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249b641b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:23, skipping insertion in model container [2023-12-22 09:31:23,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 09:31:23" (1/1) ... [2023-12-22 09:31:23,745 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 09:31:23,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/eca-rers2012/Problem11_label31.c[1180,1193] [2023-12-22 09:31:24,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 09:31:24,065 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 09:31:24,075 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label31.c[1180,1193] [2023-12-22 09:31:24,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 09:31:24,191 INFO L206 MainTranslator]: Completed translation [2023-12-22 09:31:24,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24 WrapperNode [2023-12-22 09:31:24,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 09:31:24,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 09:31:24,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 09:31:24,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 09:31:24,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,294 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 998 [2023-12-22 09:31:24,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 09:31:24,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 09:31:24,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 09:31:24,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 09:31:24,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,339 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 09:31:24,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 09:31:24,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 09:31:24,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 09:31:24,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 09:31:24,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (1/1) ... [2023-12-22 09:31:24,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 09:31:24,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 09:31:24,416 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 09:31:24,433 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 09:31:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 09:31:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 09:31:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 09:31:24,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 09:31:24,490 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 09:31:24,492 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 09:31:31,425 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 09:31:31,477 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 09:31:31,477 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 09:31:31,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 09:31:31 BoogieIcfgContainer [2023-12-22 09:31:31,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 09:31:31,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 09:31:31,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 09:31:31,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 09:31:31,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 09:31:23" (1/3) ... [2023-12-22 09:31:31,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673da0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 09:31:31, skipping insertion in model container [2023-12-22 09:31:31,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 09:31:24" (2/3) ... [2023-12-22 09:31:31,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673da0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 09:31:31, skipping insertion in model container [2023-12-22 09:31:31,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 09:31:31" (3/3) ... [2023-12-22 09:31:31,485 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label31.c [2023-12-22 09:31:31,497 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 09:31:31,498 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 09:31:31,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 09:31:31,546 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;@2eef02e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 09:31:31,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 09:31:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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 09:31:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 09:31:31,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:31:31,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 09:31:31,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:31:31,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:31:31,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1854374530, now seen corresponding path program 1 times [2023-12-22 09:31:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:31:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095065641] [2023-12-22 09:31:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:31:31,571 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 09:31:31,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:31:31,573 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 09:31:31,597 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 09:31:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:31:31,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 09:31:31,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:31:31,656 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 09:31:31,656 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:31:31,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:31:31,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095065641] [2023-12-22 09:31:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095065641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:31:31,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:31:31,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:31:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209779971] [2023-12-22 09:31:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:31:31,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 09:31:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:31:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 09:31:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 09:31:31,696 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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) 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 09:31:31,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:31:31,732 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2023-12-22 09:31:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 09:31:31,734 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 09:31:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:31:31,741 INFO L225 Difference]: With dead ends: 441 [2023-12-22 09:31:31,741 INFO L226 Difference]: Without dead ends: 219 [2023-12-22 09:31:31,743 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 09:31:31,745 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 09:31:31,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 09:31:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-22 09:31:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-12-22 09:31:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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 09:31:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2023-12-22 09:31:31,777 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 6 [2023-12-22 09:31:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:31:31,778 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2023-12-22 09:31:31,778 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 09:31:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2023-12-22 09:31:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-22 09:31:31,778 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:31:31,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-22 09:31:31,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-22 09:31:31,983 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 09:31:31,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:31:31,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:31:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1855588273, now seen corresponding path program 1 times [2023-12-22 09:31:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:31:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374422830] [2023-12-22 09:31:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:31:31,985 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 09:31:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:31:31,988 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 09:31:31,992 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 09:31:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:31:32,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:31:32,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:31:32,034 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 09:31:32,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:31:32,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:31:32,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374422830] [2023-12-22 09:31:32,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374422830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:31:32,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:31:32,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:31:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035872962] [2023-12-22 09:31:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:31:32,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:31:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:31:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:31:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:31:32,036 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 2.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 09:31:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:31:39,337 INFO L93 Difference]: Finished difference Result 629 states and 1028 transitions. [2023-12-22 09:31:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:31:39,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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 09:31:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:31:39,347 INFO L225 Difference]: With dead ends: 629 [2023-12-22 09:31:39,347 INFO L226 Difference]: Without dead ends: 411 [2023-12-22 09:31:39,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 09:31:39,349 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 199 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:31:39,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 144 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-22 09:31:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-22 09:31:39,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2023-12-22 09:31:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4594594594594594) internal successors, (594), 407 states have internal predecessors, (594), 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 09:31:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 594 transitions. [2023-12-22 09:31:39,368 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 594 transitions. Word has length 6 [2023-12-22 09:31:39,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:31:39,368 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 594 transitions. [2023-12-22 09:31:39,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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 09:31:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 594 transitions. [2023-12-22 09:31:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-22 09:31:39,370 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:31:39,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:31:39,376 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 09:31:39,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 09:31:39,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:31:39,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:31:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1140471862, now seen corresponding path program 1 times [2023-12-22 09:31:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:31:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175692684] [2023-12-22 09:31:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:31:39,577 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 09:31:39,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:31:39,582 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 09:31:39,583 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 09:31:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:31:39,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:31:39,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:31:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:31:39,801 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:31:39,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:31:39,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175692684] [2023-12-22 09:31:39,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175692684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:31:39,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:31:39,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:31:39,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171572062] [2023-12-22 09:31:39,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:31:39,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:31:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:31:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:31:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:31:39,810 INFO L87 Difference]: Start difference. First operand 408 states and 594 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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 09:31:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:31:49,794 INFO L93 Difference]: Finished difference Result 1198 states and 1750 transitions. [2023-12-22 09:31:49,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:31:49,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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 74 [2023-12-22 09:31:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:31:49,804 INFO L225 Difference]: With dead ends: 1198 [2023-12-22 09:31:49,804 INFO L226 Difference]: Without dead ends: 791 [2023-12-22 09:31:49,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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 09:31:49,806 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 132 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-12-22 09:31:49,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 181 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-12-22 09:31:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-12-22 09:31:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 780. [2023-12-22 09:31:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.3478818998716302) internal successors, (1050), 779 states have internal predecessors, (1050), 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 09:31:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1050 transitions. [2023-12-22 09:31:49,837 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1050 transitions. Word has length 74 [2023-12-22 09:31:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:31:49,838 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1050 transitions. [2023-12-22 09:31:49,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 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 09:31:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1050 transitions. [2023-12-22 09:31:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-22 09:31:49,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:31:49,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:31:49,850 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 09:31:50,043 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 09:31:50,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:31:50,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:31:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash -300867777, now seen corresponding path program 1 times [2023-12-22 09:31:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:31:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868972317] [2023-12-22 09:31:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:31:50,047 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 09:31:50,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:31:50,048 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 09:31:50,049 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 09:31:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:31:50,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:31:50,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:31:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:31:50,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:31:50,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:31:50,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868972317] [2023-12-22 09:31:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868972317] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:31:50,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:31:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:31:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352700110] [2023-12-22 09:31:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:31:50,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:31:50,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:31:50,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:31:50,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:31:50,304 INFO L87 Difference]: Start difference. First operand 780 states and 1050 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 09:31:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:31:57,424 INFO L93 Difference]: Finished difference Result 1928 states and 2650 transitions. [2023-12-22 09:31:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:31:57,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 77 [2023-12-22 09:31:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:31:57,435 INFO L225 Difference]: With dead ends: 1928 [2023-12-22 09:31:57,435 INFO L226 Difference]: Without dead ends: 1149 [2023-12-22 09:31:57,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 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 09:31:57,436 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 148 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-22 09:31:57,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-22 09:31:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-22 09:31:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2023-12-22 09:31:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.2569686411149825) internal successors, (1443), 1148 states have internal predecessors, (1443), 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 09:31:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1443 transitions. [2023-12-22 09:31:57,471 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1443 transitions. Word has length 77 [2023-12-22 09:31:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:31:57,471 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1443 transitions. [2023-12-22 09:31:57,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 09:31:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1443 transitions. [2023-12-22 09:31:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-22 09:31:57,475 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:31:57,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:31:57,483 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 09:31:57,681 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 09:31:57,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:31:57,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:31:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 581400735, now seen corresponding path program 1 times [2023-12-22 09:31:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:31:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194463905] [2023-12-22 09:31:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:31:57,684 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 09:31:57,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:31:57,702 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 09:31:57,737 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 09:31:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:31:57,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:31:57,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:31:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:31:57,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:31:57,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:31:57,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194463905] [2023-12-22 09:31:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194463905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:31:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:31:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:31:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741271447] [2023-12-22 09:31:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:31:57,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:31:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:31:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:31:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:31:57,834 INFO L87 Difference]: Start difference. First operand 1149 states and 1443 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 09:32:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:05,634 INFO L93 Difference]: Finished difference Result 2313 states and 3054 transitions. [2023-12-22 09:32:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:05,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2023-12-22 09:32:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:05,644 INFO L225 Difference]: With dead ends: 2313 [2023-12-22 09:32:05,644 INFO L226 Difference]: Without dead ends: 1533 [2023-12-22 09:32:05,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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 09:32:05,645 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 198 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:05,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 334 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2023-12-22 09:32:05,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-12-22 09:32:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1525. [2023-12-22 09:32:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.244750656167979) internal successors, (1897), 1524 states have internal predecessors, (1897), 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 09:32:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1897 transitions. [2023-12-22 09:32:05,664 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1897 transitions. Word has length 133 [2023-12-22 09:32:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:05,665 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1897 transitions. [2023-12-22 09:32:05,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 09:32:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1897 transitions. [2023-12-22 09:32:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-22 09:32:05,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:05,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:05,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-22 09:32:05,875 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 09:32:05,875 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:05,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:05,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2064446359, now seen corresponding path program 1 times [2023-12-22 09:32:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:05,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124445312] [2023-12-22 09:32:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:05,877 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 09:32:05,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:05,878 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 09:32:05,891 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 09:32:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:05,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 09:32:05,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:07,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:32:08,912 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:08,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124445312] [2023-12-22 09:32:08,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124445312] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:32:08,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:32:08,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:32:08,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129481058] [2023-12-22 09:32:08,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:32:08,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:32:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:32:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:32:08,914 INFO L87 Difference]: Start difference. First operand 1525 states and 1897 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 09:32:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:32:23,420 INFO L93 Difference]: Finished difference Result 2676 states and 3521 transitions. [2023-12-22 09:32:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:32:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 187 [2023-12-22 09:32:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:32:23,432 INFO L225 Difference]: With dead ends: 2676 [2023-12-22 09:32:23,432 INFO L226 Difference]: Without dead ends: 2078 [2023-12-22 09:32:23,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:32:23,434 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-12-22 09:32:23,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 47 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2023-12-22 09:32:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2023-12-22 09:32:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2023-12-22 09:32:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2077 states have (on average 1.2696196437168994) internal successors, (2637), 2077 states have internal predecessors, (2637), 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 09:32:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2637 transitions. [2023-12-22 09:32:23,459 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2637 transitions. Word has length 187 [2023-12-22 09:32:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:32:23,459 INFO L495 AbstractCegarLoop]: Abstraction has 2078 states and 2637 transitions. [2023-12-22 09:32:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 09:32:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2637 transitions. [2023-12-22 09:32:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-22 09:32:23,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:32:23,461 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:32:23,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 09:32:23,667 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 09:32:23,667 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:32:23,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:32:23,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1143846921, now seen corresponding path program 1 times [2023-12-22 09:32:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:32:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985435045] [2023-12-22 09:32:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:32:23,669 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 09:32:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:32:23,670 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 09:32:23,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-22 09:32:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:32:23,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 09:32:23,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:32:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:24,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:32:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 83 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:32:26,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:32:26,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985435045] [2023-12-22 09:32:26,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985435045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:32:26,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:32:26,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-22 09:32:26,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864354824] [2023-12-22 09:32:26,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:32:26,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-22 09:32:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:32:26,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-22 09:32:26,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-22 09:32:26,773 INFO L87 Difference]: Start difference. First operand 2078 states and 2637 transitions. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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 09:32:51,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:33:14,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:33:32,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:33:45,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:34:03,109 INFO L93 Difference]: Finished difference Result 7683 states and 10141 transitions. [2023-12-22 09:34:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 09:34:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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 198 [2023-12-22 09:34:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:34:03,131 INFO L225 Difference]: With dead ends: 7683 [2023-12-22 09:34:03,132 INFO L226 Difference]: Without dead ends: 5974 [2023-12-22 09:34:03,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-22 09:34:03,134 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 1091 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 4439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 3945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 96.0s IncrementalHoareTripleChecker+Time [2023-12-22 09:34:03,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 193 Invalid, 4439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 3945 Invalid, 0 Unknown, 0 Unchecked, 96.0s Time] [2023-12-22 09:34:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2023-12-22 09:34:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3183. [2023-12-22 09:34:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 3182 states have (on average 1.2042740414833437) internal successors, (3832), 3182 states have internal predecessors, (3832), 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 09:34:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 3832 transitions. [2023-12-22 09:34:03,184 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 3832 transitions. Word has length 198 [2023-12-22 09:34:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:34:03,184 INFO L495 AbstractCegarLoop]: Abstraction has 3183 states and 3832 transitions. [2023-12-22 09:34:03,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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 09:34:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 3832 transitions. [2023-12-22 09:34:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-22 09:34:03,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:34:03,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:34:03,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-22 09:34:03,393 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 09:34:03,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:34:03,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:34:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1641445440, now seen corresponding path program 1 times [2023-12-22 09:34:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:34:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234307134] [2023-12-22 09:34:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:34:03,395 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 09:34:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:34:03,409 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 09:34:03,429 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 09:34:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:34:03,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:34:03,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:34:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:34:03,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:34:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:34:04,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:34:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234307134] [2023-12-22 09:34:04,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234307134] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:34:04,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:34:04,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:34:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698237552] [2023-12-22 09:34:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:34:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:34:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:34:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:34:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:34:04,257 INFO L87 Difference]: Start difference. First operand 3183 states and 3832 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 09:34:18,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:34:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:34:22,512 INFO L93 Difference]: Finished difference Result 7104 states and 8697 transitions. [2023-12-22 09:34:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:34:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 198 [2023-12-22 09:34:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:34:22,522 INFO L225 Difference]: With dead ends: 7104 [2023-12-22 09:34:22,522 INFO L226 Difference]: Without dead ends: 4658 [2023-12-22 09:34:22,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:34:22,526 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 143 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:34:22,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 331 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2023-12-22 09:34:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2023-12-22 09:34:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 4290. [2023-12-22 09:34:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4290 states, 4289 states have (on average 1.181161109815808) internal successors, (5066), 4289 states have internal predecessors, (5066), 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 09:34:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4290 states to 4290 states and 5066 transitions. [2023-12-22 09:34:22,579 INFO L78 Accepts]: Start accepts. Automaton has 4290 states and 5066 transitions. Word has length 198 [2023-12-22 09:34:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:34:22,579 INFO L495 AbstractCegarLoop]: Abstraction has 4290 states and 5066 transitions. [2023-12-22 09:34:22,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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 09:34:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 4290 states and 5066 transitions. [2023-12-22 09:34:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-22 09:34:22,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:34:22,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:34:22,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-22 09:34:22,788 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 09:34:22,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:34:22,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:34:22,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2049370948, now seen corresponding path program 1 times [2023-12-22 09:34:22,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:34:22,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995343223] [2023-12-22 09:34:22,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:34:22,790 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 09:34:22,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:34:22,791 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 09:34:22,792 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 09:34:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:34:22,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:34:22,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:34:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 09:34:23,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:34:23,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:34:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995343223] [2023-12-22 09:34:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995343223] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:34:23,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:34:23,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:34:23,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075174066] [2023-12-22 09:34:23,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:34:23,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:34:23,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:34:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:34:23,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:34:23,242 INFO L87 Difference]: Start difference. First operand 4290 states and 5066 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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 09:34:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:34:29,881 INFO L93 Difference]: Finished difference Result 9313 states and 11312 transitions. [2023-12-22 09:34:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:34:29,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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 201 [2023-12-22 09:34:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:34:29,893 INFO L225 Difference]: With dead ends: 9313 [2023-12-22 09:34:29,893 INFO L226 Difference]: Without dead ends: 5760 [2023-12-22 09:34:29,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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 09:34:29,897 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-22 09:34:29,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 151 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-22 09:34:29,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5760 states. [2023-12-22 09:34:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5760 to 5207. [2023-12-22 09:34:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5207 states, 5206 states have (on average 1.1736457933154052) internal successors, (6110), 5206 states have internal predecessors, (6110), 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 09:34:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5207 states to 5207 states and 6110 transitions. [2023-12-22 09:34:29,976 INFO L78 Accepts]: Start accepts. Automaton has 5207 states and 6110 transitions. Word has length 201 [2023-12-22 09:34:29,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:34:29,976 INFO L495 AbstractCegarLoop]: Abstraction has 5207 states and 6110 transitions. [2023-12-22 09:34:29,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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 09:34:29,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5207 states and 6110 transitions. [2023-12-22 09:34:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-22 09:34:29,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:34:29,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:34:29,986 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 09:34:30,184 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 09:34:30,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:34:30,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:34:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash 727175595, now seen corresponding path program 1 times [2023-12-22 09:34:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:34:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864752420] [2023-12-22 09:34:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:34:30,186 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 09:34:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:34:30,187 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 09:34:30,188 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 09:34:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:34:30,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:34:30,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:34:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 9 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:34:30,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:34:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:34:30,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:34:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864752420] [2023-12-22 09:34:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864752420] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:34:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:34:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:34:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398850658] [2023-12-22 09:34:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:34:30,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:34:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:34:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:34:30,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:34:30,976 INFO L87 Difference]: Start difference. First operand 5207 states and 6110 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 09:34:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:34:57,568 INFO L93 Difference]: Finished difference Result 10228 states and 12268 transitions. [2023-12-22 09:34:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:34:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 228 [2023-12-22 09:34:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:34:57,591 INFO L225 Difference]: With dead ends: 10228 [2023-12-22 09:34:57,591 INFO L226 Difference]: Without dead ends: 6866 [2023-12-22 09:34:57,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:34:57,600 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 140 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2023-12-22 09:34:57,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 64 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 26.5s Time] [2023-12-22 09:34:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6866 states. [2023-12-22 09:34:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6866 to 6863. [2023-12-22 09:34:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6863 states, 6862 states have (on average 1.1725444476828912) internal successors, (8046), 6862 states have internal predecessors, (8046), 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 09:34:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6863 states to 6863 states and 8046 transitions. [2023-12-22 09:34:57,688 INFO L78 Accepts]: Start accepts. Automaton has 6863 states and 8046 transitions. Word has length 228 [2023-12-22 09:34:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:34:57,689 INFO L495 AbstractCegarLoop]: Abstraction has 6863 states and 8046 transitions. [2023-12-22 09:34:57,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 09:34:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 6863 states and 8046 transitions. [2023-12-22 09:34:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-22 09:34:57,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:34:57,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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 09:34:57,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-22 09:34:57,896 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 09:34:57,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:34:57,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:34:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1928968850, now seen corresponding path program 1 times [2023-12-22 09:34:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:34:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219932921] [2023-12-22 09:34:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:34:57,899 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 09:34:57,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:34:57,900 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 09:34:57,919 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 09:34:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:34:57,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:34:58,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:34:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-22 09:34:58,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:34:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-12-22 09:34:58,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:34:58,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219932921] [2023-12-22 09:34:58,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219932921] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:34:58,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:34:58,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 09:34:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007443472] [2023-12-22 09:34:58,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:34:58,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:34:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:34:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:34:58,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:34:58,630 INFO L87 Difference]: Start difference. First operand 6863 states and 8046 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 09:35:09,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:35:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:35:15,117 INFO L93 Difference]: Finished difference Result 8705 states and 10125 transitions. [2023-12-22 09:35:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:35:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 241 [2023-12-22 09:35:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:35:15,129 INFO L225 Difference]: With dead ends: 8705 [2023-12-22 09:35:15,129 INFO L226 Difference]: Without dead ends: 8703 [2023-12-22 09:35:15,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 09:35:15,131 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 215 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2023-12-22 09:35:15,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 151 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2023-12-22 09:35:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8703 states. [2023-12-22 09:35:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8703 to 7783. [2023-12-22 09:35:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7783 states, 7782 states have (on average 1.172834746851709) internal successors, (9127), 7782 states have internal predecessors, (9127), 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 09:35:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7783 states to 7783 states and 9127 transitions. [2023-12-22 09:35:15,215 INFO L78 Accepts]: Start accepts. Automaton has 7783 states and 9127 transitions. Word has length 241 [2023-12-22 09:35:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:35:15,215 INFO L495 AbstractCegarLoop]: Abstraction has 7783 states and 9127 transitions. [2023-12-22 09:35:15,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 09:35:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 7783 states and 9127 transitions. [2023-12-22 09:35:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-12-22 09:35:15,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:35:15,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:35:15,223 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 09:35:15,422 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 09:35:15,422 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:35:15,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:35:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash -86400238, now seen corresponding path program 1 times [2023-12-22 09:35:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:35:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232299887] [2023-12-22 09:35:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:35:15,424 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 09:35:15,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:35:15,425 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 09:35:15,426 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 09:35:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:35:15,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 09:35:15,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:35:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:35:15,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:35:16,262 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-22 09:35:16,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:35:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232299887] [2023-12-22 09:35:16,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232299887] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:35:16,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:35:16,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-12-22 09:35:16,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496296570] [2023-12-22 09:35:16,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:35:16,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:35:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:35:16,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:35:16,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 09:35:16,277 INFO L87 Difference]: Start difference. First operand 7783 states and 9127 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 09:35:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:35:29,882 INFO L93 Difference]: Finished difference Result 15197 states and 17879 transitions. [2023-12-22 09:35:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:35:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 268 [2023-12-22 09:35:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:35:29,893 INFO L225 Difference]: With dead ends: 15197 [2023-12-22 09:35:29,893 INFO L226 Difference]: Without dead ends: 7967 [2023-12-22 09:35:29,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 09:35:29,899 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 219 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-12-22 09:35:29,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 108 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2023-12-22 09:35:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2023-12-22 09:35:30,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7599. [2023-12-22 09:35:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7599 states, 7598 states have (on average 1.1584627533561465) internal successors, (8802), 7598 states have internal predecessors, (8802), 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 09:35:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 8802 transitions. [2023-12-22 09:35:30,035 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 8802 transitions. Word has length 268 [2023-12-22 09:35:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:35:30,036 INFO L495 AbstractCegarLoop]: Abstraction has 7599 states and 8802 transitions. [2023-12-22 09:35:30,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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 09:35:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 8802 transitions. [2023-12-22 09:35:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2023-12-22 09:35:30,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:35:30,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:30,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-22 09:35:30,244 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 09:35:30,244 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:35:30,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:35:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2102164598, now seen corresponding path program 1 times [2023-12-22 09:35:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:35:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103381394] [2023-12-22 09:35:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:35:30,246 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 09:35:30,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:35:30,247 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 09:35:30,252 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 09:35:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:35:30,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 09:35:30,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:35:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 14 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:35:30,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:35:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:35:37,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:35:37,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103381394] [2023-12-22 09:35:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103381394] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 09:35:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 09:35:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2023-12-22 09:35:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969407652] [2023-12-22 09:35:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:35:37,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 09:35:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:35:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 09:35:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-22 09:35:37,037 INFO L87 Difference]: Start difference. First operand 7599 states and 8802 transitions. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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 09:36:19,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:21,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:23,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:24,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:42,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:36:53,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:37:10,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:37:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:37:15,212 INFO L93 Difference]: Finished difference Result 17045 states and 19875 transitions. [2023-12-22 09:37:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 09:37:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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 275 [2023-12-22 09:37:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:37:15,243 INFO L225 Difference]: With dead ends: 17045 [2023-12-22 09:37:15,243 INFO L226 Difference]: Without dead ends: 9999 [2023-12-22 09:37:15,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-22 09:37:15,250 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 418 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.0s IncrementalHoareTripleChecker+Time [2023-12-22 09:37:15,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 59 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 98.0s Time] [2023-12-22 09:37:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2023-12-22 09:37:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 8334. [2023-12-22 09:37:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8334 states, 8333 states have (on average 1.1386055442217689) internal successors, (9488), 8333 states have internal predecessors, (9488), 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 09:37:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8334 states to 8334 states and 9488 transitions. [2023-12-22 09:37:15,380 INFO L78 Accepts]: Start accepts. Automaton has 8334 states and 9488 transitions. Word has length 275 [2023-12-22 09:37:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:37:15,380 INFO L495 AbstractCegarLoop]: Abstraction has 8334 states and 9488 transitions. [2023-12-22 09:37:15,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 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 09:37:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8334 states and 9488 transitions. [2023-12-22 09:37:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2023-12-22 09:37:15,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:37:15,384 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:37:15,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-22 09:37:15,590 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 09:37:15,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:37:15,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:37:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1101625168, now seen corresponding path program 1 times [2023-12-22 09:37:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:37:15,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252893225] [2023-12-22 09:37:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:37:15,593 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 09:37:15,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:37:15,594 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 09:37:15,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-22 09:37:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:37:15,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:37:15,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:37:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 122 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:37:19,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:39:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 233 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:39:12,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:39:12,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252893225] [2023-12-22 09:39:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252893225] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:39:12,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:39:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-22 09:39:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274807956] [2023-12-22 09:39:12,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:39:12,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 09:39:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:39:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 09:39:12,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-22 09:39:12,978 INFO L87 Difference]: Start difference. First operand 8334 states and 9488 transitions. Second operand has 8 states, 8 states have (on average 66.25) internal successors, (530), 7 states have internal predecessors, (530), 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 09:39:28,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:30,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:39,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:41,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:47,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:39:49,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:00,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:03,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:07,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:10,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:12,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:18,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:22,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:27,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:31,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:36,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:40,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:44,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:47,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:50,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:54,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:40:56,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:01,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:05,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:09,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:14,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:18,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:20,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:24,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:30,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:35,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:39,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:40,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:45,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:48,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:50,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:51,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:55,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:41:57,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:02,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:05,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:07,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:11,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:16,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:18,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:21,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:23,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:27,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:33,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:35,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:38,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:42,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:44,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:48,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:51,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:55,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:42:59,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:00,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:05,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:08,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:09,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:12,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:14,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:17,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:23,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:24,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:30,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:34,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:37,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:40,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:42,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:47,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:49,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:52,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:53,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:55,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:43:59,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:02,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:06,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:09,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:13,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:14,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:16,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:20,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 09:44:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:44:20,546 INFO L93 Difference]: Finished difference Result 19275 states and 21796 transitions. [2023-12-22 09:44:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-22 09:44:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 66.25) internal successors, (530), 7 states have internal predecessors, (530), 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 295 [2023-12-22 09:44:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:44:20,632 INFO L225 Difference]: With dead ends: 19275 [2023-12-22 09:44:20,632 INFO L226 Difference]: Without dead ends: 11462 [2023-12-22 09:44:20,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 582 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-22 09:44:20,639 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 540 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 164 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 290.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 2806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 306.1s IncrementalHoareTripleChecker+Time [2023-12-22 09:44:20,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 210 Invalid, 2806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2632 Invalid, 10 Unknown, 0 Unchecked, 306.1s Time] [2023-12-22 09:44:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11462 states. [2023-12-22 09:44:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11462 to 7963. [2023-12-22 09:44:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7963 states, 7962 states have (on average 1.1336347651343883) internal successors, (9026), 7962 states have internal predecessors, (9026), 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 09:44:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 9026 transitions. [2023-12-22 09:44:20,734 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 9026 transitions. Word has length 295 [2023-12-22 09:44:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:44:20,734 INFO L495 AbstractCegarLoop]: Abstraction has 7963 states and 9026 transitions. [2023-12-22 09:44:20,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.25) internal successors, (530), 7 states have internal predecessors, (530), 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 09:44:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 9026 transitions. [2023-12-22 09:44:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2023-12-22 09:44:20,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:44:20,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2023-12-22 09:44:20,744 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 09:44:20,944 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 09:44:20,945 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:44:20,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:44:20,945 INFO L85 PathProgramCache]: Analyzing trace with hash -684092992, now seen corresponding path program 1 times [2023-12-22 09:44:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:44:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761722605] [2023-12-22 09:44:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:44:20,946 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 09:44:20,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:44:20,947 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 09:44:20,971 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 09:44:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:44:21,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:44:21,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:44:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-22 09:44:22,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:44:22,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:44:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761722605] [2023-12-22 09:44:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761722605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:44:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:44:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 09:44:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103930683] [2023-12-22 09:44:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:44:22,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:44:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:44:22,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:44:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:44:22,156 INFO L87 Difference]: Start difference. First operand 7963 states and 9026 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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 09:44:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:44:28,382 INFO L93 Difference]: Finished difference Result 13526 states and 15451 transitions. [2023-12-22 09:44:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:44:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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 304 [2023-12-22 09:44:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:44:28,389 INFO L225 Difference]: With dead ends: 13526 [2023-12-22 09:44:28,390 INFO L226 Difference]: Without dead ends: 7958 [2023-12-22 09:44:28,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 302 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 09:44:28,394 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-22 09:44:28,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 38 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2023-12-22 09:44:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7958 states. [2023-12-22 09:44:28,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7958 to 7958. [2023-12-22 09:44:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7958 states, 7957 states have (on average 1.1330903606887017) internal successors, (9016), 7957 states have internal predecessors, (9016), 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 09:44:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7958 states to 7958 states and 9016 transitions. [2023-12-22 09:44:28,505 INFO L78 Accepts]: Start accepts. Automaton has 7958 states and 9016 transitions. Word has length 304 [2023-12-22 09:44:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:44:28,506 INFO L495 AbstractCegarLoop]: Abstraction has 7958 states and 9016 transitions. [2023-12-22 09:44:28,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 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 09:44:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 7958 states and 9016 transitions. [2023-12-22 09:44:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2023-12-22 09:44:28,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:44:28,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:44:28,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-22 09:44:28,713 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 09:44:28,713 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:44:28,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:44:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1312147390, now seen corresponding path program 1 times [2023-12-22 09:44:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:44:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082235121] [2023-12-22 09:44:28,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:44:28,715 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 09:44:28,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:44:28,716 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 09:44:28,737 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 09:44:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:44:28,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:44:28,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:44:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-22 09:44:29,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:44:29,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:44:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082235121] [2023-12-22 09:44:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082235121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:44:29,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:44:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:44:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757983371] [2023-12-22 09:44:29,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:44:29,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:44:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:44:29,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:44:29,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:44:29,603 INFO L87 Difference]: Start difference. First operand 7958 states and 9016 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 09:44:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:44:39,168 INFO L93 Difference]: Finished difference Result 13334 states and 15231 transitions. [2023-12-22 09:44:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:44:39,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 312 [2023-12-22 09:44:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:44:39,181 INFO L225 Difference]: With dead ends: 13334 [2023-12-22 09:44:39,181 INFO L226 Difference]: Without dead ends: 7771 [2023-12-22 09:44:39,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 310 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 09:44:39,185 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 51 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-22 09:44:39,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 286 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-12-22 09:44:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2023-12-22 09:44:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 7770. [2023-12-22 09:44:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7770 states, 7769 states have (on average 1.1122409576522074) internal successors, (8641), 7769 states have internal predecessors, (8641), 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 09:44:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7770 states to 7770 states and 8641 transitions. [2023-12-22 09:44:39,251 INFO L78 Accepts]: Start accepts. Automaton has 7770 states and 8641 transitions. Word has length 312 [2023-12-22 09:44:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:44:39,252 INFO L495 AbstractCegarLoop]: Abstraction has 7770 states and 8641 transitions. [2023-12-22 09:44:39,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 09:44:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7770 states and 8641 transitions. [2023-12-22 09:44:39,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2023-12-22 09:44:39,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:44:39,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:44:39,270 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 09:44:39,460 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 09:44:39,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:44:39,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:44:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2135136417, now seen corresponding path program 1 times [2023-12-22 09:44:39,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:44:39,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339809358] [2023-12-22 09:44:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:44:39,462 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 09:44:39,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:44:39,463 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 09:44:39,464 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 09:44:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:44:39,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 09:44:39,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:44:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-12-22 09:44:39,658 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 09:44:39,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:44:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339809358] [2023-12-22 09:44:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339809358] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 09:44:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 09:44:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 09:44:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175726567] [2023-12-22 09:44:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 09:44:39,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 09:44:39,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:44:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 09:44:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 09:44:39,660 INFO L87 Difference]: Start difference. First operand 7770 states and 8641 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 09:44:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:44:50,441 INFO L93 Difference]: Finished difference Result 16098 states and 17906 transitions. [2023-12-22 09:44:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 09:44:50,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 349 [2023-12-22 09:44:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:44:50,462 INFO L225 Difference]: With dead ends: 16098 [2023-12-22 09:44:50,463 INFO L226 Difference]: Without dead ends: 8881 [2023-12-22 09:44:50,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 347 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 09:44:50,469 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-12-22 09:44:50,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 361 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-12-22 09:44:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8881 states. [2023-12-22 09:44:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8881 to 7954. [2023-12-22 09:44:50,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7954 states, 7953 states have (on average 1.104488872123727) internal successors, (8784), 7953 states have internal predecessors, (8784), 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 09:44:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 8784 transitions. [2023-12-22 09:44:50,591 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 8784 transitions. Word has length 349 [2023-12-22 09:44:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:44:50,591 INFO L495 AbstractCegarLoop]: Abstraction has 7954 states and 8784 transitions. [2023-12-22 09:44:50,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 09:44:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 8784 transitions. [2023-12-22 09:44:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2023-12-22 09:44:50,595 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:44:50,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:44:50,600 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 09:44:50,800 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 09:44:50,801 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:44:50,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:44:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1957461112, now seen corresponding path program 1 times [2023-12-22 09:44:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:44:50,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168106079] [2023-12-22 09:44:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:44:50,802 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 09:44:50,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:44:50,805 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 09:44:50,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-22 09:44:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:44:50,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 09:44:50,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:44:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 14 proven. 215 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-22 09:44:52,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 09:44:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 14 proven. 215 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-12-22 09:44:53,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 09:44:53,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168106079] [2023-12-22 09:44:53,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168106079] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 09:44:53,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 09:44:53,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-22 09:44:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502727079] [2023-12-22 09:44:53,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 09:44:53,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 09:44:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 09:44:53,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 09:44:53,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 09:44:53,763 INFO L87 Difference]: Start difference. First operand 7954 states and 8784 transitions. Second operand has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 5 states have internal predecessors, (482), 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 09:45:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 09:45:40,569 INFO L93 Difference]: Finished difference Result 21443 states and 23713 transitions. [2023-12-22 09:45:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 09:45:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 5 states have internal predecessors, (482), 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 355 [2023-12-22 09:45:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 09:45:40,591 INFO L225 Difference]: With dead ends: 21443 [2023-12-22 09:45:40,592 INFO L226 Difference]: Without dead ends: 14596 [2023-12-22 09:45:40,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-22 09:45:40,596 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 626 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.6s IncrementalHoareTripleChecker+Time [2023-12-22 09:45:40,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 132 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 46.6s Time] [2023-12-22 09:45:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14596 states. [2023-12-22 09:45:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14596 to 11083. [2023-12-22 09:45:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11083 states, 11082 states have (on average 1.0909583107742284) internal successors, (12090), 11082 states have internal predecessors, (12090), 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 09:45:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11083 states to 11083 states and 12090 transitions. [2023-12-22 09:45:40,743 INFO L78 Accepts]: Start accepts. Automaton has 11083 states and 12090 transitions. Word has length 355 [2023-12-22 09:45:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 09:45:40,744 INFO L495 AbstractCegarLoop]: Abstraction has 11083 states and 12090 transitions. [2023-12-22 09:45:40,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 5 states have internal predecessors, (482), 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 09:45:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 11083 states and 12090 transitions. [2023-12-22 09:45:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2023-12-22 09:45:40,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 09:45:40,748 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:45:40,754 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 (19)] Ended with exit code 0 [2023-12-22 09:45:40,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:45:40,954 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 09:45:40,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 09:45:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1018762313, now seen corresponding path program 1 times [2023-12-22 09:45:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 09:45:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614097989] [2023-12-22 09:45:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 09:45:40,956 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 09:45:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 09:45:40,957 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-22 09:45:40,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-22 09:45:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 09:45:41,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-22 09:45:41,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 09:45:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 124 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 09:45:47,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-22 09:46:01,440 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 (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 09:46:01,442 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 09:46:01,818 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-22 09:46:01,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-22 09:46:02,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 09:46:02,025 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 382 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. [2023-12-22 09:46:02,029 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 09:46:02,030 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 09:46:02,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 09:46:02 BoogieIcfgContainer [2023-12-22 09:46:02,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 09:46:02,044 INFO L158 Benchmark]: Toolchain (without parser) took 878350.57ms. Allocated memory was 254.8MB in the beginning and 325.1MB in the end (delta: 70.3MB). Free memory was 198.4MB in the beginning and 157.8MB in the end (delta: 40.6MB). Peak memory consumption was 111.9MB. Max. memory is 8.0GB. [2023-12-22 09:46:02,044 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 09:46:02,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.81ms. Allocated memory is still 254.8MB. Free memory was 198.4MB in the beginning and 145.4MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2023-12-22 09:46:02,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.17ms. Allocated memory is still 254.8MB. Free memory was 145.4MB in the beginning and 136.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-22 09:46:02,061 INFO L158 Benchmark]: Boogie Preprocessor took 90.81ms. Allocated memory is still 254.8MB. Free memory was 136.0MB in the beginning and 126.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-22 09:46:02,061 INFO L158 Benchmark]: RCFGBuilder took 7091.11ms. Allocated memory is still 254.8MB. Free memory was 126.6MB in the beginning and 163.2MB in the end (delta: -36.6MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. [2023-12-22 09:46:02,061 INFO L158 Benchmark]: TraceAbstraction took 870551.43ms. Allocated memory was 254.8MB in the beginning and 325.1MB in the end (delta: 70.3MB). Free memory was 162.6MB in the beginning and 157.8MB in the end (delta: 4.8MB). Peak memory consumption was 75.6MB. Max. memory is 8.0GB. [2023-12-22 09:46:02,062 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 184.5MB. Free memory is still 133.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.81ms. Allocated memory is still 254.8MB. Free memory was 198.4MB in the beginning and 145.4MB in the end (delta: 53.0MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 102.17ms. Allocated memory is still 254.8MB. Free memory was 145.4MB in the beginning and 136.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 90.81ms. Allocated memory is still 254.8MB. Free memory was 136.0MB in the beginning and 126.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 7091.11ms. Allocated memory is still 254.8MB. Free memory was 126.6MB in the beginning and 163.2MB in the end (delta: -36.6MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. * TraceAbstraction took 870551.43ms. Allocated memory was 254.8MB in the beginning and 325.1MB in the end (delta: 70.3MB). Free memory was 162.6MB in the beginning and 157.8MB in the end (delta: 4.8MB). Peak memory consumption was 75.6MB. 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: 37]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 37). Cancelled while NwaCegarLoop was analyzing trace of length 382 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 870.5s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 704.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 4747 SdHoareTripleChecker+Valid, 700.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4747 mSDsluCounter, 3297 SdHoareTripleChecker+Invalid, 646.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 576 mSDsCounter, 2630 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16796 IncrementalHoareTripleChecker+Invalid, 19436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2630 mSolverCounterUnsat, 2721 mSDtfsCounter, 16796 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5929 GetRequests, 5882 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11083occurred in iteration=18, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 14630 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 138.0s InterpolantComputationTime, 3707 NumberOfCodeBlocks, 3707 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5925 ConstructedInterpolants, 0 QuantifiedInterpolants, 28329 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4676 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 2011/3255 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