/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 02:03:08,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 02:03:08,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 02:03:08,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 02:03:08,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 02:03:08,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 02:03:08,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 02:03:08,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 02:03:08,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 02:03:08,288 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 02:03:08,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 02:03:08,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 02:03:08,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 02:03:08,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 02:03:08,289 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 02:03:08,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 02:03:08,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 02:03:08,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 02:03:08,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 02:03:08,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 02:03:08,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 02:03:08,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 02:03:08,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 02:03:08,291 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 02:03:08,291 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 02:03:08,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 02:03:08,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 02:03:08,292 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 02:03:08,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 02:03:08,292 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 02:03:08,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 02:03:08,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 02:03:08,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 02:03:08,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 02:03:08,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:03:08,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 02:03:08,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 02:03:08,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 02:03:08,293 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 02:03:08,294 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 02:03:08,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 02:03:08,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 02:03:08,294 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 02:03:08,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 02:03:08,295 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 02:03:08,295 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 02:03:08,295 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 02:03:08,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 02:03:08,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 02:03:08,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 02:03:08,482 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 02:03:08,483 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 02:03:08,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-62.i [2023-12-24 02:03:09,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 02:03:09,742 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 02:03:09,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-62.i [2023-12-24 02:03:09,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380c144ed/82c96cdda05d4f8ab2612f3935ba29bd/FLAG96d5e8e3e [2023-12-24 02:03:09,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380c144ed/82c96cdda05d4f8ab2612f3935ba29bd [2023-12-24 02:03:09,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 02:03:09,766 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 02:03:09,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 02:03:09,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 02:03:09,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 02:03:09,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:09,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bd966a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09, skipping insertion in model container [2023-12-24 02:03:09,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:09,790 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 02:03:09,903 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-62.i[915,928] [2023-12-24 02:03:09,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:03:09,950 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 02:03:09,963 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-62.i[915,928] [2023-12-24 02:03:09,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:03:09,987 INFO L206 MainTranslator]: Completed translation [2023-12-24 02:03:09,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09 WrapperNode [2023-12-24 02:03:09,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 02:03:09,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 02:03:09,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 02:03:09,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 02:03:09,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,016 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2023-12-24 02:03:10,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 02:03:10,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 02:03:10,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 02:03:10,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 02:03:10,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 02:03:10,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,059 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 02:03:10,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 02:03:10,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 02:03:10,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 02:03:10,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (1/1) ... [2023-12-24 02:03:10,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:03:10,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 02:03:10,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 02:03:10,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 02:03:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 02:03:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 02:03:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 02:03:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 02:03:10,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 02:03:10,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 02:03:10,200 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 02:03:10,202 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 02:03:11,834 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 02:03:11,868 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 02:03:11,869 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 02:03:11,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:03:11 BoogieIcfgContainer [2023-12-24 02:03:11,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 02:03:11,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 02:03:11,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 02:03:11,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 02:03:11,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:03:09" (1/3) ... [2023-12-24 02:03:11,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ec5b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:03:11, skipping insertion in model container [2023-12-24 02:03:11,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:03:09" (2/3) ... [2023-12-24 02:03:11,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ec5b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:03:11, skipping insertion in model container [2023-12-24 02:03:11,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:03:11" (3/3) ... [2023-12-24 02:03:11,874 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-62.i [2023-12-24 02:03:11,885 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 02:03:11,885 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 02:03:11,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 02:03:11,915 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;@70acaaaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 02:03:11,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 02:03:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 02:03:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-24 02:03:11,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:03:11,925 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:03:11,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:03:11,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:03:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2105262673, now seen corresponding path program 1 times [2023-12-24 02:03:11,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:03:11,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688466295] [2023-12-24 02:03:11,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:03:11,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:03:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:03:11,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:03:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 02:03:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:03:12,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 02:03:12,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:03:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2023-12-24 02:03:12,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:03:12,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:03:12,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688466295] [2023-12-24 02:03:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688466295] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:03:12,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:03:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 02:03:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866470518] [2023-12-24 02:03:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:03:12,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 02:03:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:03:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 02:03:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:03:12,192 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 02:03:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:03:13,037 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2023-12-24 02:03:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 02:03:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2023-12-24 02:03:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:03:13,065 INFO L225 Difference]: With dead ends: 77 [2023-12-24 02:03:13,066 INFO L226 Difference]: Without dead ends: 38 [2023-12-24 02:03:13,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:03:13,074 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 02:03:13,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 02:03:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-24 02:03:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-24 02:03:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 02:03:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2023-12-24 02:03:13,101 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 87 [2023-12-24 02:03:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:03:13,101 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2023-12-24 02:03:13,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-24 02:03:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2023-12-24 02:03:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-24 02:03:13,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:03:13,104 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:03:13,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 02:03:13,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:03:13,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:03:13,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:03:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -249509111, now seen corresponding path program 1 times [2023-12-24 02:03:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:03:13,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493538733] [2023-12-24 02:03:13,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:03:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:03:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:03:13,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:03:13,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 02:03:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:03:13,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 02:03:13,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:03:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-24 02:03:47,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:05:22,972 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse38 ((_ zero_extend 24) c_~var_1_5~0)) (.cse7 (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (.cse36 ((_ sign_extend 24) c_~var_1_2~0)) (.cse37 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse9 (= c_~var_1_3~0 (_ bv0 8))) (.cse18 (bvslt .cse37 (_ bv0 32))) (.cse5 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse23 (bvslt .cse37 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0)))) (.cse4 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse6 (= (_ bv4 32) .cse36)) (.cse32 (not .cse7)) (.cse33 (forall ((~var_1_9~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_9~0) .cse38)))) (let ((.cse29 (and .cse4 .cse6 .cse32 .cse33)) (.cse2 (= .cse38 (_ bv15 32))) (.cse25 (or .cse5 .cse23)) (.cse24 (not .cse5)) (.cse28 (= .cse36 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse37))))) (.cse17 (not .cse18)) (.cse30 (= .cse36 ((_ sign_extend 24) ((_ extract 7 0) .cse37)))) (.cse8 (not .cse23)) (.cse31 (not .cse9))) (let ((.cse21 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse11 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse1 (or (and (or (and .cse4 .cse5 .cse28 .cse32 .cse33 .cse8) .cse17) (or .cse18 (and .cse4 .cse5 .cse32 .cse30 .cse33 .cse8))) .cse31)) (.cse3 (or (and (or .cse18 (and .cse4 .cse5 .cse7 .cse30 .cse8)) (or (and .cse4 .cse5 .cse28 .cse7 .cse8) .cse17)) .cse31)) (.cse14 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse12 (or (and (or (and (or .cse5 (and .cse4 .cse28 .cse32 .cse33 .cse23)) (or .cse24 (let ((.cse34 (and .cse28 .cse32 .cse33))) (and .cse4 (or .cse8 .cse34) (or .cse23 .cse34))))) .cse17) (or .cse18 (and (or .cse5 (and .cse4 .cse32 .cse30 .cse33 .cse23)) (or (let ((.cse35 (and .cse32 .cse30 .cse33))) (and .cse4 (or .cse8 .cse35) (or .cse35 .cse23))) .cse24)))) .cse31)) (.cse13 (or (and (or .cse18 (and .cse7 .cse30 .cse25)) (or (and .cse28 .cse7 .cse25) .cse17)) .cse31)) (.cse10 (not .cse2)) (.cse19 (or (not .cse30) .cse29)) (.cse20 (or .cse29 .cse30)) (.cse15 (or .cse28 .cse29)) (.cse16 (or (not .cse28) .cse29))) (and (or (let ((.cse0 (or (and (or (and .cse5 .cse15 .cse8 .cse16) .cse17) (or .cse18 (and .cse5 .cse19 .cse20 .cse8))) .cse9))) (and (or (and (or (and .cse0 .cse1) .cse2) (or (and .cse3 (or (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9)) .cse10)) .cse11) (or (and (or (and .cse12 .cse0) .cse2) (or (and .cse4 (or (and .cse5 .cse6 .cse7 .cse8) .cse9) .cse13) .cse10)) .cse14))) (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse21) c_~var_1_14~0)))) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse21) c_~var_1_14~0)))) (let ((.cse22 (or (and (or .cse18 (and (or .cse5 (and .cse19 .cse20 .cse23)) (or (let ((.cse26 (and .cse19 .cse20))) (and (or .cse23 .cse26) (or .cse8 .cse26))) .cse24))) (or (and (or .cse5 (and .cse15 .cse16 .cse23)) (or (let ((.cse27 (and .cse15 .cse16))) (and (or .cse27 .cse23) (or .cse27 .cse8))) .cse24)) .cse17)) .cse9))) (and (or .cse11 (and (or .cse2 (and .cse22 .cse1)) (or (and .cse3 (or (and (or .cse5 (and .cse4 .cse6 .cse7 .cse23)) (or .cse24 (and .cse4 .cse6 .cse7)) (or .cse18 (and .cse4 .cse6 .cse7 .cse25))) .cse9)) .cse10))) (or .cse14 (and (or (and .cse12 .cse22) .cse2) (or (and .cse4 (or (and .cse6 .cse7 .cse25) .cse9) .cse13) .cse10))))))))))) is different from true [2023-12-24 02:05:41,912 WARN L876 $PredicateComparison]: unable to prove that (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse18 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse3 (= c_~var_1_3~0 (_ bv0 8))) (.cse11 (bvslt .cse18 (_ bv0 32))) (.cse16 ((_ sign_extend 24) c_~var_1_2~0)) (.cse9 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse17 (bvslt .cse18 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse2 (or .cse9 .cse17)) (.cse12 (= .cse16 ((_ sign_extend 24) ((_ extract 7 0) .cse18)))) (.cse0 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse13 (= .cse16 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse18))))) (.cse10 (not .cse17)) (.cse14 (not .cse11)) (.cse15 (not .cse3))) (let ((.cse6 (or (and (or .cse11 (and .cse0 .cse9 .cse12 .cse10)) (or (and .cse0 .cse9 .cse13 .cse10) .cse14)) .cse15)) (.cse7 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse5 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse1 (= (_ bv4 32) .cse16)) (.cse4 (or (and (or .cse11 (and .cse12 .cse2)) (or (and .cse13 .cse2) .cse14)) .cse15)) (.cse8 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0)))) (and (or (and (or (and .cse0 (or (and .cse1 .cse2) .cse3) .cse4) .cse5) (or (and .cse6 (or (and .cse0 .cse1 .cse2) .cse3)) .cse7)) (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse8) c_~var_1_14~0))))) (or (and (or (and .cse6 (or (and .cse0 .cse9 .cse1 .cse10) .cse3)) .cse7) (or .cse5 (and .cse0 (or (and .cse9 .cse1 .cse10) .cse3) .cse4))) (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse8) c_~var_1_14~0)))))))))) is different from true [2023-12-24 02:06:45,683 WARN L293 SmtUtils]: Spent 26.23s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:07:43,334 WARN L293 SmtUtils]: Spent 27.88s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:07:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 02:07:43,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:07:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493538733] [2023-12-24 02:07:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493538733] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 02:07:43,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 02:07:43,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2023-12-24 02:07:43,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89583895] [2023-12-24 02:07:43,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:07:43,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 02:07:43,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:07:43,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 02:07:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=112, Unknown=6, NotChecked=46, Total=210 [2023-12-24 02:07:43,432 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 02:07:45,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:07:49,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:07:52,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:07:56,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:00,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:03,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:07,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:11,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:18,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:22,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:26,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:33,213 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~var_1_3~0 (_ bv0 8))) (.cse17 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse1 (= (_ bv4 32) .cse17)) (.cse0 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse15 (not .cse3))) (and (or (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_10~0 c_~var_1_10~0) c_~var_1_10~0)) (let ((.cse18 ((_ sign_extend 24) c_~var_1_4~0))) (let ((.cse11 (bvslt .cse18 (_ bv0 32))) (.cse9 (fp.eq c_~var_1_10~0 c_~var_1_14~0)) (.cse16 (bvslt .cse18 (bvadd (bvneg ((_ sign_extend 24) c_~var_1_12~0)) (_ bv16 32) ((_ sign_extend 24) c_~var_1_11~0))))) (let ((.cse2 (or .cse9 .cse16)) (.cse12 (= .cse17 ((_ sign_extend 24) ((_ extract 7 0) .cse18)))) (.cse13 (= .cse17 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse18))))) (.cse10 (not .cse16)) (.cse14 (not .cse11))) (let ((.cse6 (or (and (or .cse11 (and .cse0 .cse9 .cse12 .cse10)) (or (and .cse0 .cse9 .cse13 .cse10) .cse14)) .cse15)) (.cse7 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (.cse5 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (.cse4 (or (and (or .cse11 (and .cse12 .cse2)) (or (and .cse13 .cse2) .cse14)) .cse15))) (and (or (and (or (and .cse0 (or (and .cse1 .cse2) .cse3) .cse4) .cse5) (or (and .cse6 (or (and .cse0 .cse1 .cse2) .cse3)) .cse7)) (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse8) c_~var_1_14~0))))) (or (and (or (and .cse6 (or (and .cse0 .cse9 .cse1 .cse10) .cse3)) .cse7) (or .cse5 (and .cse0 (or (and .cse9 .cse1 .cse10) .cse3) .cse4))) (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_10~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse8) c_~var_1_14~0)))))))))) (or (let ((.cse19 (let ((.cse20 (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse23 ((_ sign_extend 24) ~var_1_4~0))) (or (= ((_ sign_extend 24) ((_ extract 7 0) .cse23)) .cse17) (bvslt .cse23 (bvadd (_ bv16 32) (bvneg ((_ sign_extend 24) ~var_1_12~0)) ((_ sign_extend 24) ~var_1_11~0))) (bvslt .cse23 (_ bv0 32)))))) (.cse21 (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse22 ((_ sign_extend 24) ~var_1_4~0))) (or (not (bvslt .cse22 (_ bv0 32))) (= .cse17 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse22)))) (bvslt .cse22 (bvadd (_ bv16 32) (bvneg ((_ sign_extend 24) ~var_1_12~0)) ((_ sign_extend 24) ~var_1_11~0)))))))) (and (or (and .cse0 (or .cse1 .cse3) (or (and .cse20 .cse21) .cse15)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (or (and (or (and .cse0 .cse1) .cse3) (or (and .cse0 .cse20 .cse21) .cse15)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse8) c_~var_1_14~0)))) .cse19) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse8) c_~var_1_14~0))) .cse19))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)))))) is different from true [2023-12-24 02:08:36,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:40,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:44,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:48,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:51,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:08:55,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:00,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:03,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:08,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:12,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:14,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:18,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:19,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:24,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:27,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:29,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:34,898 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (or (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse1 (let ((.cse2 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0)))) (and (or .cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0)))) (or .cse2 (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse0) c_~var_1_14~0)))) .cse1) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse0) c_~var_1_14~0))) .cse1))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)))) is different from true [2023-12-24 02:09:36,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-24 02:09:40,643 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (or (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse1 (let ((.cse4 (= c_~var_1_3~0 (_ bv0 8))) (.cse9 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse3 (= (_ bv4 32) .cse9)) (.cse2 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse5 (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse10 ((_ sign_extend 24) ~var_1_4~0))) (or (= ((_ sign_extend 24) ((_ extract 7 0) .cse10)) .cse9) (bvslt .cse10 (bvadd (_ bv16 32) (bvneg ((_ sign_extend 24) ~var_1_12~0)) ((_ sign_extend 24) ~var_1_11~0))) (bvslt .cse10 (_ bv0 32)))))) (.cse6 (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse8 ((_ sign_extend 24) ~var_1_4~0))) (or (not (bvslt .cse8 (_ bv0 32))) (= .cse9 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse8)))) (bvslt .cse8 (bvadd (_ bv16 32) (bvneg ((_ sign_extend 24) ~var_1_12~0)) ((_ sign_extend 24) ~var_1_11~0))))))) (.cse7 (not .cse4))) (and (or (and .cse2 (or .cse3 .cse4) (or (and .cse5 .cse6) .cse7)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (or (and (or (and .cse2 .cse3) .cse4) (or (and .cse2 .cse5 .cse6) .cse7)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))))))) (and (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse0) c_~var_1_14~0)))) .cse1) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse0) c_~var_1_14~0))) .cse1))) (not (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)))) is different from true [2023-12-24 02:09:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:09:40,649 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2023-12-24 02:09:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 02:09:40,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-12-24 02:09:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:09:40,652 INFO L225 Difference]: With dead ends: 56 [2023-12-24 02:09:40,652 INFO L226 Difference]: Without dead ends: 54 [2023-12-24 02:09:40,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 128.0s TimeCoverageRelationStatistics Valid=52, Invalid=115, Unknown=9, NotChecked=130, Total=306 [2023-12-24 02:09:40,653 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 26 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 100.7s IncrementalHoareTripleChecker+Time [2023-12-24 02:09:40,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 14 Unknown, 165 Unchecked, 100.7s Time] [2023-12-24 02:09:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-24 02:09:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2023-12-24 02:09:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 02:09:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2023-12-24 02:09:40,659 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 87 [2023-12-24 02:09:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:09:40,660 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2023-12-24 02:09:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-24 02:09:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2023-12-24 02:09:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-24 02:09:40,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:09:40,662 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:09:40,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-24 02:09:40,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:09:40,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:09:40,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:09:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash -249449529, now seen corresponding path program 1 times [2023-12-24 02:09:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:09:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803384078] [2023-12-24 02:09:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:09:40,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:09:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:09:40,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:09:40,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 02:09:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:09:41,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 02:09:41,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:10:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-24 02:10:24,863 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:14:42,896 WARN L293 SmtUtils]: Spent 2.75m on a formula simplification that was a NOOP. DAG size: 124 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:16:21,491 WARN L293 SmtUtils]: Spent 46.00s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:16:39,236 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 253.0 5.0))) (.cse0 (let ((.cse3 (= c_~var_1_3~0 (_ bv0 8))) (.cse10 ((_ sign_extend 24) c_~var_1_2~0))) (let ((.cse4 (= (_ bv4 32) .cse10)) (.cse2 (= (_ bv14 32) ((_ sign_extend 24) c_~var_1_1~0))) (.cse6 (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse11 ((_ sign_extend 24) ~var_1_4~0))) (or (= ((_ sign_extend 24) ((_ extract 7 0) .cse11)) .cse10) (bvslt .cse11 (bvadd (_ bv16 32) (bvneg ((_ sign_extend 24) ~var_1_12~0)) ((_ sign_extend 24) ~var_1_11~0))) (bvslt .cse11 (_ bv0 32)))))) (.cse7 (forall ((~var_1_4~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse9 ((_ sign_extend 24) ~var_1_4~0))) (or (not (bvslt .cse9 (_ bv0 32))) (= .cse10 ((_ sign_extend 24) ((_ extract 7 0) (bvneg .cse9)))) (bvslt .cse9 (bvadd (_ bv16 32) (bvneg ((_ sign_extend 24) ~var_1_12~0)) ((_ sign_extend 24) ~var_1_11~0))))))) (.cse5 (fp.eq c_~var_1_14~0 c_~var_1_14~0)) (.cse8 (not .cse3))) (and (or (and .cse2 (or .cse3 (and .cse4 .cse5)) (or (and .cse6 .cse7 .cse5) .cse8)) (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))))) (or (forall ((~var_1_15~0 (_ FloatingPoint 8 24)) (~var_1_16~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.sub c_currentRoundingMode ~var_1_15~0 ~var_1_16~0))) (and (or (and .cse2 .cse4 .cse5) .cse3) (or (and .cse2 .cse6 .cse7 .cse5) .cse8)))))))) (and (or .cse0 (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) (or (forall ((~var_1_13~0 (_ FloatingPoint 8 24))) (not (fp.eq c_~var_1_14~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ~var_1_13~0 .cse1) c_~var_1_14~0)))) .cse0))) (fp.gt (fp.mul c_currentRoundingMode c_~var_1_14~0 c_~var_1_14~0) c_~var_1_14~0)) is different from true Received shutdown request... [2023-12-24 02:17:51,101 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 02:17:51,102 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 02:17:52,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 02:17:52,302 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 02:17:52,362 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 [2023-12-24 02:17:52,365 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 02:17:52,365 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 88 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-24 02:17:52,368 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-24 02:17:52,370 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 02:17:52,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:17:52 BoogieIcfgContainer [2023-12-24 02:17:52,371 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 02:17:52,371 INFO L158 Benchmark]: Toolchain (without parser) took 882605.95ms. Allocated memory was 306.2MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 243.5MB in the beginning and 714.7MB in the end (delta: -471.2MB). Peak memory consumption was 280.4MB. Max. memory is 8.0GB. [2023-12-24 02:17:52,372 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory was 147.2MB in the beginning and 147.1MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 02:17:52,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.04ms. Allocated memory is still 306.2MB. Free memory was 243.5MB in the beginning and 230.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 02:17:52,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.22ms. Allocated memory is still 306.2MB. Free memory was 230.3MB in the beginning and 228.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 02:17:52,372 INFO L158 Benchmark]: Boogie Preprocessor took 63.79ms. Allocated memory is still 306.2MB. Free memory was 228.3MB in the beginning and 225.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 02:17:52,372 INFO L158 Benchmark]: RCFGBuilder took 1787.42ms. Allocated memory is still 306.2MB. Free memory was 225.7MB in the beginning and 262.6MB in the end (delta: -36.9MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2023-12-24 02:17:52,373 INFO L158 Benchmark]: TraceAbstraction took 880500.70ms. Allocated memory was 306.2MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 262.1MB in the beginning and 714.7MB in the end (delta: -452.6MB). Peak memory consumption was 298.1MB. Max. memory is 8.0GB. [2023-12-24 02:17:52,374 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory was 147.2MB in the beginning and 147.1MB in the end (delta: 91.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.04ms. Allocated memory is still 306.2MB. Free memory was 243.5MB in the beginning and 230.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.22ms. Allocated memory is still 306.2MB. Free memory was 230.3MB in the beginning and 228.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.79ms. Allocated memory is still 306.2MB. Free memory was 228.3MB in the beginning and 225.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1787.42ms. Allocated memory is still 306.2MB. Free memory was 225.7MB in the beginning and 262.6MB in the end (delta: -36.9MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. * TraceAbstraction took 880500.70ms. Allocated memory was 306.2MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 262.1MB in the beginning and 714.7MB in the end (delta: -452.6MB). Peak memory consumption was 298.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 88 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.5s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 118.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 101.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 100.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 165 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 106 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 128.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 270.0s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 258 ConstructedInterpolants, 4 QuantifiedInterpolants, 4250 SizeOfPredicates, 26 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1086/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown