/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_floatingpointinfluence_has-floats_file-64.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 18:58:14,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 18:58:14,082 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-23 18:58:14,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 18:58:14,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 18:58:14,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 18:58:14,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 18:58:14,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 18:58:14,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 18:58:14,131 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 18:58:14,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 18:58:14,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 18:58:14,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 18:58:14,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 18:58:14,133 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 18:58:14,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 18:58:14,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 18:58:14,134 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 18:58:14,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 18:58:14,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 18:58:14,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 18:58:14,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 18:58:14,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 18:58:14,136 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 18:58:14,136 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 18:58:14,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 18:58:14,136 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 18:58:14,136 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 18:58:14,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 18:58:14,137 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 18:58:14,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 18:58:14,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 18:58:14,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 18:58:14,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 18:58:14,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 18:58:14,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 18:58:14,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 18:58:14,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 18:58:14,139 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 18:58:14,139 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 18:58:14,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 18:58:14,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 18:58:14,140 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 18:58:14,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 18:58:14,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 18:58:14,141 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 18:58:14,141 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-23 18:58:14,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 18:58:14,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 18:58:14,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 18:58:14,375 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 18:58:14,375 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 18:58:14,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2023-12-23 18:58:15,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 18:58:15,748 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 18:58:15,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2023-12-23 18:58:15,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b6275a5/b1ec2340cbe84a7e8b2dcc4c1d43f7c6/FLAGda83fc794 [2023-12-23 18:58:15,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95b6275a5/b1ec2340cbe84a7e8b2dcc4c1d43f7c6 [2023-12-23 18:58:15,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 18:58:15,769 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 18:58:15,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 18:58:15,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 18:58:15,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 18:58:15,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:58:15" (1/1) ... [2023-12-23 18:58:15,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f4aac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:15, skipping insertion in model container [2023-12-23 18:58:15,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:58:15" (1/1) ... [2023-12-23 18:58:15,798 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 18:58:15,939 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_floatingpointinfluence_has-floats_file-64.i[917,930] [2023-12-23 18:58:15,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 18:58:16,002 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 18:58:16,010 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_floatingpointinfluence_has-floats_file-64.i[917,930] [2023-12-23 18:58:16,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 18:58:16,042 INFO L206 MainTranslator]: Completed translation [2023-12-23 18:58:16,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16 WrapperNode [2023-12-23 18:58:16,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 18:58:16,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 18:58:16,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 18:58:16,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 18:58:16,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,084 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2023-12-23 18:58:16,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 18:58:16,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 18:58:16,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 18:58:16,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 18:58:16,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,129 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-23 18:58:16,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,136 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 18:58:16,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 18:58:16,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 18:58:16,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 18:58:16,146 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (1/1) ... [2023-12-23 18:58:16,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 18:58:16,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 18:58:16,183 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-23 18:58:16,185 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-23 18:58:16,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 18:58:16,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 18:58:16,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 18:58:16,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 18:58:16,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 18:58:16,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 18:58:16,265 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 18:58:16,267 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 18:58:17,825 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 18:58:17,867 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 18:58:17,867 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 18:58:17,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:58:17 BoogieIcfgContainer [2023-12-23 18:58:17,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 18:58:17,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 18:58:17,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 18:58:17,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 18:58:17,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:58:15" (1/3) ... [2023-12-23 18:58:17,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abe2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:58:17, skipping insertion in model container [2023-12-23 18:58:17,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:58:16" (2/3) ... [2023-12-23 18:58:17,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34abe2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:58:17, skipping insertion in model container [2023-12-23 18:58:17,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:58:17" (3/3) ... [2023-12-23 18:58:17,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-64.i [2023-12-23 18:58:17,889 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 18:58:17,889 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 18:58:17,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 18:58:17,959 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;@3b438584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 18:58:17,959 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 18:58:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 18:58:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 18:58:17,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:58:17,973 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:58:17,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:58:17,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:58:17,978 INFO L85 PathProgramCache]: Analyzing trace with hash -757313963, now seen corresponding path program 1 times [2023-12-23 18:58:17,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:58:17,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667522355] [2023-12-23 18:58:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:58:17,994 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-23 18:58:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:58:17,998 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-23 18:58:18,040 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-23 18:58:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:58:18,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 18:58:18,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:58:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2023-12-23 18:58:18,529 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 18:58:18,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 18:58:18,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667522355] [2023-12-23 18:58:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667522355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 18:58:18,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 18:58:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 18:58:18,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773277119] [2023-12-23 18:58:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 18:58:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 18:58:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 18:58:18,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 18:58:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 18:58:18,572 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-23 18:58:20,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 18:58:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 18:58:20,333 INFO L93 Difference]: Finished difference Result 103 states and 184 transitions. [2023-12-23 18:58:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 18:58:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2023-12-23 18:58:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 18:58:20,377 INFO L225 Difference]: With dead ends: 103 [2023-12-23 18:58:20,377 INFO L226 Difference]: Without dead ends: 51 [2023-12-23 18:58:20,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-23 18:58:20,382 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-23 18:58:20,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-23 18:58:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-23 18:58:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-23 18:58:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-23 18:58:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2023-12-23 18:58:20,429 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 121 [2023-12-23 18:58:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 18:58:20,429 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2023-12-23 18:58:20,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-23 18:58:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2023-12-23 18:58:20,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-23 18:58:20,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:58:20,436 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:58:20,448 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-23 18:58:20,639 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-23 18:58:20,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:58:20,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:58:20,640 INFO L85 PathProgramCache]: Analyzing trace with hash -395390557, now seen corresponding path program 1 times [2023-12-23 18:58:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:58:20,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905885972] [2023-12-23 18:58:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:58:20,642 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-23 18:58:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:58:20,643 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-23 18:58:20,648 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-23 18:58:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:58:21,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-23 18:58:21,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:59:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-23 18:59:15,796 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 18:59:15,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 18:59:15,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905885972] [2023-12-23 18:59:15,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905885972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 18:59:15,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 18:59:15,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-23 18:59:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393012733] [2023-12-23 18:59:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 18:59:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-23 18:59:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 18:59:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-23 18:59:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-23 18:59:15,800 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 18:59:17,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 18:59:21,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 18:59:23,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 18:59:26,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 18:59:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 18:59:26,245 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2023-12-23 18:59:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-23 18:59:26,293 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-12-23 18:59:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 18:59:26,295 INFO L225 Difference]: With dead ends: 169 [2023-12-23 18:59:26,295 INFO L226 Difference]: Without dead ends: 119 [2023-12-23 18:59:26,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-23 18:59:26,297 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-12-23 18:59:26,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 350 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-12-23 18:59:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-23 18:59:26,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2023-12-23 18:59:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-23 18:59:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2023-12-23 18:59:26,320 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 121 [2023-12-23 18:59:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 18:59:26,320 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2023-12-23 18:59:26,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 18:59:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2023-12-23 18:59:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-23 18:59:26,322 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:59:26,323 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:59:26,337 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-23 18:59:26,531 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-23 18:59:26,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:59:26,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:59:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 618059733, now seen corresponding path program 1 times [2023-12-23 18:59:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:59:26,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409503956] [2023-12-23 18:59:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:59:26,533 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-23 18:59:26,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:59:26,534 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-23 18:59:26,546 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-23 18:59:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:59:26,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 18:59:26,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:59:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-23 18:59:27,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 18:59:27,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 18:59:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409503956] [2023-12-23 18:59:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409503956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 18:59:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 18:59:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 18:59:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899703633] [2023-12-23 18:59:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 18:59:27,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 18:59:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 18:59:27,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 18:59:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 18:59:27,488 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 18:59:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 18:59:28,490 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2023-12-23 18:59:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 18:59:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2023-12-23 18:59:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 18:59:28,534 INFO L225 Difference]: With dead ends: 148 [2023-12-23 18:59:28,535 INFO L226 Difference]: Without dead ends: 95 [2023-12-23 18:59:28,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 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-23 18:59:28,536 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-23 18:59:28,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-23 18:59:28,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-23 18:59:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-12-23 18:59:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-23 18:59:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-23 18:59:28,551 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 122 [2023-12-23 18:59:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 18:59:28,552 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-23 18:59:28,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 18:59:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-23 18:59:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-23 18:59:28,553 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:59:28,554 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 18:59:28,566 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-23 18:59:28,758 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-23 18:59:28,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:59:28,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:59:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash -446278544, now seen corresponding path program 1 times [2023-12-23 18:59:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:59:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670280341] [2023-12-23 18:59:28,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:59:28,760 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-23 18:59:28,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:59:28,761 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-23 18:59:28,762 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-23 18:59:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:59:29,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 18:59:29,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:00:42,089 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2023-12-23 19:00:42,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:01:59,321 WARN L293 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:02:09,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:02:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670280341] [2023-12-23 19:02:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670280341] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 19:02:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136761748] [2023-12-23 19:02:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:02:09,654 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 19:02:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 19:02:09,685 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-23 19:02:09,686 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-23 19:02:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:02:10,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-23 19:02:10,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:04:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2023-12-23 19:04:11,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:06:10,773 WARN L293 SmtUtils]: Spent 45.98s on a formula simplification. DAG size of input: 170 DAG size of output: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 19:07:00,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [136761748] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 19:07:00,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 19:07:00,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2023-12-23 19:07:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462679473] [2023-12-23 19:07:00,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 19:07:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-23 19:07:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:07:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-23 19:07:00,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2023-12-23 19:07:00,231 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2023-12-23 19:07:19,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:07:23,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:07:25,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:07:28,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:07:28,766 INFO L93 Difference]: Finished difference Result 150 states and 204 transitions. [2023-12-23 19:07:28,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-23 19:07:28,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 122 [2023-12-23 19:07:28,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:07:28,770 INFO L225 Difference]: With dead ends: 150 [2023-12-23 19:07:28,770 INFO L226 Difference]: Without dead ends: 148 [2023-12-23 19:07:28,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 125.0s TimeCoverageRelationStatistics Valid=385, Invalid=1337, Unknown=0, NotChecked=0, Total=1722 [2023-12-23 19:07:28,772 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 97 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-12-23 19:07:28,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 258 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2023-12-23 19:07:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-23 19:07:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 130. [2023-12-23 19:07:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 75 states have internal predecessors, (82), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-23 19:07:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2023-12-23 19:07:28,810 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 122 [2023-12-23 19:07:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:07:28,811 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2023-12-23 19:07:28,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2023-12-23 19:07:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2023-12-23 19:07:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-23 19:07:28,815 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:07:28,815 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 19:07:28,832 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-23 19:07:29,023 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-23 19:07:29,216 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-23 19:07:29,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:07:29,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:07:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -917094740, now seen corresponding path program 1 times [2023-12-23 19:07:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:07:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614704993] [2023-12-23 19:07:29,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:07:29,217 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-23 19:07:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:07:29,218 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-23 19:07:29,219 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-23 19:07:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:07:29,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-23 19:07:29,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:07:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 340 proven. 87 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2023-12-23 19:07:30,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:07:35,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:07:35,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614704993] [2023-12-23 19:07:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614704993] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 19:07:35,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1123872826] [2023-12-23 19:07:35,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:07:35,689 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 19:07:35,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 19:07:35,690 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-23 19:07:35,695 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-23 19:07:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:07:36,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 19:07:36,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:08:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-23 19:08:40,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 19:08:40,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1123872826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 19:08:40,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 19:08:40,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-12-23 19:08:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183155163] [2023-12-23 19:08:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 19:08:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 19:08:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:08:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 19:08:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-23 19:08:40,803 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 19:08:49,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:08:55,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:08:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:08:58,981 INFO L93 Difference]: Finished difference Result 151 states and 205 transitions. [2023-12-23 19:08:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-23 19:08:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2023-12-23 19:08:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:08:58,984 INFO L225 Difference]: With dead ends: 151 [2023-12-23 19:08:58,984 INFO L226 Difference]: Without dead ends: 149 [2023-12-23 19:08:58,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-23 19:08:58,986 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 33 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2023-12-23 19:08:58,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 256 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2023-12-23 19:08:58,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-12-23 19:08:59,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2023-12-23 19:08:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 75 states have internal predecessors, (82), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-23 19:08:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 182 transitions. [2023-12-23 19:08:59,007 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 182 transitions. Word has length 123 [2023-12-23 19:08:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:08:59,007 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 182 transitions. [2023-12-23 19:08:59,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-23 19:08:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 182 transitions. [2023-12-23 19:08:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2023-12-23 19:08:59,011 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 19:08:59,011 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 40, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-12-23 19:08:59,033 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-23 19:08:59,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-23 19:08:59,430 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-23 19:08:59,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 19:08:59,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 19:08:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1607098850, now seen corresponding path program 1 times [2023-12-23 19:08:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 19:08:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457684851] [2023-12-23 19:08:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 19:08:59,432 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-23 19:08:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 19:08:59,434 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-23 19:08:59,436 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-23 19:08:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 19:08:59,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-23 19:08:59,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 19:09:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 1792 proven. 51 refuted. 0 times theorem prover too weak. 1316 trivial. 0 not checked. [2023-12-23 19:09:00,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 19:09:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3159 backedges. 39 proven. 111 refuted. 0 times theorem prover too weak. 3009 trivial. 0 not checked. [2023-12-23 19:09:01,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 19:09:01,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457684851] [2023-12-23 19:09:01,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457684851] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 19:09:01,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 19:09:01,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2023-12-23 19:09:01,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967228454] [2023-12-23 19:09:01,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 19:09:01,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-23 19:09:01,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 19:09:01,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-23 19:09:01,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-23 19:09:01,399 INFO L87 Difference]: Start difference. First operand 130 states and 182 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (80), 4 states have call predecessors, (80), 6 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2023-12-23 19:09:04,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:09:06,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 19:09:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 19:09:06,997 INFO L93 Difference]: Finished difference Result 253 states and 342 transitions. [2023-12-23 19:09:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-23 19:09:06,998 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (80), 4 states have call predecessors, (80), 6 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 241 [2023-12-23 19:09:06,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 19:09:06,999 INFO L225 Difference]: With dead ends: 253 [2023-12-23 19:09:06,999 INFO L226 Difference]: Without dead ends: 0 [2023-12-23 19:09:07,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-12-23 19:09:07,002 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 133 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-23 19:09:07,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 212 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-23 19:09:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-23 19:09:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-23 19:09:07,003 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-23 19:09:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-23 19:09:07,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2023-12-23 19:09:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 19:09:07,003 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-23 19:09:07,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (80), 4 states have call predecessors, (80), 6 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2023-12-23 19:09:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-23 19:09:07,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-23 19:09:07,007 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 19:09:07,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-23 19:09:07,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 19:09:07,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-23 19:09:16,649 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,649 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-12-23 19:09:16,649 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 52 54) no Hoare annotation was computed. [2023-12-23 19:09:16,649 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L102(lines 71 103) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L895 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,650 INFO L895 garLoopResultBuilder]: At program point L94-1(line 94) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 47) no Hoare annotation was computed. [2023-12-23 19:09:16,650 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,651 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,651 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,651 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (and (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse0 (bvadd ~var_1_3~0 (bvneg .cse0))))) [2023-12-23 19:09:16,652 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-23 19:09:16,652 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2023-12-23 19:09:16,652 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 40 70) no Hoare annotation was computed. [2023-12-23 19:09:16,652 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-23 19:09:16,652 INFO L895 garLoopResultBuilder]: At program point L114-2(lines 114 120) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,652 INFO L899 garLoopResultBuilder]: For program point L114-3(lines 114 120) no Hoare annotation was computed. [2023-12-23 19:09:16,652 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:09:16,652 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:09:16,653 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 70) no Hoare annotation was computed. [2023-12-23 19:09:16,653 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,653 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 61) no Hoare annotation was computed. [2023-12-23 19:09:16,653 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-23 19:09:16,653 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-23 19:09:16,653 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-12-23 19:09:16,653 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2023-12-23 19:09:16,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-23 19:09:16,654 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,654 INFO L895 garLoopResultBuilder]: At program point L91-1(line 91) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,654 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,654 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-23 19:09:16,654 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2023-12-23 19:09:16,655 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-23 19:09:16,655 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,655 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-12-23 19:09:16,655 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 40 70) no Hoare annotation was computed. [2023-12-23 19:09:16,655 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,655 INFO L895 garLoopResultBuilder]: At program point L101-1(line 101) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode .cse1))) (and (fp.geq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_9~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))))) (= ~var_1_10~0 (_ bv0 8)) (= currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ zero_extend 24) ~last_1_var_1_16~0))) (bvule .cse2 (bvadd ~var_1_3~0 (bvneg .cse2))))) [2023-12-23 19:09:16,655 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-23 19:09:16,656 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-23 19:09:16,656 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-23 19:09:16,656 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-23 19:09:16,659 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-23 19:09:16,660 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 19:09:16,670 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-23 19:09:16,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 07:09:16 BoogieIcfgContainer [2023-12-23 19:09:16,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 19:09:16,672 INFO L158 Benchmark]: Toolchain (without parser) took 660903.37ms. Allocated memory was 248.5MB in the beginning and 926.9MB in the end (delta: 678.4MB). Free memory was 203.3MB in the beginning and 501.1MB in the end (delta: -297.7MB). Peak memory consumption was 381.0MB. Max. memory is 8.0GB. [2023-12-23 19:09:16,672 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 194.0MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 19:09:16,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.33ms. Allocated memory is still 248.5MB. Free memory was 203.3MB in the beginning and 189.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-23 19:09:16,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.05ms. Allocated memory is still 248.5MB. Free memory was 189.7MB in the beginning and 187.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:09:16,673 INFO L158 Benchmark]: Boogie Preprocessor took 59.22ms. Allocated memory is still 248.5MB. Free memory was 187.6MB in the beginning and 184.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 19:09:16,673 INFO L158 Benchmark]: RCFGBuilder took 1722.28ms. Allocated memory is still 248.5MB. Free memory was 184.7MB in the beginning and 166.6MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-23 19:09:16,673 INFO L158 Benchmark]: TraceAbstraction took 658801.88ms. Allocated memory was 248.5MB in the beginning and 926.9MB in the end (delta: 678.4MB). Free memory was 165.9MB in the beginning and 501.1MB in the end (delta: -335.2MB). Peak memory consumption was 344.3MB. Max. memory is 8.0GB. [2023-12-23 19:09:16,675 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.16ms. Allocated memory is still 194.0MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.33ms. Allocated memory is still 248.5MB. Free memory was 203.3MB in the beginning and 189.7MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.05ms. Allocated memory is still 248.5MB. Free memory was 189.7MB in the beginning and 187.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.22ms. Allocated memory is still 248.5MB. Free memory was 187.6MB in the beginning and 184.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1722.28ms. Allocated memory is still 248.5MB. Free memory was 184.7MB in the beginning and 166.6MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 658801.88ms. Allocated memory was 248.5MB in the beginning and 926.9MB in the end (delta: 678.4MB). Free memory was 165.9MB in the beginning and 501.1MB in the end (delta: -335.2MB). Peak memory consumption was 344.3MB. 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, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 658.7s, OverallIterations: 6, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 65.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 37.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 1218 SdHoareTripleChecker+Invalid, 36.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1298 IncrementalHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 379 mSDtfsCounter, 1298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1400 GetRequests, 1306 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 151.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 61 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 165 PreInvPairs, 224 NumberOfFragments, 952 HoareAnnotationTreeSize, 165 FormulaSimplifications, 604 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FormulaSimplificationsInter, 4306 FormulaSimplificationTreeSizeReductionInter, 9.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 577.9s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1327 ConstructedInterpolants, 0 QuantifiedInterpolants, 7566 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1735 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 11335/11638 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: 114]: Loop Invariant Derived loop invariant: ((var_1_10 == 0) && (last_1_var_1_16 <= ((var_1_3 + -(last_1_var_1_16)) % 4294967296))) RESULT: Ultimate proved your program to be correct! [2023-12-23 19:09:16,891 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-23 19:09:16,948 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...