/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/Problem14_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 09:26:09,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 09:26:09,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 09:26:09,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 09:26:09,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 09:26:09,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 09:26:09,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 09:26:09,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 09:26:09,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 09:26:09,398 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 09:26:09,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 09:26:09,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 09:26:09,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 09:26:09,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 09:26:09,400 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 09:26:09,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 09:26:09,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 09:26:09,400 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 09:26:09,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 09:26:09,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 09:26:09,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 09:26:09,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 09:26:09,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 09:26:09,402 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 09:26:09,402 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 09:26:09,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 09:26:09,402 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 09:26:09,402 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 09:26:09,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 09:26:09,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 09:26:09,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 09:26:09,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 09:26:09,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 09:26:09,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 09:26:09,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:26:09,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 09:26:09,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 09:26:09,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 09:26:09,405 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 09:26:09,405 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 09:26:09,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 09:26:09,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 09:26:09,406 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 09:26:09,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 09:26:09,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 09:26:09,406 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 09:26:09,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 09:26:09,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 09:26:09,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 09:26:09,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 09:26:09,630 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 09:26:09,630 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 09:26:09,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label38.c [2023-12-16 09:26:10,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 09:26:10,956 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 09:26:10,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label38.c [2023-12-16 09:26:10,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9523f1e/b7669bbf26794ed8b1f1e213271f190b/FLAG429eff6b0 [2023-12-16 09:26:10,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9523f1e/b7669bbf26794ed8b1f1e213271f190b [2023-12-16 09:26:10,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 09:26:10,988 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 09:26:10,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 09:26:10,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 09:26:10,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 09:26:10,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:26:10" (1/1) ... [2023-12-16 09:26:10,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587bb20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:10, skipping insertion in model container [2023-12-16 09:26:10,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:26:10" (1/1) ... [2023-12-16 09:26:11,039 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 09:26:11,201 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/Problem14_label38.c[5189,5202] [2023-12-16 09:26:11,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:26:11,362 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 09:26:11,378 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/Problem14_label38.c[5189,5202] [2023-12-16 09:26:11,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:26:11,468 INFO L206 MainTranslator]: Completed translation [2023-12-16 09:26:11,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11 WrapperNode [2023-12-16 09:26:11,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 09:26:11,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 09:26:11,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 09:26:11,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 09:26:11,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,547 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 857 [2023-12-16 09:26:11,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 09:26:11,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 09:26:11,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 09:26:11,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 09:26:11,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,576 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 09:26:11,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 09:26:11,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 09:26:11,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 09:26:11,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 09:26:11,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (1/1) ... [2023-12-16 09:26:11,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:26:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 09:26:11,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 09:26:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 09:26:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 09:26:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 09:26:11,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 09:26:11,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 09:26:11,767 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 09:26:11,769 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 09:26:14,356 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 09:26:14,422 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 09:26:14,422 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 09:26:14,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:26:14 BoogieIcfgContainer [2023-12-16 09:26:14,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 09:26:14,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 09:26:14,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 09:26:14,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 09:26:14,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:26:10" (1/3) ... [2023-12-16 09:26:14,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f5ddb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:26:14, skipping insertion in model container [2023-12-16 09:26:14,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:26:11" (2/3) ... [2023-12-16 09:26:14,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f5ddb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:26:14, skipping insertion in model container [2023-12-16 09:26:14,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:26:14" (3/3) ... [2023-12-16 09:26:14,430 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label38.c [2023-12-16 09:26:14,442 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 09:26:14,443 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 09:26:14,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 09:26:14,496 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;@711b32bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 09:26:14,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 09:26:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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-16 09:26:14,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 09:26:14,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:14,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:26:14,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:14,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 329822421, now seen corresponding path program 1 times [2023-12-16 09:26:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921259309] [2023-12-16 09:26:14,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:14,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:14,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 09:26:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:14,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 09:26:14,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:26:14,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:14,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:14,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921259309] [2023-12-16 09:26:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921259309] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:14,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:14,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126222777] [2023-12-16 09:26:14,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:14,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 09:26:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 09:26:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:26:14,668 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-16 09:26:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:14,707 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2023-12-16 09:26:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 09:26:14,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2023-12-16 09:26:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:14,724 INFO L225 Difference]: With dead ends: 365 [2023-12-16 09:26:14,724 INFO L226 Difference]: Without dead ends: 181 [2023-12-16 09:26:14,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 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-16 09:26:14,732 INFO L413 NwaCegarLoop]: 295 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, 295 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-16 09:26:14,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 09:26:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-16 09:26:14,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-12-16 09:26:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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-16 09:26:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2023-12-16 09:26:14,765 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 49 [2023-12-16 09:26:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:14,765 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2023-12-16 09:26:14,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-16 09:26:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2023-12-16 09:26:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-16 09:26:14,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:14,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:26:14,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 09:26:14,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:14,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:14,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash -643229841, now seen corresponding path program 1 times [2023-12-16 09:26:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:14,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787337942] [2023-12-16 09:26:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:14,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:14,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:14,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:14,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 09:26:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:15,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:26:15,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:26:15,135 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:15,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787337942] [2023-12-16 09:26:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787337942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39983657] [2023-12-16 09:26:15,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:15,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:15,138 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-16 09:26:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:17,869 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2023-12-16 09:26:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:17,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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 49 [2023-12-16 09:26:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:17,872 INFO L225 Difference]: With dead ends: 539 [2023-12-16 09:26:17,872 INFO L226 Difference]: Without dead ends: 359 [2023-12-16 09:26:17,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-16 09:26:17,874 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 149 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:17,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 87 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 09:26:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-16 09:26:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-16 09:26:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 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-16 09:26:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2023-12-16 09:26:17,888 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 49 [2023-12-16 09:26:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:17,888 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2023-12-16 09:26:17,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 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-16 09:26:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2023-12-16 09:26:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 09:26:17,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:17,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 09:26:17,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:18,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:18,093 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:18,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1429041935, now seen corresponding path program 1 times [2023-12-16 09:26:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029489723] [2023-12-16 09:26:18,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:18,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:18,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:18,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:18,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 09:26:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:18,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:26:18,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:26:18,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:18,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029489723] [2023-12-16 09:26:18,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029489723] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:18,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:18,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583670660] [2023-12-16 09:26:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:18,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:18,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:18,525 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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-16 09:26:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:20,891 INFO L93 Difference]: Finished difference Result 895 states and 1231 transitions. [2023-12-16 09:26:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:20,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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 118 [2023-12-16 09:26:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:20,893 INFO L225 Difference]: With dead ends: 895 [2023-12-16 09:26:20,893 INFO L226 Difference]: Without dead ends: 537 [2023-12-16 09:26:20,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-16 09:26:20,895 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:20,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 112 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 09:26:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-12-16 09:26:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2023-12-16 09:26:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.3041044776119404) internal successors, (699), 536 states have internal predecessors, (699), 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-16 09:26:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 699 transitions. [2023-12-16 09:26:20,910 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 699 transitions. Word has length 118 [2023-12-16 09:26:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:20,910 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 699 transitions. [2023-12-16 09:26:20,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 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-16 09:26:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 699 transitions. [2023-12-16 09:26:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-16 09:26:20,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:20,914 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-16 09:26:20,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 09:26:21,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:21,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:21,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1090472297, now seen corresponding path program 1 times [2023-12-16 09:26:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132716453] [2023-12-16 09:26:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:21,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:21,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:21,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 09:26:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:21,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:26:21,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:21,368 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:26:21,368 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:21,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:21,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132716453] [2023-12-16 09:26:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132716453] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:21,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:21,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:21,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106262844] [2023-12-16 09:26:21,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:21,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:21,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:21,370 INFO L87 Difference]: Start difference. First operand 537 states and 699 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-16 09:26:24,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:24,748 INFO L93 Difference]: Finished difference Result 1251 states and 1690 transitions. [2023-12-16 09:26:24,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:24,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 154 [2023-12-16 09:26:24,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:24,752 INFO L225 Difference]: With dead ends: 1251 [2023-12-16 09:26:24,752 INFO L226 Difference]: Without dead ends: 893 [2023-12-16 09:26:24,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 152 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-16 09:26:24,753 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:24,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 118 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-16 09:26:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-12-16 09:26:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2023-12-16 09:26:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.243273542600897) internal successors, (1109), 892 states have internal predecessors, (1109), 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-16 09:26:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1109 transitions. [2023-12-16 09:26:24,769 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1109 transitions. Word has length 154 [2023-12-16 09:26:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:24,770 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1109 transitions. [2023-12-16 09:26:24,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-16 09:26:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1109 transitions. [2023-12-16 09:26:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-16 09:26:24,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:24,773 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:24,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:24,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:24,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:24,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1987698747, now seen corresponding path program 1 times [2023-12-16 09:26:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860100295] [2023-12-16 09:26:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:24,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:24,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:24,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:25,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 09:26:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:25,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 09:26:25,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 09:26:25,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:25,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:25,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860100295] [2023-12-16 09:26:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860100295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:25,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:26:25,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044911210] [2023-12-16 09:26:25,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:25,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 09:26:25,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 09:26:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:26:25,723 INFO L87 Difference]: Start difference. First operand 893 states and 1109 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 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-16 09:26:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:27,706 INFO L93 Difference]: Finished difference Result 1280 states and 1658 transitions. [2023-12-16 09:26:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 09:26:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 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-16 09:26:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:27,709 INFO L225 Difference]: With dead ends: 1280 [2023-12-16 09:26:27,709 INFO L226 Difference]: Without dead ends: 715 [2023-12-16 09:26:27,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:26:27,711 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:27,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 116 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 09:26:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-16 09:26:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2023-12-16 09:26:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2324929971988796) internal successors, (880), 714 states have internal predecessors, (880), 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-16 09:26:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 880 transitions. [2023-12-16 09:26:27,742 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 880 transitions. Word has length 198 [2023-12-16 09:26:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:27,743 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 880 transitions. [2023-12-16 09:26:27,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 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-16 09:26:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 880 transitions. [2023-12-16 09:26:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2023-12-16 09:26:27,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:27,762 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:27,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:27,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:27,963 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:27,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1798943845, now seen corresponding path program 1 times [2023-12-16 09:26:27,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230314609] [2023-12-16 09:26:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:27,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:27,965 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:27,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 09:26:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:28,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:26:28,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 143 proven. 131 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:26:28,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:26:28,881 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:26:28,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:28,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230314609] [2023-12-16 09:26:28,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230314609] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:26:28,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:26:28,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:26:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073959639] [2023-12-16 09:26:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:28,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:26:28,883 INFO L87 Difference]: Start difference. First operand 715 states and 880 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-16 09:26:34,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:34,188 INFO L93 Difference]: Finished difference Result 1429 states and 1919 transitions. [2023-12-16 09:26:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:34,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 326 [2023-12-16 09:26:34,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:34,191 INFO L225 Difference]: With dead ends: 1429 [2023-12-16 09:26:34,191 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:26:34,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 647 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-16 09:26:34,192 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:34,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 264 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-16 09:26:34,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:26:34,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:26:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2794392523364486) internal successors, (1369), 1070 states have internal predecessors, (1369), 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-16 09:26:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1369 transitions. [2023-12-16 09:26:34,206 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1369 transitions. Word has length 326 [2023-12-16 09:26:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:34,206 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1369 transitions. [2023-12-16 09:26:34,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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-16 09:26:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1369 transitions. [2023-12-16 09:26:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2023-12-16 09:26:34,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:34,209 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:34,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:34,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:34,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:34,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:34,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1384870390, now seen corresponding path program 1 times [2023-12-16 09:26:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769789473] [2023-12-16 09:26:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:34,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:34,427 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:34,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 09:26:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:34,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:26:34,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 143 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:26:34,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:26:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:26:35,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769789473] [2023-12-16 09:26:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769789473] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:26:35,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:26:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:26:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951870905] [2023-12-16 09:26:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:35,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:35,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:26:35,297 INFO L87 Difference]: Start difference. First operand 1071 states and 1369 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-16 09:26:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:41,188 INFO L93 Difference]: Finished difference Result 2319 states and 3160 transitions. [2023-12-16 09:26:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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 328 [2023-12-16 09:26:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:41,193 INFO L225 Difference]: With dead ends: 2319 [2023-12-16 09:26:41,193 INFO L226 Difference]: Without dead ends: 1605 [2023-12-16 09:26:41,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 651 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-16 09:26:41,194 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:41,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 57 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-16 09:26:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2023-12-16 09:26:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2023-12-16 09:26:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.2649625935162094) internal successors, (2029), 1604 states have internal predecessors, (2029), 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-16 09:26:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2029 transitions. [2023-12-16 09:26:41,217 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2029 transitions. Word has length 328 [2023-12-16 09:26:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:41,217 INFO L495 AbstractCegarLoop]: Abstraction has 1605 states and 2029 transitions. [2023-12-16 09:26:41,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-16 09:26:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2029 transitions. [2023-12-16 09:26:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-12-16 09:26:41,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:41,222 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:41,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:41,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:41,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1754558734, now seen corresponding path program 1 times [2023-12-16 09:26:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:41,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779002985] [2023-12-16 09:26:41,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:41,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:41,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:41,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:41,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 09:26:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:41,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:26:41,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-12-16 09:26:41,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:41,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779002985] [2023-12-16 09:26:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779002985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:41,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:26:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758739841] [2023-12-16 09:26:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:41,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:41,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:41,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:41,769 INFO L87 Difference]: Start difference. First operand 1605 states and 2029 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-16 09:26:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:44,852 INFO L93 Difference]: Finished difference Result 3387 states and 4443 transitions. [2023-12-16 09:26:44,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:44,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 433 [2023-12-16 09:26:44,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:44,858 INFO L225 Difference]: With dead ends: 3387 [2023-12-16 09:26:44,858 INFO L226 Difference]: Without dead ends: 2139 [2023-12-16 09:26:44,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 431 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-16 09:26:44,859 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:44,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 115 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-16 09:26:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-16 09:26:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2023-12-16 09:26:44,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.2464920486435922) internal successors, (2665), 2138 states have internal predecessors, (2665), 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-16 09:26:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2665 transitions. [2023-12-16 09:26:44,885 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2665 transitions. Word has length 433 [2023-12-16 09:26:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:44,885 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2665 transitions. [2023-12-16 09:26:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-16 09:26:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2665 transitions. [2023-12-16 09:26:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2023-12-16 09:26:44,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:44,890 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:44,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:45,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:45,095 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:45,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:45,095 INFO L85 PathProgramCache]: Analyzing trace with hash 609242757, now seen corresponding path program 1 times [2023-12-16 09:26:45,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:45,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671798568] [2023-12-16 09:26:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:45,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:45,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:45,098 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:45,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 09:26:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:45,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 09:26:45,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 483 proven. 277 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 09:26:46,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:26:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 731 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 09:26:52,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:52,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671798568] [2023-12-16 09:26:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671798568] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 09:26:52,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 09:26:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 09:26:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569930827] [2023-12-16 09:26:52,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 09:26:52,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 09:26:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:52,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 09:26:52,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 09:26:52,039 INFO L87 Difference]: Start difference. First operand 2139 states and 2665 transitions. Second operand has 9 states, 9 states have (on average 85.88888888888889) internal successors, (773), 9 states have internal predecessors, (773), 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) Received shutdown request... [2023-12-16 09:27:25,013 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 09:27:25,048 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-16 09:27:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 09:27:25,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 09:27:25,121 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 610 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.8s IncrementalHoareTripleChecker+Time [2023-12-16 09:27:25,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 44 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1950 Invalid, 0 Unknown, 0 Unchecked, 32.8s Time] [2023-12-16 09:27:25,123 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 09:27:25,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 09:27:25,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:27:25,324 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (5368 states constructed, input type IntersectNwa). [2023-12-16 09:27:25,327 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:27:25,329 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 09:27:25,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:27:25 BoogieIcfgContainer [2023-12-16 09:27:25,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 09:27:25,331 INFO L158 Benchmark]: Toolchain (without parser) took 74343.34ms. Allocated memory was 189.8MB in the beginning and 311.4MB in the end (delta: 121.6MB). Free memory was 138.3MB in the beginning and 91.7MB in the end (delta: 46.6MB). Peak memory consumption was 169.1MB. Max. memory is 8.0GB. [2023-12-16 09:27:25,331 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 09:27:25,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.53ms. Allocated memory is still 189.8MB. Free memory was 138.0MB in the beginning and 100.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-16 09:27:25,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.21ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 100.3MB in the beginning and 223.6MB in the end (delta: -123.3MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. [2023-12-16 09:27:25,332 INFO L158 Benchmark]: Boogie Preprocessor took 103.56ms. Allocated memory is still 259.0MB. Free memory was 223.6MB in the beginning and 216.8MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 09:27:25,332 INFO L158 Benchmark]: RCFGBuilder took 2770.87ms. Allocated memory is still 259.0MB. Free memory was 216.8MB in the beginning and 217.9MB in the end (delta: -1.1MB). Peak memory consumption was 130.4MB. Max. memory is 8.0GB. [2023-12-16 09:27:25,332 INFO L158 Benchmark]: TraceAbstraction took 70906.45ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 216.9MB in the beginning and 91.7MB in the end (delta: 125.2MB). Peak memory consumption was 177.8MB. Max. memory is 8.0GB. [2023-12-16 09:27:25,333 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 189.8MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 478.53ms. Allocated memory is still 189.8MB. Free memory was 138.0MB in the beginning and 100.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.21ms. Allocated memory was 189.8MB in the beginning and 259.0MB in the end (delta: 69.2MB). Free memory was 100.3MB in the beginning and 223.6MB in the end (delta: -123.3MB). Peak memory consumption was 6.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.56ms. Allocated memory is still 259.0MB. Free memory was 223.6MB in the beginning and 216.8MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2770.87ms. Allocated memory is still 259.0MB. Free memory was 216.8MB in the beginning and 217.9MB in the end (delta: -1.1MB). Peak memory consumption was 130.4MB. Max. memory is 8.0GB. * TraceAbstraction took 70906.45ms. Allocated memory was 259.0MB in the beginning and 311.4MB in the end (delta: 52.4MB). Free memory was 216.9MB in the beginning and 91.7MB in the end (delta: 125.2MB). Peak memory consumption was 177.8MB. 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: 164]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 164). Cancelled while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (5368 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1385 SdHoareTripleChecker+Valid, 57.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1385 mSDsluCounter, 1208 SdHoareTripleChecker+Invalid, 51.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 784 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5745 IncrementalHoareTripleChecker+Invalid, 6529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 784 mSolverCounterUnsat, 1144 mSDtfsCounter, 5745 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3209 GetRequests, 3189 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2139occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 3207 ConstructedInterpolants, 0 QuantifiedInterpolants, 11845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2517 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 3476/4048 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