/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_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 09:24:28,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 09:24:28,279 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:24:28,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 09:24:28,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 09:24:28,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 09:24:28,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 09:24:28,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 09:24:28,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 09:24:28,309 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 09:24:28,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 09:24:28,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 09:24:28,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 09:24:28,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 09:24:28,311 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 09:24:28,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 09:24:28,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 09:24:28,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 09:24:28,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 09:24:28,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 09:24:28,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 09:24:28,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 09:24:28,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 09:24:28,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 09:24:28,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 09:24:28,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 09:24:28,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 09:24:28,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 09:24:28,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 09:24:28,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 09:24:28,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 09:24:28,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 09:24:28,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 09:24:28,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 09:24:28,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:24:28,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 09:24:28,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 09:24:28,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 09:24:28,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 09:24:28,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 09:24:28,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 09:24:28,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 09:24:28,317 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 09:24:28,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 09:24:28,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 09:24:28,317 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 09:24:28,317 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:24:28,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 09:24:28,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 09:24:28,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 09:24:28,525 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 09:24:28,525 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 09:24:28,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19.c [2023-12-16 09:24:29,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 09:24:29,734 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 09:24:29,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label19.c [2023-12-16 09:24:29,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d52d125c/250ae2ec89e54c4697bf86c25376fa75/FLAGd1dcafa87 [2023-12-16 09:24:29,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d52d125c/250ae2ec89e54c4697bf86c25376fa75 [2023-12-16 09:24:29,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 09:24:29,776 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 09:24:29,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 09:24:29,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 09:24:29,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 09:24:29,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:24:29" (1/1) ... [2023-12-16 09:24:29,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe1a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:29, skipping insertion in model container [2023-12-16 09:24:29,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:24:29" (1/1) ... [2023-12-16 09:24:29,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 09:24:29,986 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_label19.c[6323,6336] [2023-12-16 09:24:30,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:24:30,146 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 09:24:30,186 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_label19.c[6323,6336] [2023-12-16 09:24:30,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:24:30,287 INFO L206 MainTranslator]: Completed translation [2023-12-16 09:24:30,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30 WrapperNode [2023-12-16 09:24:30,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 09:24:30,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 09:24:30,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 09:24:30,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 09:24:30,293 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:24:30" (1/1) ... [2023-12-16 09:24:30,308 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:24:30" (1/1) ... [2023-12-16 09:24:30,347 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 857 [2023-12-16 09:24:30,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 09:24:30,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 09:24:30,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 09:24:30,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 09:24:30,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,385 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:24:30,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,413 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 09:24:30,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 09:24:30,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 09:24:30,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 09:24:30,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (1/1) ... [2023-12-16 09:24:30,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:24:30,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 09:24:30,481 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:24:30,496 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:24:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 09:24:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 09:24:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 09:24:30,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 09:24:30,560 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 09:24:30,562 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 09:24:33,099 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 09:24:33,141 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 09:24:33,141 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 09:24:33,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:24:33 BoogieIcfgContainer [2023-12-16 09:24:33,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 09:24:33,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 09:24:33,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 09:24:33,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 09:24:33,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:24:29" (1/3) ... [2023-12-16 09:24:33,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114d0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:24:33, skipping insertion in model container [2023-12-16 09:24:33,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:24:30" (2/3) ... [2023-12-16 09:24:33,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114d0ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:24:33, skipping insertion in model container [2023-12-16 09:24:33,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:24:33" (3/3) ... [2023-12-16 09:24:33,148 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label19.c [2023-12-16 09:24:33,159 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 09:24:33,159 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 09:24:33,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 09:24:33,207 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;@12f3c20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 09:24:33,207 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 09:24:33,212 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:24:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 09:24:33,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:33,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:33,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:33,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -95214397, now seen corresponding path program 1 times [2023-12-16 09:24:33,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:33,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608370180] [2023-12-16 09:24:33,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:33,243 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:24:33,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:33,245 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:24:33,249 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:24:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:33,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 09:24:33,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:33,345 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:24:33,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:24:33,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608370180] [2023-12-16 09:24:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608370180] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:24:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:24:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:24:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038763291] [2023-12-16 09:24:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:33,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 09:24:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:33,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 09:24:33,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:24:33,373 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 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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:24:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:33,421 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2023-12-16 09:24:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 09:24:33,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2023-12-16 09:24:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:33,435 INFO L225 Difference]: With dead ends: 365 [2023-12-16 09:24:33,435 INFO L226 Difference]: Without dead ends: 181 [2023-12-16 09:24:33,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 60 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:24:33,442 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:24:33,443 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:24:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-16 09:24:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-12-16 09:24:33,482 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:24:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2023-12-16 09:24:33,485 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 61 [2023-12-16 09:24:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:33,486 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2023-12-16 09:24:33,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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:24:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2023-12-16 09:24:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-16 09:24:33,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:33,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:33,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 09:24:33,691 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:24:33,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:33,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -186905249, now seen corresponding path program 1 times [2023-12-16 09:24:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:33,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14856426] [2023-12-16 09:24:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:33,693 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:24:33,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:33,695 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:24:33,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 09:24:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:33,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:24:33,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:33,836 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:24:33,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:24:33,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:33,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14856426] [2023-12-16 09:24:33,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14856426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:24:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:24:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:24:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805635363] [2023-12-16 09:24:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:33,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:24:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:33,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:24:33,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:24:33,839 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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:24:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:36,711 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2023-12-16 09:24:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:24:36,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2023-12-16 09:24:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:36,714 INFO L225 Difference]: With dead ends: 539 [2023-12-16 09:24:36,714 INFO L226 Difference]: Without dead ends: 359 [2023-12-16 09:24:36,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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:24:36,715 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:36,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 64 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 09:24:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-16 09:24:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-16 09:24:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.488826815642458) internal successors, (533), 358 states have internal predecessors, (533), 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:24:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2023-12-16 09:24:36,729 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 61 [2023-12-16 09:24:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:36,729 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2023-12-16 09:24:36,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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:24:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2023-12-16 09:24:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-16 09:24:36,731 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:36,731 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:36,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 09:24:36,933 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:24:36,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:36,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash 444368811, now seen corresponding path program 1 times [2023-12-16 09:24:36,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:36,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694517979] [2023-12-16 09:24:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:36,935 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:24:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:36,938 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:24:36,939 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:24:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:37,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:24:37,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:24:37,107 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:24:37,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694517979] [2023-12-16 09:24:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694517979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:24:37,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:24:37,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:24:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541259073] [2023-12-16 09:24:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:37,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:24:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:24:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:24:37,109 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:24:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:40,149 INFO L93 Difference]: Finished difference Result 1073 states and 1596 transitions. [2023-12-16 09:24:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:24:40,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2023-12-16 09:24:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:40,152 INFO L225 Difference]: With dead ends: 1073 [2023-12-16 09:24:40,152 INFO L226 Difference]: Without dead ends: 715 [2023-12-16 09:24:40,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 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:24:40,154 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:40,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 100 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-16 09:24:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-16 09:24:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2023-12-16 09:24:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.3459383753501402) internal successors, (961), 714 states have internal predecessors, (961), 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:24:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 961 transitions. [2023-12-16 09:24:40,177 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 961 transitions. Word has length 126 [2023-12-16 09:24:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:40,178 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 961 transitions. [2023-12-16 09:24:40,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:24:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 961 transitions. [2023-12-16 09:24:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 09:24:40,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:40,181 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, 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] [2023-12-16 09:24:40,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 09:24:40,383 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:24:40,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:40,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1496008873, now seen corresponding path program 1 times [2023-12-16 09:24:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:40,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271694952] [2023-12-16 09:24:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:40,385 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:24:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:40,386 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:24:40,394 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:24:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:40,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:24:40,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:24:40,556 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:24:40,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271694952] [2023-12-16 09:24:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271694952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:24:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:24:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:24:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012922694] [2023-12-16 09:24:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:40,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:24:40,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:24:40,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:24:40,562 INFO L87 Difference]: Start difference. First operand 715 states and 961 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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:24:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:43,544 INFO L93 Difference]: Finished difference Result 1965 states and 2655 transitions. [2023-12-16 09:24:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:24:43,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2023-12-16 09:24:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:43,549 INFO L225 Difference]: With dead ends: 1965 [2023-12-16 09:24:43,549 INFO L226 Difference]: Without dead ends: 1251 [2023-12-16 09:24:43,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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:24:43,550 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 131 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:43,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 86 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 09:24:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-12-16 09:24:43,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1249. [2023-12-16 09:24:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2467948717948718) internal successors, (1556), 1248 states have internal predecessors, (1556), 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:24:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1556 transitions. [2023-12-16 09:24:43,577 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1556 transitions. Word has length 129 [2023-12-16 09:24:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:43,577 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1556 transitions. [2023-12-16 09:24:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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:24:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1556 transitions. [2023-12-16 09:24:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-16 09:24:43,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:43,579 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:43,583 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:24:43,780 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:24:43,781 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:43,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1287361717, now seen corresponding path program 1 times [2023-12-16 09:24:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:43,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038152600] [2023-12-16 09:24:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:43,782 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:24:43,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:43,783 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:24:43,784 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:24:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:43,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 09:24:43,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:24:44,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:24:44,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:44,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038152600] [2023-12-16 09:24:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038152600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:24:44,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:24:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:24:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604225019] [2023-12-16 09:24:44,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:44,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 09:24:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 09:24:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:24:44,303 INFO L87 Difference]: Start difference. First operand 1249 states and 1556 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 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:24:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:46,834 INFO L93 Difference]: Finished difference Result 2170 states and 2741 transitions. [2023-12-16 09:24:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 09:24:46,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 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 141 [2023-12-16 09:24:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:46,837 INFO L225 Difference]: With dead ends: 2170 [2023-12-16 09:24:46,837 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:24:46,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 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:24:46,840 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 101 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:46,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 111 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 09:24:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:24:46,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:24:46,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2392523364485981) internal successors, (1326), 1070 states have internal predecessors, (1326), 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:24:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1326 transitions. [2023-12-16 09:24:46,856 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1326 transitions. Word has length 141 [2023-12-16 09:24:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:46,857 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1326 transitions. [2023-12-16 09:24:46,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 3 states have internal predecessors, (141), 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:24:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1326 transitions. [2023-12-16 09:24:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2023-12-16 09:24:46,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:46,870 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-12-16 09:24:46,874 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:24:47,070 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:24:47,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:47,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash -507410634, now seen corresponding path program 1 times [2023-12-16 09:24:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062571275] [2023-12-16 09:24:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:47,072 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:24:47,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:47,073 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:24:47,077 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:24:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:47,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:24:47,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-16 09:24:47,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:24:47,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062571275] [2023-12-16 09:24:47,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062571275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:24:47,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:24:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:24:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500468147] [2023-12-16 09:24:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:47,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:24:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:24:47,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:24:47,848 INFO L87 Difference]: Start difference. First operand 1071 states and 1326 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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:24:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:50,078 INFO L93 Difference]: Finished difference Result 1785 states and 2286 transitions. [2023-12-16 09:24:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:24:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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 236 [2023-12-16 09:24:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:50,081 INFO L225 Difference]: With dead ends: 1785 [2023-12-16 09:24:50,081 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:24:50,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 234 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:24:50,082 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:50,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 121 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 09:24:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:24:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:24:50,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.233644859813084) internal successors, (1320), 1070 states have internal predecessors, (1320), 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:24:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1320 transitions. [2023-12-16 09:24:50,096 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1320 transitions. Word has length 236 [2023-12-16 09:24:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:50,096 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1320 transitions. [2023-12-16 09:24:50,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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:24:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1320 transitions. [2023-12-16 09:24:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2023-12-16 09:24:50,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:50,099 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:24:50,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-16 09:24:50,302 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:24:50,302 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:50,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 917155366, now seen corresponding path program 1 times [2023-12-16 09:24:50,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:50,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922931860] [2023-12-16 09:24:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:50,304 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:24:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:50,305 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:24:50,307 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:24:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:50,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:24:50,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:50,823 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 179 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:24:50,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:24:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:24:51,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922931860] [2023-12-16 09:24:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922931860] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:24:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:24:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:24:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554075587] [2023-12-16 09:24:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:51,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:24:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:24:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:24:51,214 INFO L87 Difference]: Start difference. First operand 1071 states and 1320 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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:24:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:57,247 INFO L93 Difference]: Finished difference Result 2141 states and 2811 transitions. [2023-12-16 09:24:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:24:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 340 [2023-12-16 09:24:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:57,252 INFO L225 Difference]: With dead ends: 2141 [2023-12-16 09:24:57,252 INFO L226 Difference]: Without dead ends: 1427 [2023-12-16 09:24:57,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 675 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:24:57,253 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:57,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 55 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-12-16 09:24:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2023-12-16 09:24:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2023-12-16 09:24:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.2391304347826086) internal successors, (1767), 1426 states have internal predecessors, (1767), 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:24:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1767 transitions. [2023-12-16 09:24:57,269 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1767 transitions. Word has length 340 [2023-12-16 09:24:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:57,269 INFO L495 AbstractCegarLoop]: Abstraction has 1427 states and 1767 transitions. [2023-12-16 09:24:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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:24:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1767 transitions. [2023-12-16 09:24:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2023-12-16 09:24:57,272 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:57,272 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:57,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 09:24:57,476 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:24:57,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:57,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:57,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1909357896, now seen corresponding path program 1 times [2023-12-16 09:24:57,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297763288] [2023-12-16 09:24:57,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:57,478 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:24:57,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:57,479 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:24:57,479 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:24:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:57,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:24:57,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-16 09:24:57,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:24:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2023-12-16 09:24:59,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297763288] [2023-12-16 09:24:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297763288] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:24:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:24:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:24:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777239489] [2023-12-16 09:24:59,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:24:59,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:24:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:24:59,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:24:59,063 INFO L87 Difference]: Start difference. First operand 1427 states and 1767 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:25:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:25:04,734 INFO L93 Difference]: Finished difference Result 3209 states and 4152 transitions. [2023-12-16 09:25:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:25:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 352 [2023-12-16 09:25:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:25:04,739 INFO L225 Difference]: With dead ends: 3209 [2023-12-16 09:25:04,739 INFO L226 Difference]: Without dead ends: 2139 [2023-12-16 09:25:04,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 699 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:25:04,741 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-12-16 09:25:04,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 247 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2023-12-16 09:25:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-16 09:25:04,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2023-12-16 09:25:04,763 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:25:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2665 transitions. [2023-12-16 09:25:04,765 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2665 transitions. Word has length 352 [2023-12-16 09:25:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:25:04,766 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2665 transitions. [2023-12-16 09:25:04,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:25:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2665 transitions. [2023-12-16 09:25:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2023-12-16 09:25:04,768 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:25:04,769 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:25:04,776 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:25:04,974 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:25:04,974 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:25:04,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:25:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -730768352, now seen corresponding path program 1 times [2023-12-16 09:25:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:25:04,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615398598] [2023-12-16 09:25:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:25:04,976 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:25:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:25:04,977 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:25:04,980 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:25:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:25:05,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 09:25:05,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:25:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:25:06,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:25:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 248 proven. 122 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:25:13,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:25:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615398598] [2023-12-16 09:25:13,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615398598] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 09:25:13,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 09:25:13,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 09:25:13,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044731548] [2023-12-16 09:25:13,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 09:25:13,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 09:25:13,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:25:13,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 09:25:13,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-16 09:25:13,777 INFO L87 Difference]: Start difference. First operand 2139 states and 2665 transitions. Second operand has 9 states, 9 states have (on average 55.333333333333336) internal successors, (498), 8 states have internal predecessors, (498), 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:25:42,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 09:25:42,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2023-12-16 09:25:42,612 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1997 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2633 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1997 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:25:42,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1997 Valid, 55 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2633 Invalid, 0 Unknown, 0 Unchecked, 28.0s Time] [2023-12-16 09:25:42,613 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 09:25:42,613 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:25:42,613 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:25:42,621 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:25:42,814 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:25:42,815 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 14 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (4368 states constructed, input type IntersectNwa). [2023-12-16 09:25:42,818 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:25:42,820 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 09:25:42,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:25:42 BoogieIcfgContainer [2023-12-16 09:25:42,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 09:25:42,822 INFO L158 Benchmark]: Toolchain (without parser) took 73045.70ms. Allocated memory was 303.0MB in the beginning and 370.1MB in the end (delta: 67.1MB). Free memory was 248.9MB in the beginning and 256.1MB in the end (delta: -7.2MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2023-12-16 09:25:42,822 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 231.7MB. Free memory is still 181.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 09:25:42,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.80ms. Allocated memory is still 303.0MB. Free memory was 248.6MB in the beginning and 263.2MB in the end (delta: -14.6MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2023-12-16 09:25:42,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.31ms. Allocated memory is still 303.0MB. Free memory was 263.2MB in the beginning and 256.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 09:25:42,822 INFO L158 Benchmark]: Boogie Preprocessor took 71.62ms. Allocated memory is still 303.0MB. Free memory was 256.4MB in the beginning and 249.6MB in the end (delta: 6.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 09:25:42,822 INFO L158 Benchmark]: RCFGBuilder took 2721.32ms. Allocated memory is still 303.0MB. Free memory was 249.6MB in the beginning and 201.2MB in the end (delta: 48.4MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. [2023-12-16 09:25:42,823 INFO L158 Benchmark]: TraceAbstraction took 69678.20ms. Allocated memory was 303.0MB in the beginning and 370.1MB in the end (delta: 67.1MB). Free memory was 200.7MB in the beginning and 256.1MB in the end (delta: -55.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2023-12-16 09:25:42,823 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.36ms. Allocated memory is still 231.7MB. Free memory is still 181.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 508.80ms. Allocated memory is still 303.0MB. Free memory was 248.6MB in the beginning and 263.2MB in the end (delta: -14.6MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.31ms. Allocated memory is still 303.0MB. Free memory was 263.2MB in the beginning and 256.4MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.62ms. Allocated memory is still 303.0MB. Free memory was 256.4MB in the beginning and 249.6MB in the end (delta: 6.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2721.32ms. Allocated memory is still 303.0MB. Free memory was 249.6MB in the beginning and 201.2MB in the end (delta: 48.4MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. * TraceAbstraction took 69678.20ms. Allocated memory was 303.0MB in the beginning and 370.1MB in the end (delta: 67.1MB). Free memory was 200.7MB in the beginning and 256.1MB in the end (delta: -55.3MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 200]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 200). Cancelled while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 14 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (4368 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.6s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 54.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2791 SdHoareTripleChecker+Valid, 53.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2791 mSDsluCounter, 1134 SdHoareTripleChecker+Invalid, 46.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 977 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6467 IncrementalHoareTripleChecker+Invalid, 7444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 977 mSolverCounterUnsat, 1061 mSDtfsCounter, 6467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2870 GetRequests, 2843 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1814 NumberOfCodeBlocks, 1814 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 12804 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2186 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 2127/3032 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