/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 09:08:46,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 09:08:46,202 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:08:46,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 09:08:46,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 09:08:46,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 09:08:46,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 09:08:46,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 09:08:46,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 09:08:46,235 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 09:08:46,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 09:08:46,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 09:08:46,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 09:08:46,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 09:08:46,237 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 09:08:46,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 09:08:46,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 09:08:46,238 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 09:08:46,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 09:08:46,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 09:08:46,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 09:08:46,239 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 09:08:46,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 09:08:46,240 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 09:08:46,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:08:46,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 09:08:46,241 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 09:08:46,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 09:08:46,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 09:08:46,242 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 09:08:46,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 09:08:46,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 09:08:46,242 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 09:08:46,242 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:08:46,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 09:08:46,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 09:08:46,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 09:08:46,450 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 09:08:46,452 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 09:08:46,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label31.c [2023-12-16 09:08:47,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 09:08:47,654 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 09:08:47,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label31.c [2023-12-16 09:08:47,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7381ee14e/85c07eaafd61414ba24fac5cea89faf0/FLAG1895f4477 [2023-12-16 09:08:47,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7381ee14e/85c07eaafd61414ba24fac5cea89faf0 [2023-12-16 09:08:47,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 09:08:47,686 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 09:08:47,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 09:08:47,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 09:08:47,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 09:08:47,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:08:47" (1/1) ... [2023-12-16 09:08:47,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbf7918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:47, skipping insertion in model container [2023-12-16 09:08:47,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:08:47" (1/1) ... [2023-12-16 09:08:47,737 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 09:08:47,862 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label31.c[1180,1193] [2023-12-16 09:08:48,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:08:48,059 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 09:08:48,069 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label31.c[1180,1193] [2023-12-16 09:08:48,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:08:48,227 INFO L206 MainTranslator]: Completed translation [2023-12-16 09:08:48,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48 WrapperNode [2023-12-16 09:08:48,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 09:08:48,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 09:08:48,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 09:08:48,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 09:08:48,235 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:08:48" (1/1) ... [2023-12-16 09:08:48,269 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:08:48" (1/1) ... [2023-12-16 09:08:48,326 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 998 [2023-12-16 09:08:48,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 09:08:48,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 09:08:48,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 09:08:48,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 09:08:48,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,382 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:08:48,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 09:08:48,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 09:08:48,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 09:08:48,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 09:08:48,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (1/1) ... [2023-12-16 09:08:48,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:08:48,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 09:08:48,490 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:08:48,491 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:08:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 09:08:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 09:08:48,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 09:08:48,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 09:08:48,559 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 09:08:48,560 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 09:08:55,256 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 09:08:55,300 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 09:08:55,300 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 09:08:55,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:08:55 BoogieIcfgContainer [2023-12-16 09:08:55,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 09:08:55,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 09:08:55,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 09:08:55,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 09:08:55,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:08:47" (1/3) ... [2023-12-16 09:08:55,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af97e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:08:55, skipping insertion in model container [2023-12-16 09:08:55,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:08:48" (2/3) ... [2023-12-16 09:08:55,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af97e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:08:55, skipping insertion in model container [2023-12-16 09:08:55,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:08:55" (3/3) ... [2023-12-16 09:08:55,308 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label31.c [2023-12-16 09:08:55,319 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 09:08:55,320 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 09:08:55,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 09:08:55,374 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;@63bb67f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 09:08:55,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 09:08:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:08:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 09:08:55,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:08:55,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 09:08:55,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:08:55,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:08:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1854374530, now seen corresponding path program 1 times [2023-12-16 09:08:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:08:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086704766] [2023-12-16 09:08:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:08:55,394 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:08:55,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:08:55,396 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:08:55,417 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:08:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:08:55,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 09:08:55,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:08:55,477 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:08:55,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:08:55,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:08:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086704766] [2023-12-16 09:08:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086704766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:08:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:08:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:08:55,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665033266] [2023-12-16 09:08:55,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:08:55,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 09:08:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:08:55,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 09:08:55,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:08:55,516 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:08:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:08:55,564 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2023-12-16 09:08:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 09:08:55,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 09:08:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:08:55,579 INFO L225 Difference]: With dead ends: 441 [2023-12-16 09:08:55,579 INFO L226 Difference]: Without dead ends: 219 [2023-12-16 09:08:55,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:08:55,585 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:08:55,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 09:08:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-16 09:08:55,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-12-16 09:08:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:08:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2023-12-16 09:08:55,630 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 6 [2023-12-16 09:08:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:08:55,630 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2023-12-16 09:08:55,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:08:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2023-12-16 09:08:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 09:08:55,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:08:55,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 09:08:55,636 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:08:55,833 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:08:55,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:08:55,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:08:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1855588273, now seen corresponding path program 1 times [2023-12-16 09:08:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:08:55,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966311381] [2023-12-16 09:08:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:08:55,835 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:08:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:08:55,836 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:08:55,838 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:08:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:08:55,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:08:55,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:08:55,895 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:08:55,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:08:55,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:08:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966311381] [2023-12-16 09:08:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966311381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:08:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:08:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:08:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165926260] [2023-12-16 09:08:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:08:55,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:08:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:08:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:08:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:08:55,898 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:09:02,586 INFO L93 Difference]: Finished difference Result 629 states and 1028 transitions. [2023-12-16 09:09:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:09:02,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 09:09:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:09:02,594 INFO L225 Difference]: With dead ends: 629 [2023-12-16 09:09:02,594 INFO L226 Difference]: Without dead ends: 411 [2023-12-16 09:09:02,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:02,596 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 199 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-16 09:09:02,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 144 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-16 09:09:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-16 09:09:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2023-12-16 09:09:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.4594594594594594) internal successors, (594), 407 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 594 transitions. [2023-12-16 09:09:02,610 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 594 transitions. Word has length 6 [2023-12-16 09:09:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:09:02,610 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 594 transitions. [2023-12-16 09:09:02,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 594 transitions. [2023-12-16 09:09:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-16 09:09:02,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:09:02,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:09:02,619 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:09:02,816 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:09:02,817 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:09:02,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:09:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1140471862, now seen corresponding path program 1 times [2023-12-16 09:09:02,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:09:02,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318226375] [2023-12-16 09:09:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:09:02,819 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:09:02,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:09:02,820 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:09:02,832 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:09:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:09:02,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:09:02,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:09:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:03,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:09:03,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:09:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318226375] [2023-12-16 09:09:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318226375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:09:03,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:09:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:09:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363863267] [2023-12-16 09:09:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:09:03,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:09:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:09:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:09:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:03,020 INFO L87 Difference]: Start difference. First operand 408 states and 594 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:11,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:09:11,275 INFO L93 Difference]: Finished difference Result 1198 states and 1750 transitions. [2023-12-16 09:09:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:09:11,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-12-16 09:09:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:09:11,284 INFO L225 Difference]: With dead ends: 1198 [2023-12-16 09:09:11,284 INFO L226 Difference]: Without dead ends: 791 [2023-12-16 09:09:11,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:11,286 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 132 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-16 09:09:11,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 181 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-12-16 09:09:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-12-16 09:09:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 780. [2023-12-16 09:09:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.3478818998716302) internal successors, (1050), 779 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1050 transitions. [2023-12-16 09:09:11,302 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1050 transitions. Word has length 74 [2023-12-16 09:09:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:09:11,302 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1050 transitions. [2023-12-16 09:09:11,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 2 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1050 transitions. [2023-12-16 09:09:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-16 09:09:11,304 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:09:11,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:09:11,308 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:09:11,508 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:09:11,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:09:11,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:09:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash -300867777, now seen corresponding path program 1 times [2023-12-16 09:09:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:09:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454174213] [2023-12-16 09:09:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:09:11,510 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:09:11,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:09:11,511 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:09:11,519 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:09:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:09:11,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:09:11,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:09:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:11,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:09:11,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:09:11,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454174213] [2023-12-16 09:09:11,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454174213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:09:11,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:09:11,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:09:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53702637] [2023-12-16 09:09:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:09:11,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:09:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:09:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:09:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:11,703 INFO L87 Difference]: Start difference. First operand 780 states and 1050 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:09:18,963 INFO L93 Difference]: Finished difference Result 1928 states and 2650 transitions. [2023-12-16 09:09:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:09:18,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2023-12-16 09:09:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:09:18,974 INFO L225 Difference]: With dead ends: 1928 [2023-12-16 09:09:18,974 INFO L226 Difference]: Without dead ends: 1149 [2023-12-16 09:09:18,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:18,976 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 148 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-16 09:09:18,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-16 09:09:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-16 09:09:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2023-12-16 09:09:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.2569686411149825) internal successors, (1443), 1148 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1443 transitions. [2023-12-16 09:09:18,991 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1443 transitions. Word has length 77 [2023-12-16 09:09:18,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:09:18,992 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1443 transitions. [2023-12-16 09:09:18,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1443 transitions. [2023-12-16 09:09:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-16 09:09:18,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:09:18,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:09:19,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 09:09:19,197 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:09:19,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:09:19,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:09:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 581400735, now seen corresponding path program 1 times [2023-12-16 09:09:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:09:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527403875] [2023-12-16 09:09:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:09:19,199 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:09:19,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:09:19,201 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:09:19,210 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:09:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:09:19,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:09:19,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:09:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:19,305 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:09:19,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:09:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527403875] [2023-12-16 09:09:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527403875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:09:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:09:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:09:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687348334] [2023-12-16 09:09:19,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:09:19,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:09:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:09:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:09:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:19,309 INFO L87 Difference]: Start difference. First operand 1149 states and 1443 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:26,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:09:26,290 INFO L93 Difference]: Finished difference Result 2313 states and 3054 transitions. [2023-12-16 09:09:26,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:09:26,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2023-12-16 09:09:26,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:09:26,301 INFO L225 Difference]: With dead ends: 2313 [2023-12-16 09:09:26,302 INFO L226 Difference]: Without dead ends: 1533 [2023-12-16 09:09:26,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:09:26,304 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 198 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:09:26,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 334 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-16 09:09:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2023-12-16 09:09:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1525. [2023-12-16 09:09:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.244750656167979) internal successors, (1897), 1524 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1897 transitions. [2023-12-16 09:09:26,324 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1897 transitions. Word has length 133 [2023-12-16 09:09:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:09:26,325 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1897 transitions. [2023-12-16 09:09:26,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1897 transitions. [2023-12-16 09:09:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-12-16 09:09:26,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:09:26,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:09:26,334 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:09:26,529 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:09:26,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:09:26,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:09:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2064446359, now seen corresponding path program 1 times [2023-12-16 09:09:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:09:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827763968] [2023-12-16 09:09:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:09:26,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:09:26,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:09:26,532 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:09:26,540 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:09:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:09:26,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 09:09:26,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:09:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:27,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:09:29,329 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:29,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:09:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827763968] [2023-12-16 09:09:29,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827763968] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:09:29,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:09:29,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:09:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353810642] [2023-12-16 09:09:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:09:29,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:09:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:09:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:09:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:09:29,331 INFO L87 Difference]: Start difference. First operand 1525 states and 1897 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:09:43,043 INFO L93 Difference]: Finished difference Result 2676 states and 3521 transitions. [2023-12-16 09:09:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:09:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2023-12-16 09:09:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:09:43,053 INFO L225 Difference]: With dead ends: 2676 [2023-12-16 09:09:43,054 INFO L226 Difference]: Without dead ends: 2078 [2023-12-16 09:09:43,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:09:43,058 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-12-16 09:09:43,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 47 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 13.7s Time] [2023-12-16 09:09:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2023-12-16 09:09:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2023-12-16 09:09:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 2077 states have (on average 1.2696196437168994) internal successors, (2637), 2077 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2637 transitions. [2023-12-16 09:09:43,079 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2637 transitions. Word has length 187 [2023-12-16 09:09:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:09:43,079 INFO L495 AbstractCegarLoop]: Abstraction has 2078 states and 2637 transitions. [2023-12-16 09:09:43,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:09:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2637 transitions. [2023-12-16 09:09:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-16 09:09:43,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:09:43,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:09:43,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 09:09:43,286 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:09:43,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:09:43,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:09:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1143846921, now seen corresponding path program 1 times [2023-12-16 09:09:43,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:09:43,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828938870] [2023-12-16 09:09:43,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:09:43,288 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:09:43,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:09:43,290 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:09:43,290 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:09:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:09:43,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 09:09:43,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:09:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:43,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:09:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 83 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:09:46,531 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:09:46,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828938870] [2023-12-16 09:09:46,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828938870] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 09:09:46,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 09:09:46,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 09:09:46,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510966079] [2023-12-16 09:09:46,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 09:09:46,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 09:09:46,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:09:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 09:09:46,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 09:09:46,534 INFO L87 Difference]: Start difference. First operand 2078 states and 2637 transitions. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 09:09:59,715 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:09:59,719 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 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 09:10:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 09:10:00,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-16 09:10:00,245 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 456 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:10:00,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 80 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 13.5s Time] [2023-12-16 09:10:00,247 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 09:10:00,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 09:10:00,447 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:10:00,451 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2078states) and FLOYD_HOARE automaton (currently 7 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (1516 states constructed, input type IntersectNwa). [2023-12-16 09:10:00,455 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:10:00,465 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 09:10:00,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:10:00 BoogieIcfgContainer [2023-12-16 09:10:00,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 09:10:00,470 INFO L158 Benchmark]: Toolchain (without parser) took 72783.85ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 131.3MB in the beginning and 75.8MB in the end (delta: 55.5MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. [2023-12-16 09:10:00,470 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 09:10:00,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.45ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 131.0MB in the beginning and 200.0MB in the end (delta: -69.0MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. [2023-12-16 09:10:00,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.24ms. Allocated memory is still 243.3MB. Free memory was 200.0MB in the beginning and 191.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 09:10:00,471 INFO L158 Benchmark]: Boogie Preprocessor took 130.43ms. Allocated memory is still 243.3MB. Free memory was 191.1MB in the beginning and 181.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 09:10:00,471 INFO L158 Benchmark]: RCFGBuilder took 6842.84ms. Allocated memory is still 243.3MB. Free memory was 181.2MB in the beginning and 142.5MB in the end (delta: 38.6MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. [2023-12-16 09:10:00,471 INFO L158 Benchmark]: TraceAbstraction took 65166.87ms. Allocated memory is still 243.3MB. Free memory was 142.0MB in the beginning and 75.8MB in the end (delta: 66.2MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. [2023-12-16 09:10:00,473 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.12ms. Allocated memory is still 182.5MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 539.45ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 131.0MB in the beginning and 200.0MB in the end (delta: -69.0MB). Peak memory consumption was 51.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 97.24ms. Allocated memory is still 243.3MB. Free memory was 200.0MB in the beginning and 191.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 130.43ms. Allocated memory is still 243.3MB. Free memory was 191.1MB in the beginning and 181.2MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 6842.84ms. Allocated memory is still 243.3MB. Free memory was 181.2MB in the beginning and 142.5MB in the end (delta: 38.6MB). Peak memory consumption was 115.7MB. Max. memory is 8.0GB. * TraceAbstraction took 65166.87ms. Allocated memory is still 243.3MB. Free memory was 142.0MB in the beginning and 75.8MB in the end (delta: 66.2MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 37). Cancelled while NwaCegarLoop was constructing difference of abstraction (2078states) and FLOYD_HOARE automaton (currently 7 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (1516 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 56.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1282 SdHoareTripleChecker+Valid, 56.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1282 mSDsluCounter, 1293 SdHoareTripleChecker+Invalid, 48.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 638 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4775 IncrementalHoareTripleChecker+Invalid, 5413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 638 mSolverCounterUnsat, 1129 mSDtfsCounter, 4775 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1059 GetRequests, 1046 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2078occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 681 NumberOfCodeBlocks, 681 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1057 ConstructedInterpolants, 0 QuantifiedInterpolants, 6547 SizeOfPredicates, 1 NumberOfNonLiveVariables, 995 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 181/342 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