/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_operatoramount_amount10_file-79.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 14:38:27,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 14:38:28,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 14:38:28,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 14:38:28,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 14:38:28,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 14:38:28,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 14:38:28,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 14:38:28,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 14:38:28,075 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 14:38:28,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 14:38:28,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 14:38:28,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 14:38:28,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 14:38:28,077 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 14:38:28,078 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 14:38:28,078 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 14:38:28,078 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 14:38:28,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 14:38:28,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 14:38:28,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 14:38:28,079 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 14:38:28,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 14:38:28,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 14:38:28,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 14:38:28,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 14:38:28,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 14:38:28,080 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 14:38:28,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 14:38:28,080 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 14:38:28,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 14:38:28,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 14:38:28,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 14:38:28,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 14:38:28,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:38:28,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 14:38:28,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 14:38:28,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 14:38:28,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 14:38:28,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 14:38:28,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 14:38:28,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 14:38:28,082 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 14:38:28,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 14:38:28,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 14:38:28,083 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 14:38:28,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 14:38:28,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 14:38:28,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 14:38:28,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 14:38:28,259 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 14:38:28,259 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 14:38:28,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-12-16 14:38:29,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 14:38:29,499 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 14:38:29,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-79.i [2023-12-16 14:38:29,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6b7e4d0/9e2903a2dd49460194801c7852ed639e/FLAG31abaa7ea [2023-12-16 14:38:29,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6b7e4d0/9e2903a2dd49460194801c7852ed639e [2023-12-16 14:38:29,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 14:38:29,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 14:38:29,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 14:38:29,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 14:38:29,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 14:38:29,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77862ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29, skipping insertion in model container [2023-12-16 14:38:29,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 14:38:29,649 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_operatoramount_amount10_file-79.i[915,928] [2023-12-16 14:38:29,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:38:29,675 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 14:38:29,683 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_operatoramount_amount10_file-79.i[915,928] [2023-12-16 14:38:29,691 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:38:29,703 INFO L206 MainTranslator]: Completed translation [2023-12-16 14:38:29,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29 WrapperNode [2023-12-16 14:38:29,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 14:38:29,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 14:38:29,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 14:38:29,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 14:38:29,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,734 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2023-12-16 14:38:29,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 14:38:29,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 14:38:29,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 14:38:29,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 14:38:29,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 14:38:29,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 14:38:29,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 14:38:29,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 14:38:29,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 14:38:29,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (1/1) ... [2023-12-16 14:38:29,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:38:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 14:38:29,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 14:38:29,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 14:38:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 14:38:29,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 14:38:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 14:38:29,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 14:38:29,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 14:38:29,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 14:38:29,887 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 14:38:29,890 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 14:38:30,198 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 14:38:30,232 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 14:38:30,233 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 14:38:30,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:38:30 BoogieIcfgContainer [2023-12-16 14:38:30,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 14:38:30,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 14:38:30,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 14:38:30,238 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 14:38:30,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:38:29" (1/3) ... [2023-12-16 14:38:30,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17447990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:38:30, skipping insertion in model container [2023-12-16 14:38:30,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:29" (2/3) ... [2023-12-16 14:38:30,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17447990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:38:30, skipping insertion in model container [2023-12-16 14:38:30,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:38:30" (3/3) ... [2023-12-16 14:38:30,240 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-79.i [2023-12-16 14:38:30,254 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 14:38:30,255 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 14:38:30,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 14:38:30,299 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;@16a525b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 14:38:30,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 14:38:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:38:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 14:38:30,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:38:30,318 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:38:30,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:38:30,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:38:30,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1845538419, now seen corresponding path program 1 times [2023-12-16 14:38:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:38:30,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526636830] [2023-12-16 14:38:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:38:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:38:30,333 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:38:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 14:38:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:38:30,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 14:38:30,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:38:30,495 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-16 14:38:30,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:38:30,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:38:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526636830] [2023-12-16 14:38:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526636830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:38:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:38:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 14:38:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748628368] [2023-12-16 14:38:30,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:38:30,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 14:38:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:38:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 14:38:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:38:30,565 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:38:30,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:38:30,734 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2023-12-16 14:38:30,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 14:38:30,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 62 [2023-12-16 14:38:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:38:30,752 INFO L225 Difference]: With dead ends: 61 [2023-12-16 14:38:30,752 INFO L226 Difference]: Without dead ends: 30 [2023-12-16 14:38:30,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:38:30,757 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 14:38:30,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 14:38:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-16 14:38:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-16 14:38:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:38:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2023-12-16 14:38:30,787 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 62 [2023-12-16 14:38:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:38:30,788 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2023-12-16 14:38:30,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:38:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2023-12-16 14:38:30,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-16 14:38:30,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:38:30,792 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:38:30,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 14:38:30,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:30,998 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:38:30,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:38:31,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1031786121, now seen corresponding path program 1 times [2023-12-16 14:38:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:38:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429787186] [2023-12-16 14:38:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:38:31,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:38:31,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:38:31,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 14:38:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:38:31,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 14:38:31,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:38:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-16 14:38:35,163 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:38:35,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:38:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429787186] [2023-12-16 14:38:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429787186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:38:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:38:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 14:38:35,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435589224] [2023-12-16 14:38:35,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:38:35,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 14:38:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:38:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 14:38:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 14:38:35,165 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:38:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:38:36,560 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2023-12-16 14:38:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 14:38:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 62 [2023-12-16 14:38:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:38:36,566 INFO L225 Difference]: With dead ends: 51 [2023-12-16 14:38:36,567 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 14:38:36,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-12-16 14:38:36,569 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 14:38:36,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 88 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 14:38:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 14:38:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2023-12-16 14:38:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 14:38:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-12-16 14:38:36,606 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 62 [2023-12-16 14:38:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:38:36,607 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-12-16 14:38:36,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:38:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2023-12-16 14:38:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-16 14:38:36,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:38:36,609 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:38:36,618 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 (3)] Ended with exit code 0 [2023-12-16 14:38:36,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:36,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:38:36,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:38:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1906016461, now seen corresponding path program 1 times [2023-12-16 14:38:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:38:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782647917] [2023-12-16 14:38:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:38:36,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:36,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:38:36,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:38:36,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 14:38:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:38:36,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 14:38:36,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:38:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 14:38:39,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:38:39,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:38:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782647917] [2023-12-16 14:38:39,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782647917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:38:39,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:38:39,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 14:38:39,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212069143] [2023-12-16 14:38:39,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:38:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 14:38:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:38:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 14:38:39,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:38:39,443 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:38:40,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:38:40,147 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2023-12-16 14:38:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 14:38:40,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 63 [2023-12-16 14:38:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:38:40,150 INFO L225 Difference]: With dead ends: 58 [2023-12-16 14:38:40,150 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 14:38:40,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 14:38:40,151 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 14:38:40,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 158 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 14:38:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 14:38:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2023-12-16 14:38:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 14:38:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2023-12-16 14:38:40,157 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 63 [2023-12-16 14:38:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:38:40,158 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2023-12-16 14:38:40,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:38:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2023-12-16 14:38:40,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-16 14:38:40,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:38:40,159 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:38:40,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 14:38:40,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:40,364 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:38:40,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:38:40,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1052221900, now seen corresponding path program 1 times [2023-12-16 14:38:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:38:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488265406] [2023-12-16 14:38:40,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:38:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:38:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:38:40,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:38:40,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 14:38:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:38:40,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 14:38:40,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-16 14:39:02,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:02,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488265406] [2023-12-16 14:39:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488265406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:02,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:02,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 14:39:02,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475906165] [2023-12-16 14:39:02,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:02,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 14:39:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:02,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 14:39:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-16 14:39:02,622 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:39:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:10,900 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-12-16 14:39:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-16 14:39:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2023-12-16 14:39:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:10,901 INFO L225 Difference]: With dead ends: 72 [2023-12-16 14:39:10,902 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 14:39:10,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2023-12-16 14:39:10,903 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:10,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 114 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 14:39:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 14:39:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2023-12-16 14:39:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 14:39:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2023-12-16 14:39:10,908 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 64 [2023-12-16 14:39:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:10,909 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-12-16 14:39:10,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:39:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2023-12-16 14:39:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-16 14:39:10,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:10,910 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:10,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:11,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:39:11,116 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:11,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1052162318, now seen corresponding path program 1 times [2023-12-16 14:39:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469622701] [2023-12-16 14:39:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:11,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:39:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:11,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:39:11,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 14:39:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:11,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 14:39:11,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-16 14:39:11,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:39:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 14:39:14,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469622701] [2023-12-16 14:39:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469622701] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 14:39:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 14:39:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2023-12-16 14:39:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653023744] [2023-12-16 14:39:14,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:14,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 14:39:14,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 14:39:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-16 14:39:14,269 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:14,886 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-12-16 14:39:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 14:39:14,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 64 [2023-12-16 14:39:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:14,888 INFO L225 Difference]: With dead ends: 50 [2023-12-16 14:39:14,888 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 14:39:14,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2023-12-16 14:39:14,889 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:14,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 14:39:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 14:39:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 14:39:14,889 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-16 14:39:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 14:39:14,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-12-16 14:39:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:14,890 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 14:39:14,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 14:39:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 14:39:14,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 14:39:14,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 14:39:14,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:15,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:39:15,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 14:39:18,205 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 43) no Hoare annotation was computed. [2023-12-16 14:39:18,206 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_6~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:39:18,206 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 44 61) no Hoare annotation was computed. [2023-12-16 14:39:18,206 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-16 14:39:18,206 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,207 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,207 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 14:39:18,207 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 14:39:18,207 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 14:39:18,207 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 38) no Hoare annotation was computed. [2023-12-16 14:39:18,207 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 14:39:18,207 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-16 14:39:18,207 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,207 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,208 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 14:39:18,208 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse0)))))) [2023-12-16 14:39:18,208 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-12-16 14:39:18,208 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-12-16 14:39:18,208 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,208 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,208 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 14:39:18,209 INFO L895 garLoopResultBuilder]: At program point L71-2(lines 71 77) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,209 INFO L899 garLoopResultBuilder]: For program point L71-3(lines 71 77) no Hoare annotation was computed. [2023-12-16 14:39:18,209 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 42) no Hoare annotation was computed. [2023-12-16 14:39:18,209 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,209 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse4 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse2 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse0 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse1 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.leq ~var_1_6~0 .cse0) (fp.geq ~var_1_6~0 .cse1)) (and (fp.geq ~var_1_6~0 .cse2) (fp.leq ~var_1_6~0 .cse3))) (= currentRoundingMode roundNearestTiesToEven) (or (and (fp.leq ~var_1_7~0 .cse3) (fp.geq ~var_1_7~0 .cse2)) (and (fp.leq ~var_1_7~0 .cse0) (fp.geq ~var_1_7~0 .cse1)))))) [2023-12-16 14:39:18,209 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-12-16 14:39:18,209 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2023-12-16 14:39:18,209 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 14:39:18,209 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 14:39:18,210 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 14:39:18,210 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 14:39:18,213 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 14:39:18,214 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 14:39:18,224 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:39:18,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:39:18 BoogieIcfgContainer [2023-12-16 14:39:18,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 14:39:18,226 INFO L158 Benchmark]: Toolchain (without parser) took 48705.21ms. Allocated memory was 310.4MB in the beginning and 670.0MB in the end (delta: 359.7MB). Free memory was 257.4MB in the beginning and 418.9MB in the end (delta: -161.5MB). Peak memory consumption was 198.9MB. Max. memory is 8.0GB. [2023-12-16 14:39:18,226 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 233.8MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 14:39:18,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.83ms. Allocated memory is still 310.4MB. Free memory was 257.1MB in the beginning and 245.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 14:39:18,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.27ms. Allocated memory is still 310.4MB. Free memory was 245.0MB in the beginning and 243.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:39:18,227 INFO L158 Benchmark]: Boogie Preprocessor took 28.15ms. Allocated memory is still 310.4MB. Free memory was 243.1MB in the beginning and 241.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:39:18,227 INFO L158 Benchmark]: RCFGBuilder took 469.67ms. Allocated memory is still 310.4MB. Free memory was 241.0MB in the beginning and 226.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 14:39:18,227 INFO L158 Benchmark]: TraceAbstraction took 47990.75ms. Allocated memory was 310.4MB in the beginning and 670.0MB in the end (delta: 359.7MB). Free memory was 225.6MB in the beginning and 418.9MB in the end (delta: -193.2MB). Peak memory consumption was 167.5MB. Max. memory is 8.0GB. [2023-12-16 14:39:18,229 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.15ms. Allocated memory is still 233.8MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.83ms. Allocated memory is still 310.4MB. Free memory was 257.1MB in the beginning and 245.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.27ms. Allocated memory is still 310.4MB. Free memory was 245.0MB in the beginning and 243.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.15ms. Allocated memory is still 310.4MB. Free memory was 243.1MB in the beginning and 241.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 469.67ms. Allocated memory is still 310.4MB. Free memory was 241.0MB in the beginning and 226.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 47990.75ms. Allocated memory was 310.4MB in the beginning and 670.0MB in the end (delta: 359.7MB). Free memory was 225.6MB in the beginning and 418.9MB in the end (delta: -193.2MB). Peak memory consumption was 167.5MB. 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 * 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.9s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 608 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 173 mSDtfsCounter, 608 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 33 PreInvPairs, 48 NumberOfFragments, 705 HoareAnnotationTreeSize, 33 FormulaSimplifications, 4893 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 3310 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1726 SizeOfPredicates, 60 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1059/1080 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: 71]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-16 14:39:18,325 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 0 Received shutdown request...