/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-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 18:31:03,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 18:31:03,634 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:31:03,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 18:31:03,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 18:31:03,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 18:31:03,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 18:31:03,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 18:31:03,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 18:31:03,669 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 18:31:03,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 18:31:03,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 18:31:03,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 18:31:03,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 18:31:03,671 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 18:31:03,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 18:31:03,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 18:31:03,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 18:31:03,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 18:31:03,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 18:31:03,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 18:31:03,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 18:31:03,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 18:31:03,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 18:31:03,673 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 18:31:03,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 18:31:03,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 18:31:03,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 18:31:03,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 18:31:03,674 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 18:31:03,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 18:31:03,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 18:31:03,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 18:31:03,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 18:31:03,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 18:31:03,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 18:31:03,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 18:31:03,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 18:31:03,676 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 18:31:03,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 18:31:03,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 18:31:03,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 18:31:03,676 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 18:31:03,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 18:31:03,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 18:31:03,677 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 18:31:03,677 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:31:03,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 18:31:03,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 18:31:03,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 18:31:03,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 18:31:03,894 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 18:31:03,896 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-33.i [2023-12-23 18:31:04,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 18:31:05,194 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 18:31:05,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2023-12-23 18:31:05,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659f8875a/7c52c6bc253f497d9172658a26ec4bb9/FLAG1fd3aa2d8 [2023-12-23 18:31:05,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659f8875a/7c52c6bc253f497d9172658a26ec4bb9 [2023-12-23 18:31:05,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 18:31:05,240 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 18:31:05,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 18:31:05,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 18:31:05,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 18:31:05,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b352ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05, skipping insertion in model container [2023-12-23 18:31:05,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,283 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 18:31:05,462 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-33.i[917,930] [2023-12-23 18:31:05,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 18:31:05,559 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 18:31:05,575 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-33.i[917,930] [2023-12-23 18:31:05,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 18:31:05,626 INFO L206 MainTranslator]: Completed translation [2023-12-23 18:31:05,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05 WrapperNode [2023-12-23 18:31:05,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 18:31:05,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 18:31:05,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 18:31:05,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 18:31:05,636 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:31:05" (1/1) ... [2023-12-23 18:31:05,658 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:31:05" (1/1) ... [2023-12-23 18:31:05,689 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2023-12-23 18:31:05,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 18:31:05,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 18:31:05,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 18:31:05,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 18:31:05,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,736 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:31:05,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 18:31:05,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 18:31:05,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 18:31:05,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 18:31:05,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (1/1) ... [2023-12-23 18:31:05,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 18:31:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 18:31:05,835 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:31:05,880 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:31:05,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 18:31:05,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 18:31:05,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 18:31:05,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 18:31:05,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 18:31:05,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 18:31:06,011 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 18:31:06,016 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 18:31:06,756 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 18:31:06,792 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 18:31:06,799 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 18:31:06,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:31:06 BoogieIcfgContainer [2023-12-23 18:31:06,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 18:31:06,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 18:31:06,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 18:31:06,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 18:31:06,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 06:31:05" (1/3) ... [2023-12-23 18:31:06,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6fe35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:31:06, skipping insertion in model container [2023-12-23 18:31:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 06:31:05" (2/3) ... [2023-12-23 18:31:06,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6fe35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 06:31:06, skipping insertion in model container [2023-12-23 18:31:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 06:31:06" (3/3) ... [2023-12-23 18:31:06,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2023-12-23 18:31:06,821 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 18:31:06,821 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 18:31:06,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 18:31:06,871 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;@74146728, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 18:31:06,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 18:31:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-23 18:31:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-23 18:31:06,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:31:06,883 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 18:31:06,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:31:06,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:31:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1056546956, now seen corresponding path program 1 times [2023-12-23 18:31:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:31:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419932444] [2023-12-23 18:31:06,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:31:06,901 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:31:06,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:31:06,903 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:31:06,937 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:31:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:31:07,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 18:31:07,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:31:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-23 18:31:07,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 18:31:07,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 18:31:07,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419932444] [2023-12-23 18:31:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419932444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 18:31:07,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 18:31:07,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 18:31:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250214957] [2023-12-23 18:31:07,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 18:31:07,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 18:31:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 18:31:07,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 18:31:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 18:31:07,244 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-23 18:31:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 18:31:07,674 INFO L93 Difference]: Finished difference Result 67 states and 109 transitions. [2023-12-23 18:31:07,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 18:31:07,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2023-12-23 18:31:07,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 18:31:07,692 INFO L225 Difference]: With dead ends: 67 [2023-12-23 18:31:07,692 INFO L226 Difference]: Without dead ends: 33 [2023-12-23 18:31:07,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 18:31:07,700 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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.4s IncrementalHoareTripleChecker+Time [2023-12-23 18:31:07,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-23 18:31:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-23 18:31:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-23 18:31:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-23 18:31:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2023-12-23 18:31:07,744 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 62 [2023-12-23 18:31:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 18:31:07,744 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2023-12-23 18:31:07,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-23 18:31:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2023-12-23 18:31:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-23 18:31:07,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:31:07,749 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 18:31:07,772 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:31:07,956 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:31:07,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:31:07,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:31:07,959 INFO L85 PathProgramCache]: Analyzing trace with hash 924409454, now seen corresponding path program 1 times [2023-12-23 18:31:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:31:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913521284] [2023-12-23 18:31:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:31:07,960 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:31:07,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:31:07,961 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:31:07,983 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:31:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:31:08,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-23 18:31:08,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:31:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-23 18:31:08,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 18:31:08,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 18:31:08,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913521284] [2023-12-23 18:31:08,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913521284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 18:31:08,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626700277] [2023-12-23 18:31:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:31:08,685 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 18:31:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 18:31:08,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 18:31:08,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-23 18:31:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:31:09,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 18:31:09,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:31:09,216 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-23 18:31:09,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 18:31:09,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1626700277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 18:31:09,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 18:31:09,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-12-23 18:31:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550875908] [2023-12-23 18:31:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 18:31:09,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-23 18:31:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 18:31:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-23 18:31:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-23 18:31:09,219 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-23 18:31:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 18:31:09,678 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2023-12-23 18:31:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-23 18:31:09,679 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-12-23 18:31:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 18:31:09,681 INFO L225 Difference]: With dead ends: 89 [2023-12-23 18:31:09,681 INFO L226 Difference]: Without dead ends: 57 [2023-12-23 18:31:09,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-23 18:31:09,683 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 62 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-23 18:31:09,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 161 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-23 18:31:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-23 18:31:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2023-12-23 18:31:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-23 18:31:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2023-12-23 18:31:09,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 62 [2023-12-23 18:31:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 18:31:09,692 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2023-12-23 18:31:09,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-23 18:31:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2023-12-23 18:31:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-23 18:31:09,694 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:31:09,694 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 18:31:09,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-23 18:31:09,910 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:31:10,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:31:10,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:31:10,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:31:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash 926316078, now seen corresponding path program 1 times [2023-12-23 18:31:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:31:10,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159882760] [2023-12-23 18:31:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:31:10,113 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:31:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:31:10,114 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:31:10,138 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:31:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:31:10,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-23 18:31:10,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:31:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-23 18:31:10,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 18:31:10,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 18:31:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159882760] [2023-12-23 18:31:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159882760] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 18:31:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1014707388] [2023-12-23 18:31:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:31:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 18:31:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 18:31:10,584 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 18:31:10,596 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 18:31:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:31:10,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-23 18:31:10,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:31:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-23 18:31:11,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 18:31:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1014707388] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 18:31:11,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 18:31:11,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-12-23 18:31:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867816419] [2023-12-23 18:31:11,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 18:31:11,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-23 18:31:11,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 18:31:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-23 18:31:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-23 18:31:11,223 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-23 18:31:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 18:31:11,974 INFO L93 Difference]: Finished difference Result 104 states and 136 transitions. [2023-12-23 18:31:11,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-23 18:31:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 62 [2023-12-23 18:31:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 18:31:11,986 INFO L225 Difference]: With dead ends: 104 [2023-12-23 18:31:11,986 INFO L226 Difference]: Without dead ends: 72 [2023-12-23 18:31:11,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2023-12-23 18:31:11,988 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-23 18:31:11,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-23 18:31:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-23 18:31:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2023-12-23 18:31:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-23 18:31:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2023-12-23 18:31:11,999 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 62 [2023-12-23 18:31:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 18:31:11,999 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2023-12-23 18:31:11,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-23 18:31:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2023-12-23 18:31:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-23 18:31:12,000 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 18:31:12,000 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 18:31:12,017 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 18:31:12,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2023-12-23 18:31:12,415 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 18:31:12,418 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 18:31:12,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 18:31:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1606374448, now seen corresponding path program 1 times [2023-12-23 18:31:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 18:31:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242886245] [2023-12-23 18:31:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 18:31:12,426 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:31:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 18:31:12,429 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 18:31:12,442 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 18:31:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 18:31:12,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-23 18:31:12,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 18:32:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-23 18:32:11,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 18:44:34,073 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 ((_ zero_extend 24) c_~var_1_7~0)) (.cse64 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse21 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse74 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse74 .cse64)) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (not (fp.eq ~var_1_9~0 (fp.neg .cse74)))))))) (.cse22 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse73 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse73 .cse64)) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (fp.eq ~var_1_9~0 (fp.neg .cse73))))))) (.cse32 (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv128 32) (bvneg (bvmul (_ bv2 32) .cse66))))) ((_ sign_extend 16) c_~var_1_1~0))) (.cse70 ((_ zero_extend 24) c_~var_1_8~0)) (.cse43 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse72 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse72 .cse64) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (fp.eq ~var_1_9~0 .cse72)))))) (.cse45 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse71 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse71 .cse64) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (not (fp.eq ~var_1_9~0 .cse71)))))))) (let ((.cse13 (bvslt ((_ sign_extend 16) c_~var_1_5~0) c_~last_1_var_1_13~0)) (.cse62 (and .cse43 .cse45)) (.cse61 (= c_~var_1_16~0 .cse66)) (.cse60 (fp.eq c_~var_1_15~0 c_~var_1_11~0)) (.cse23 (= c_~var_1_13~0 .cse70)) (.cse55 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (fp.lt (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)) .cse64))) (.cse35 (= (_ bv0 8) c_~var_1_14~0)) (.cse37 (= c_~var_1_13~0 .cse66)) (.cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse70 (_ bv1 32)))) .cse66)) (.cse8 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (not (fp.lt (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)) .cse64)))) (.cse18 (not .cse32)) (.cse69 (and .cse21 .cse22))) (let ((.cse2 (or .cse18 .cse69)) (.cse20 (or .cse8 .cse32)) (.cse14 (or .cse9 .cse8)) (.cse3 (or .cse69 .cse32)) (.cse17 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse68 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse68 .cse64)) (fp.eq ~var_1_9~0 (fp.neg .cse68)))))) (.cse15 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse67 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse67 .cse64)) (not (fp.eq ~var_1_9~0 (fp.neg .cse67))))))) (.cse36 (not (bvslt .cse66 (bvand c_~var_1_13~0 (bvor c_~var_1_16~0 .cse66))))) (.cse24 (not .cse37)) (.cse49 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse65 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse65 .cse64) (not (fp.eq ~var_1_9~0 .cse65)))))) (.cse16 (not .cse35)) (.cse50 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse63 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse63 .cse64) (fp.eq ~var_1_9~0 .cse63))))) (.cse11 (not .cse9)) (.cse41 (or .cse9 .cse55)) (.cse51 (or .cse32 .cse55)) (.cse0 (not .cse23)) (.cse5 (not .cse60)) (.cse6 (not .cse61)) (.cse54 (or .cse18 .cse62)) (.cse48 (or .cse62 .cse32)) (.cse1 (and .cse60 .cse61)) (.cse7 (not .cse13))) (and (or (and (or .cse0 (let ((.cse4 (or .cse7 .cse8))) (and (or .cse1 (and .cse2 .cse3 .cse4)) (or .cse5 (and .cse3 .cse4) .cse6)))) (or (and (or .cse5 .cse6 (let ((.cse12 (or (and (or .cse15 .cse16) (or .cse16 .cse17)) .cse18))) (and (or (let ((.cse10 (and .cse12 .cse3))) (and (or .cse9 .cse10) (or .cse10 .cse11))) .cse13) (or .cse7 (and .cse12 .cse3 .cse14))))) (or (and (or .cse13 (let ((.cse19 (and .cse20 .cse21 .cse22))) (and (or .cse19 .cse11) (or .cse9 .cse19)))) (or .cse7 (and .cse20 .cse21 .cse22 .cse14))) .cse1)) .cse23)) .cse24) (or (let ((.cse27 (or .cse8 .cse36))) (and (or (and (or .cse5 (and (or .cse7 (and .cse2 .cse3 .cse14)) (or (let ((.cse25 (and .cse2 .cse3))) (and (or .cse25 .cse9) (or .cse25 .cse11))) .cse13)) .cse6) (or .cse1 (and (or (let ((.cse26 (and .cse20 .cse21 .cse27 .cse22))) (and (or .cse26 .cse11) (or .cse9 .cse26))) .cse13) (or .cse7 (and .cse20 .cse21 .cse27 .cse22 .cse14))))) .cse23) (or .cse0 (and (or (let ((.cse31 (and .cse21 .cse27 .cse22))) (let ((.cse29 (or .cse32 .cse31)) (.cse30 (or .cse18 .cse31))) (and (or .cse13 (let ((.cse28 (and .cse29 .cse30))) (and (or .cse28 .cse9) (or .cse28 .cse11)))) (or .cse7 (and .cse29 .cse30 .cse14))))) .cse1) (or .cse5 .cse6 (let ((.cse33 (or (and (or .cse17 .cse35) (or .cse15 .cse35)) .cse18))) (and (or .cse7 (and .cse3 .cse33 .cse14)) (or (let ((.cse34 (and .cse3 .cse33))) (and (or .cse9 .cse34) (or .cse11 .cse34))) .cse13)))))))) .cse37) (or (let ((.cse44 (or .cse36 .cse55))) (and (or .cse0 (and (or .cse1 (let ((.cse42 (and .cse43 .cse44 .cse45))) (let ((.cse39 (or .cse42 .cse32)) (.cse40 (or .cse18 .cse42))) (and (or (let ((.cse38 (and .cse39 .cse40))) (and (or .cse9 .cse38) (or .cse38 .cse11))) .cse13) (or .cse7 (and .cse39 .cse41 .cse40)))))) (or .cse5 .cse6 (let ((.cse47 (or .cse18 (and (or .cse49 .cse35) (or .cse50 .cse35))))) (and (or .cse13 (let ((.cse46 (and .cse47 .cse48))) (and (or .cse9 .cse46) (or .cse46 .cse11)))) (or .cse7 (and .cse41 .cse47 .cse48))))))) (or (and (or .cse1 (and (or .cse7 (and .cse43 .cse44 .cse45 .cse41 .cse51)) (or (let ((.cse52 (and .cse43 .cse44 .cse45 .cse51))) (and (or .cse52 .cse11) (or .cse52 .cse9))) .cse13))) (or .cse5 (and (or (let ((.cse53 (and .cse54 .cse48))) (and (or .cse11 .cse53) (or .cse9 .cse53))) .cse13) (or .cse7 (and .cse54 .cse41 .cse48))) .cse6)) .cse23))) .cse37) (or .cse24 (and (or (and (or .cse5 (let ((.cse57 (or .cse18 (and (or .cse16 .cse49) (or .cse16 .cse50))))) (and (or (let ((.cse56 (and .cse57 .cse48))) (and (or .cse11 .cse56) (or .cse9 .cse56))) .cse13) (or (and .cse57 .cse41 .cse48) .cse7))) .cse6) (or .cse1 (and (or (let ((.cse58 (and .cse43 .cse45 .cse51))) (and (or .cse58 .cse11) (or .cse9 .cse58))) .cse13) (or .cse7 (and .cse43 .cse45 .cse41 .cse51))))) .cse23) (or .cse0 (let ((.cse59 (or .cse7 .cse55))) (and (or .cse5 .cse6 (and .cse59 .cse48)) (or (and .cse54 .cse59 .cse48) .cse1))))))))))) is different from false [2023-12-23 18:44:38,145 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse66 ((_ zero_extend 24) c_~var_1_7~0)) (.cse64 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse21 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse74 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse74 .cse64)) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (not (fp.eq ~var_1_9~0 (fp.neg .cse74)))))))) (.cse22 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse73 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse73 .cse64)) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (fp.eq ~var_1_9~0 (fp.neg .cse73))))))) (.cse32 (= ((_ sign_extend 16) ((_ extract 15 0) (bvadd (_ bv128 32) (bvneg (bvmul (_ bv2 32) .cse66))))) ((_ sign_extend 16) c_~var_1_1~0))) (.cse70 ((_ zero_extend 24) c_~var_1_8~0)) (.cse43 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse72 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse72 .cse64) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (fp.eq ~var_1_9~0 .cse72)))))) (.cse45 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (let ((.cse71 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse71 .cse64) (forall ((~var_1_9~0 (_ FloatingPoint 8 24))) (not (fp.eq ~var_1_9~0 .cse71)))))))) (let ((.cse13 (bvslt ((_ sign_extend 16) c_~var_1_5~0) c_~last_1_var_1_13~0)) (.cse62 (and .cse43 .cse45)) (.cse61 (= c_~var_1_16~0 .cse66)) (.cse60 (fp.eq c_~var_1_15~0 c_~var_1_11~0)) (.cse23 (= c_~var_1_13~0 .cse70)) (.cse55 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (fp.lt (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)) .cse64))) (.cse35 (= (_ bv0 8) c_~var_1_14~0)) (.cse37 (= c_~var_1_13~0 .cse66)) (.cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse70 (_ bv1 32)))) .cse66)) (.cse8 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24))) (not (fp.lt (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)) .cse64)))) (.cse18 (not .cse32)) (.cse69 (and .cse21 .cse22))) (let ((.cse2 (or .cse18 .cse69)) (.cse20 (or .cse8 .cse32)) (.cse14 (or .cse9 .cse8)) (.cse3 (or .cse69 .cse32)) (.cse17 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse68 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse68 .cse64)) (fp.eq ~var_1_9~0 (fp.neg .cse68)))))) (.cse15 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse67 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (not (fp.lt .cse67 .cse64)) (not (fp.eq ~var_1_9~0 (fp.neg .cse67))))))) (.cse36 (not (bvslt .cse66 (bvand c_~var_1_13~0 (bvor c_~var_1_16~0 .cse66))))) (.cse24 (not .cse37)) (.cse49 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse65 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse65 .cse64) (not (fp.eq ~var_1_9~0 .cse65)))))) (.cse16 (not .cse35)) (.cse50 (forall ((~var_1_12~0 (_ FloatingPoint 8 24)) (~var_1_10~0 (_ FloatingPoint 8 24)) (~var_1_9~0 (_ FloatingPoint 8 24))) (let ((.cse63 (fp.add c_currentRoundingMode ~var_1_10~0 (fp.sub c_currentRoundingMode c_~var_1_11~0 ~var_1_12~0)))) (or (fp.lt .cse63 .cse64) (fp.eq ~var_1_9~0 .cse63))))) (.cse11 (not .cse9)) (.cse41 (or .cse9 .cse55)) (.cse51 (or .cse32 .cse55)) (.cse0 (not .cse23)) (.cse5 (not .cse60)) (.cse6 (not .cse61)) (.cse54 (or .cse18 .cse62)) (.cse48 (or .cse62 .cse32)) (.cse1 (and .cse60 .cse61)) (.cse7 (not .cse13))) (and (or (and (or .cse0 (let ((.cse4 (or .cse7 .cse8))) (and (or .cse1 (and .cse2 .cse3 .cse4)) (or .cse5 (and .cse3 .cse4) .cse6)))) (or (and (or .cse5 .cse6 (let ((.cse12 (or (and (or .cse15 .cse16) (or .cse16 .cse17)) .cse18))) (and (or (let ((.cse10 (and .cse12 .cse3))) (and (or .cse9 .cse10) (or .cse10 .cse11))) .cse13) (or .cse7 (and .cse12 .cse3 .cse14))))) (or (and (or .cse13 (let ((.cse19 (and .cse20 .cse21 .cse22))) (and (or .cse19 .cse11) (or .cse9 .cse19)))) (or .cse7 (and .cse20 .cse21 .cse22 .cse14))) .cse1)) .cse23)) .cse24) (or (let ((.cse27 (or .cse8 .cse36))) (and (or (and (or .cse5 (and (or .cse7 (and .cse2 .cse3 .cse14)) (or (let ((.cse25 (and .cse2 .cse3))) (and (or .cse25 .cse9) (or .cse25 .cse11))) .cse13)) .cse6) (or .cse1 (and (or (let ((.cse26 (and .cse20 .cse21 .cse27 .cse22))) (and (or .cse26 .cse11) (or .cse9 .cse26))) .cse13) (or .cse7 (and .cse20 .cse21 .cse27 .cse22 .cse14))))) .cse23) (or .cse0 (and (or (let ((.cse31 (and .cse21 .cse27 .cse22))) (let ((.cse29 (or .cse32 .cse31)) (.cse30 (or .cse18 .cse31))) (and (or .cse13 (let ((.cse28 (and .cse29 .cse30))) (and (or .cse28 .cse9) (or .cse28 .cse11)))) (or .cse7 (and .cse29 .cse30 .cse14))))) .cse1) (or .cse5 .cse6 (let ((.cse33 (or (and (or .cse17 .cse35) (or .cse15 .cse35)) .cse18))) (and (or .cse7 (and .cse3 .cse33 .cse14)) (or (let ((.cse34 (and .cse3 .cse33))) (and (or .cse9 .cse34) (or .cse11 .cse34))) .cse13)))))))) .cse37) (or (let ((.cse44 (or .cse36 .cse55))) (and (or .cse0 (and (or .cse1 (let ((.cse42 (and .cse43 .cse44 .cse45))) (let ((.cse39 (or .cse42 .cse32)) (.cse40 (or .cse18 .cse42))) (and (or (let ((.cse38 (and .cse39 .cse40))) (and (or .cse9 .cse38) (or .cse38 .cse11))) .cse13) (or .cse7 (and .cse39 .cse41 .cse40)))))) (or .cse5 .cse6 (let ((.cse47 (or .cse18 (and (or .cse49 .cse35) (or .cse50 .cse35))))) (and (or .cse13 (let ((.cse46 (and .cse47 .cse48))) (and (or .cse9 .cse46) (or .cse46 .cse11)))) (or .cse7 (and .cse41 .cse47 .cse48))))))) (or (and (or .cse1 (and (or .cse7 (and .cse43 .cse44 .cse45 .cse41 .cse51)) (or (let ((.cse52 (and .cse43 .cse44 .cse45 .cse51))) (and (or .cse52 .cse11) (or .cse52 .cse9))) .cse13))) (or .cse5 (and (or (let ((.cse53 (and .cse54 .cse48))) (and (or .cse11 .cse53) (or .cse9 .cse53))) .cse13) (or .cse7 (and .cse54 .cse41 .cse48))) .cse6)) .cse23))) .cse37) (or .cse24 (and (or (and (or .cse5 (let ((.cse57 (or .cse18 (and (or .cse16 .cse49) (or .cse16 .cse50))))) (and (or (let ((.cse56 (and .cse57 .cse48))) (and (or .cse11 .cse56) (or .cse9 .cse56))) .cse13) (or (and .cse57 .cse41 .cse48) .cse7))) .cse6) (or .cse1 (and (or (let ((.cse58 (and .cse43 .cse45 .cse51))) (and (or .cse58 .cse11) (or .cse9 .cse58))) .cse13) (or .cse7 (and .cse43 .cse45 .cse41 .cse51))))) .cse23) (or .cse0 (let ((.cse59 (or .cse7 .cse55))) (and (or .cse5 .cse6 (and .cse59 .cse48)) (or (and .cse54 .cse59 .cse48) .cse1))))))))))) is different from true Received shutdown request... [2023-12-23 18:45:42,496 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-23 18:45:42,496 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 18:45:42,935 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 18:45:42,950 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 (7)] Ended with exit code 0 [2023-12-23 18:45:43,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 18:45:43,137 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 63 with TraceHistMax 9,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. [2023-12-23 18:45:43,141 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-23 18:45:43,142 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 18:45:43,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 06:45:43 BoogieIcfgContainer [2023-12-23 18:45:43,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 18:45:43,144 INFO L158 Benchmark]: Toolchain (without parser) took 877904.36ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 946.9MB). Free memory was 132.3MB in the beginning and 420.7MB in the end (delta: -288.4MB). Peak memory consumption was 664.9MB. Max. memory is 8.0GB. [2023-12-23 18:45:43,144 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 169.9MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 18:45:43,145 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.02ms. Allocated memory is still 169.9MB. Free memory was 131.9MB in the beginning and 118.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-23 18:45:43,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.83ms. Allocated memory is still 169.9MB. Free memory was 118.8MB in the beginning and 117.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-23 18:45:43,145 INFO L158 Benchmark]: Boogie Preprocessor took 60.53ms. Allocated memory is still 169.9MB. Free memory was 117.1MB in the beginning and 114.2MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-23 18:45:43,145 INFO L158 Benchmark]: RCFGBuilder took 1047.68ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 96.1MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-23 18:45:43,145 INFO L158 Benchmark]: TraceAbstraction took 876342.14ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 946.9MB). Free memory was 95.3MB in the beginning and 420.7MB in the end (delta: -325.4MB). Peak memory consumption was 628.2MB. Max. memory is 8.0GB. [2023-12-23 18:45:43,146 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.13ms. Allocated memory is still 169.9MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.02ms. Allocated memory is still 169.9MB. Free memory was 131.9MB in the beginning and 118.8MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.83ms. Allocated memory is still 169.9MB. Free memory was 118.8MB in the beginning and 117.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.53ms. Allocated memory is still 169.9MB. Free memory was 117.1MB in the beginning and 114.2MB in the end (delta: 2.9MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1047.68ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 96.1MB in the end (delta: 18.1MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 876342.14ms. Allocated memory was 169.9MB in the beginning and 1.1GB in the end (delta: 946.9MB). Free memory was 95.3MB in the beginning and 420.7MB in the end (delta: -325.4MB). Peak memory consumption was 628.2MB. 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 63 with TraceHistMax 9,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 876.3s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 142 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=3, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 305 ConstructedInterpolants, 2 QuantifiedInterpolants, 1710 SizeOfPredicates, 18 NumberOfNonLiveVariables, 573 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 648/720 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