/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 00:15:47,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 00:15:47,466 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-24 00:15:47,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 00:15:47,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 00:15:47,489 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 00:15:47,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 00:15:47,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 00:15:47,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 00:15:47,490 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 00:15:47,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 00:15:47,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 00:15:47,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 00:15:47,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 00:15:47,492 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 00:15:47,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 00:15:47,493 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 00:15:47,494 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 00:15:47,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 00:15:47,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 00:15:47,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 00:15:47,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 00:15:47,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 00:15:47,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 00:15:47,500 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 00:15:47,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 00:15:47,501 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 00:15:47,501 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 00:15:47,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 00:15:47,502 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 00:15:47,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 00:15:47,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 00:15:47,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 00:15:47,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 00:15:47,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:15:47,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 00:15:47,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 00:15:47,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 00:15:47,505 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 00:15:47,505 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 00:15:47,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 00:15:47,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 00:15:47,506 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 00:15:47,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 00:15:47,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 00:15:47,507 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 00:15:47,507 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-24 00:15:47,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 00:15:47,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 00:15:47,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 00:15:47,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 00:15:47,771 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 00:15:47,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2023-12-24 00:15:48,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 00:15:49,153 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 00:15:49,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i [2023-12-24 00:15:49,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa2de765/a234ae335a6c490f82716da145932a96/FLAG49a9ce04c [2023-12-24 00:15:49,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5aa2de765/a234ae335a6c490f82716da145932a96 [2023-12-24 00:15:49,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 00:15:49,188 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 00:15:49,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 00:15:49,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 00:15:49,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 00:15:49,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b01977d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49, skipping insertion in model container [2023-12-24 00:15:49,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,230 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 00:15:49,344 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2023-12-24 00:15:49,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:15:49,393 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 00:15:49,403 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-37.i[915,928] [2023-12-24 00:15:49,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:15:49,441 INFO L206 MainTranslator]: Completed translation [2023-12-24 00:15:49,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49 WrapperNode [2023-12-24 00:15:49,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 00:15:49,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 00:15:49,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 00:15:49,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 00:15:49,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,491 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2023-12-24 00:15:49,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 00:15:49,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 00:15:49,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 00:15:49,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 00:15:49,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,517 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-24 00:15:49,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,525 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 00:15:49,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 00:15:49,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 00:15:49,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 00:15:49,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (1/1) ... [2023-12-24 00:15:49,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:15:49,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 00:15:49,568 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-24 00:15:49,599 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-24 00:15:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 00:15:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 00:15:49,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 00:15:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 00:15:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 00:15:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 00:15:49,716 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 00:15:49,720 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 00:15:49,978 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 00:15:50,033 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 00:15:50,033 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 00:15:50,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:15:50 BoogieIcfgContainer [2023-12-24 00:15:50,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 00:15:50,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 00:15:50,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 00:15:50,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 00:15:50,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:15:49" (1/3) ... [2023-12-24 00:15:50,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f857844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:15:50, skipping insertion in model container [2023-12-24 00:15:50,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:15:49" (2/3) ... [2023-12-24 00:15:50,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f857844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:15:50, skipping insertion in model container [2023-12-24 00:15:50,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:15:50" (3/3) ... [2023-12-24 00:15:50,041 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-37.i [2023-12-24 00:15:50,057 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 00:15:50,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 00:15:50,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 00:15:50,101 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;@6e36b636, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 00:15:50,102 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 00:15:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 00:15:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-24 00:15:50,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:15:50,121 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:15:50,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:15:50,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:15:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1363742477, now seen corresponding path program 1 times [2023-12-24 00:15:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:15:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84168771] [2023-12-24 00:15:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:15:50,144 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-24 00:15:50,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:15:50,151 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-24 00:15:50,164 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-24 00:15:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:15:50,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 00:15:50,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:15:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-24 00:15:50,379 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:15:50,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:15:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84168771] [2023-12-24 00:15:50,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84168771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:15:50,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:15:50,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 00:15:50,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690196086] [2023-12-24 00:15:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:15:50,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 00:15:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:15:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 00:15:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 00:15:50,412 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-24 00:15:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:15:50,485 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2023-12-24 00:15:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 00:15:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2023-12-24 00:15:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:15:50,494 INFO L225 Difference]: With dead ends: 67 [2023-12-24 00:15:50,494 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 00:15:50,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-24 00:15:50,500 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:15:50,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 00:15:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 00:15:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-24 00:15:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 00:15:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2023-12-24 00:15:50,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 60 [2023-12-24 00:15:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:15:50,532 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2023-12-24 00:15:50,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-24 00:15:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2023-12-24 00:15:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-24 00:15:50,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:15:50,535 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:15:50,543 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-24 00:15:50,741 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-24 00:15:50,742 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:15:50,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:15:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 360762289, now seen corresponding path program 1 times [2023-12-24 00:15:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:15:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269081159] [2023-12-24 00:15:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:15:50,744 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-24 00:15:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:15:50,745 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-24 00:15:50,747 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-24 00:15:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:15:50,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 00:15:50,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:15:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:15:50,953 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:15:50,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:15:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269081159] [2023-12-24 00:15:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269081159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:15:50,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:15:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 00:15:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054844141] [2023-12-24 00:15:50,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:15:50,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 00:15:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:15:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 00:15:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 00:15:50,962 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:15:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:15:52,067 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2023-12-24 00:15:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 00:15:52,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-24 00:15:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:15:52,070 INFO L225 Difference]: With dead ends: 63 [2023-12-24 00:15:52,070 INFO L226 Difference]: Without dead ends: 32 [2023-12-24 00:15:52,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-24 00:15:52,072 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:15:52,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 00:15:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-24 00:15:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-24 00:15:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 00:15:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2023-12-24 00:15:52,087 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 60 [2023-12-24 00:15:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:15:52,093 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2023-12-24 00:15:52,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:15:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2023-12-24 00:15:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-24 00:15:52,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:15:52,095 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:15:52,102 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-24 00:15:52,296 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-24 00:15:52,297 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:15:52,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:15:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash 360821871, now seen corresponding path program 1 times [2023-12-24 00:15:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:15:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660241489] [2023-12-24 00:15:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:15:52,299 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-24 00:15:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:15:52,300 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-24 00:15:52,304 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-24 00:15:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:15:52,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 00:15:52,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:17:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 00:17:08,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:17:08,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:17:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660241489] [2023-12-24 00:17:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660241489] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:17:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:17:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 00:17:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437667660] [2023-12-24 00:17:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:17:08,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 00:17:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:17:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 00:17:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-24 00:17:08,232 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:17:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:17:10,198 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2023-12-24 00:17:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 00:17:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-24 00:17:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:17:10,202 INFO L225 Difference]: With dead ends: 77 [2023-12-24 00:17:10,202 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 00:17:10,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-12-24 00:17:10,203 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:17:10,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 109 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 00:17:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 00:17:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-12-24 00:17:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 00:17:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-12-24 00:17:10,212 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 60 [2023-12-24 00:17:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:17:10,213 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-12-24 00:17:10,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:17:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-12-24 00:17:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 00:17:10,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:17:10,215 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:17:10,220 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-24 00:17:10,416 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-24 00:17:10,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:17:10,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:17:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1967852072, now seen corresponding path program 1 times [2023-12-24 00:17:10,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:17:10,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429496608] [2023-12-24 00:17:10,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:17:10,418 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-24 00:17:10,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:17:10,419 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-24 00:17:10,423 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-24 00:17:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:17:10,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 00:17:10,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:17:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 00:17:10,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:17:11,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:17:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429496608] [2023-12-24 00:17:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429496608] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 00:17:11,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [611921505] [2023-12-24 00:17:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:17:11,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 00:17:11,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 00:17:11,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 00:17:11,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-24 00:17:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:17:11,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 00:17:11,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:17:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 00:17:57,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:17:57,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [611921505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:17:57,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 00:17:57,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 14 [2023-12-24 00:17:57,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105359738] [2023-12-24 00:17:57,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:17:57,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 00:17:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:17:57,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 00:17:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-24 00:17:57,562 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:18:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:18:08,022 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2023-12-24 00:18:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 00:18:08,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-12-24 00:18:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:18:08,025 INFO L225 Difference]: With dead ends: 146 [2023-12-24 00:18:08,025 INFO L226 Difference]: Without dead ends: 105 [2023-12-24 00:18:08,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2023-12-24 00:18:08,027 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-24 00:18:08,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-24 00:18:08,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-24 00:18:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2023-12-24 00:18:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 00:18:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2023-12-24 00:18:08,053 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 61 [2023-12-24 00:18:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:18:08,054 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-12-24 00:18:08,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:18:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2023-12-24 00:18:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 00:18:08,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:18:08,055 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:18:08,061 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-24 00:18:08,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-24 00:18:08,460 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 00:18:08,461 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:18:08,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:18:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1158505446, now seen corresponding path program 1 times [2023-12-24 00:18:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:18:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072527101] [2023-12-24 00:18:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:18:08,463 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-24 00:18:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:18:08,464 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-24 00:18:08,466 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-24 00:18:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:18:08,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 00:18:08,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:18:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 00:18:08,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:18:09,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:18:09,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072527101] [2023-12-24 00:18:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072527101] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 00:18:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [712376936] [2023-12-24 00:18:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:18:09,285 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 00:18:09,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 00:18:09,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 00:18:09,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-24 00:18:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:18:09,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 00:18:09,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:18:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 00:18:56,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:18:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [712376936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:18:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 00:18:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 17 [2023-12-24 00:18:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110247360] [2023-12-24 00:18:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:18:56,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-24 00:18:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:18:56,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-24 00:18:56,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-12-24 00:18:56,209 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:19:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:19:04,171 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2023-12-24 00:19:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 00:19:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-12-24 00:19:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:19:04,174 INFO L225 Difference]: With dead ends: 121 [2023-12-24 00:19:04,174 INFO L226 Difference]: Without dead ends: 80 [2023-12-24 00:19:04,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2023-12-24 00:19:04,176 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 38 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-24 00:19:04,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 172 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-24 00:19:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-24 00:19:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2023-12-24 00:19:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 00:19:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2023-12-24 00:19:04,189 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 61 [2023-12-24 00:19:04,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:19:04,190 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-12-24 00:19:04,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:19:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2023-12-24 00:19:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 00:19:04,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:19:04,191 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:19:04,198 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-24 00:19:04,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-24 00:19:04,598 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 00:19:04,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:19:04,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:19:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1766874007, now seen corresponding path program 1 times [2023-12-24 00:19:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:19:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471046138] [2023-12-24 00:19:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:19:04,600 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-24 00:19:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:19:04,601 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-24 00:19:04,603 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-24 00:19:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:19:04,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 00:19:04,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:19:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 00:19:05,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:19:05,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:19:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471046138] [2023-12-24 00:19:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471046138] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 00:19:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [140273215] [2023-12-24 00:19:05,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:19:05,471 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 00:19:05,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 00:19:05,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 00:19:05,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 00:19:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:19:05,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 00:19:05,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:21:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-24 00:21:14,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:21:14,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [140273215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:21:14,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 00:21:14,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 15 [2023-12-24 00:21:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462498766] [2023-12-24 00:21:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:21:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-24 00:21:14,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:21:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-24 00:21:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-12-24 00:21:14,790 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:21:28,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:21:28,573 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2023-12-24 00:21:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 00:21:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-12-24 00:21:28,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:21:28,575 INFO L225 Difference]: With dead ends: 102 [2023-12-24 00:21:28,575 INFO L226 Difference]: Without dead ends: 100 [2023-12-24 00:21:28,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2023-12-24 00:21:28,576 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-24 00:21:28,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 180 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-24 00:21:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-24 00:21:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 70. [2023-12-24 00:21:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 00:21:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2023-12-24 00:21:28,590 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 62 [2023-12-24 00:21:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:21:28,590 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-12-24 00:21:28,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:21:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2023-12-24 00:21:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 00:21:28,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:21:28,592 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 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] [2023-12-24 00:21:28,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 00:21:28,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 00:21:28,999 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 00:21:28,999 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:21:29,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:21:29,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1122136655, now seen corresponding path program 1 times [2023-12-24 00:21:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:21:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833924176] [2023-12-24 00:21:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:21:29,001 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-24 00:21:29,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:21:29,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 00:21:29,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 00:21:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:21:29,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 00:21:29,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:21:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 345 proven. 1 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-24 00:21:29,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:21:29,281 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 00:21:29,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:21:29,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833924176] [2023-12-24 00:21:29,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833924176] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 00:21:29,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 00:21:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 00:21:29,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248530254] [2023-12-24 00:21:29,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 00:21:29,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:21:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:21:29,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:21:29,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:21:29,284 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2023-12-24 00:21:29,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:21:29,890 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2023-12-24 00:21:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 00:21:29,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 120 [2023-12-24 00:21:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:21:29,893 INFO L225 Difference]: With dead ends: 78 [2023-12-24 00:21:29,893 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 00:21:29,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:21:29,895 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 00:21:29,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 105 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 00:21:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 00:21:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 00:21:29,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-24 00:21:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 00:21:29,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2023-12-24 00:21:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:21:29,896 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 00:21:29,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2023-12-24 00:21:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 00:21:29,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 00:21:29,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 00:21:29,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 00:21:30,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 00:21:30,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L48-2(lines 45 51) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 37 43) no Hoare annotation was computed. [2023-12-24 00:21:34,420 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,421 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 53 57) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 51) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 60 75) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 43) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 00:21:34,421 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,422 INFO L895 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,422 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 00:21:34,422 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,422 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,422 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-12-24 00:21:34,422 INFO L895 garLoopResultBuilder]: At program point L88-3(lines 88 94) the Hoare annotation is: (let ((.cse0 (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse3))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))))))) (.cse1 (= currentRoundingMode roundNearestTiesToEven))) (or (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) .cse0 (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) .cse1 (= ~last_1_var_1_8~0 (_ bv64 8))) (and .cse0 (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv1 32)) .cse1))) [2023-12-24 00:21:34,422 INFO L899 garLoopResultBuilder]: For program point L88-4(lines 88 94) no Hoare annotation was computed. [2023-12-24 00:21:34,422 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-24 00:21:34,422 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,422 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (and (= (_ bv0 32) (bvadd ~last_1_var_1_11~0 (_ bv16 32))) (= (_ bv0 32) (bvadd (_ bv16 32) ~var_1_11~0)) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0))) (or (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse0)) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (and (fp.leq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) (fp.geq ~var_1_13~0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0)))))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~var_1_1~0 (_ bv8 8)) (= ~var_1_8~0 (_ bv64 8)) (= currentRoundingMode roundNearestTiesToEven) (= ~last_1_var_1_8~0 (_ bv64 8))) [2023-12-24 00:21:34,422 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 00:21:34,423 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 00:21:34,423 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 00:21:34,423 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 00:21:34,425 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-24 00:21:34,427 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 00:21:34,441 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,442 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,442 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,442 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,443 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,443 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,444 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,444 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,444 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,444 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 00:21:34,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 12:21:34 BoogieIcfgContainer [2023-12-24 00:21:34,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 00:21:34,445 INFO L158 Benchmark]: Toolchain (without parser) took 345257.25ms. Allocated memory was 334.5MB in the beginning and 910.2MB in the end (delta: 575.7MB). Free memory was 296.1MB in the beginning and 849.8MB in the end (delta: -553.7MB). Peak memory consumption was 550.5MB. Max. memory is 8.0GB. [2023-12-24 00:21:34,446 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 208.7MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 00:21:34,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.59ms. Allocated memory is still 334.5MB. Free memory was 296.1MB in the beginning and 283.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 00:21:34,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.32ms. Allocated memory is still 334.5MB. Free memory was 283.0MB in the beginning and 280.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 00:21:34,447 INFO L158 Benchmark]: Boogie Preprocessor took 41.27ms. Allocated memory is still 334.5MB. Free memory was 280.9MB in the beginning and 278.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 00:21:34,447 INFO L158 Benchmark]: RCFGBuilder took 499.48ms. Allocated memory is still 334.5MB. Free memory was 278.3MB in the beginning and 258.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-24 00:21:34,447 INFO L158 Benchmark]: TraceAbstraction took 344409.00ms. Allocated memory was 334.5MB in the beginning and 910.2MB in the end (delta: 575.7MB). Free memory was 257.3MB in the beginning and 849.8MB in the end (delta: -592.5MB). Peak memory consumption was 511.7MB. Max. memory is 8.0GB. [2023-12-24 00:21:34,449 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.53ms. Allocated memory is still 208.7MB. Free memory was 154.9MB in the beginning and 154.8MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.59ms. Allocated memory is still 334.5MB. Free memory was 296.1MB in the beginning and 283.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.32ms. Allocated memory is still 334.5MB. Free memory was 283.0MB in the beginning and 280.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.27ms. Allocated memory is still 334.5MB. Free memory was 280.9MB in the beginning and 278.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 499.48ms. Allocated memory is still 334.5MB. Free memory was 278.3MB in the beginning and 258.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 344409.00ms. Allocated memory was 334.5MB in the beginning and 910.2MB in the end (delta: 575.7MB). Free memory was 257.3MB in the beginning and 849.8MB in the end (delta: -592.5MB). Peak memory consumption was 511.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 344.3s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 901 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 945 IncrementalHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 226 mSDtfsCounter, 945 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 985 GetRequests, 880 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 38.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=4, InterpolantAutomatonStates: 77, 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, 7 MinimizatonAttempts, 79 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 73 PreInvPairs, 84 NumberOfFragments, 599 HoareAnnotationTreeSize, 73 FormulaSimplifications, 15462 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FormulaSimplificationsInter, 3958 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 299.5s InterpolantComputationTime, 668 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 777 ConstructedInterpolants, 25 QuantifiedInterpolants, 6092 SizeOfPredicates, 99 NumberOfNonLiveVariables, 1224 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 2490/2564 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 88]: Loop Invariant Derived loop invariant: (((((((0 == ((last_1_var_1_11 + 16) % 4294967296)) && (0 == ((16 + var_1_11) % 4294967296))) && (k_loop == 0)) && (var_1_1 == 8)) && (var_1_8 == 64)) && (last_1_var_1_8 == 64)) || (k_loop == 1)) RESULT: Ultimate proved your program to be correct! [2023-12-24 00:21:34,670 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 00:21:34,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...