/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_50-1loop_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 02:50:19,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 02:50:19,662 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:50:19,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 02:50:19,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 02:50:19,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 02:50:19,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 02:50:19,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 02:50:19,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 02:50:19,706 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 02:50:19,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 02:50:19,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 02:50:19,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 02:50:19,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 02:50:19,709 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 02:50:19,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 02:50:19,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 02:50:19,710 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 02:50:19,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 02:50:19,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 02:50:19,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 02:50:19,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 02:50:19,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 02:50:19,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 02:50:19,712 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 02:50:19,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 02:50:19,712 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 02:50:19,712 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 02:50:19,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 02:50:19,713 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 02:50:19,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 02:50:19,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 02:50:19,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 02:50:19,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 02:50:19,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:50:19,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 02:50:19,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 02:50:19,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 02:50:19,716 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 02:50:19,716 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 02:50:19,716 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 02:50:19,716 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 02:50:19,717 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 02:50:19,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 02:50:19,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 02:50:19,717 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 02:50:19,718 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:50:19,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 02:50:19,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 02:50:19,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 02:50:19,994 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 02:50:19,994 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 02:50:19,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i [2023-12-24 02:50:21,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 02:50:21,383 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 02:50:21,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i [2023-12-24 02:50:21,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d2c392d/c79012c3d54f4d3ca2e7efc0755a641b/FLAGf56af38e4 [2023-12-24 02:50:21,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56d2c392d/c79012c3d54f4d3ca2e7efc0755a641b [2023-12-24 02:50:21,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 02:50:21,412 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 02:50:21,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 02:50:21,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 02:50:21,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 02:50:21,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc6e162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21, skipping insertion in model container [2023-12-24 02:50:21,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,461 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 02:50:21,613 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_50-1loop_file-30.i[915,928] [2023-12-24 02:50:21,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:50:21,681 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 02:50:21,691 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_50-1loop_file-30.i[915,928] [2023-12-24 02:50:21,711 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 02:50:21,726 INFO L206 MainTranslator]: Completed translation [2023-12-24 02:50:21,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21 WrapperNode [2023-12-24 02:50:21,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 02:50:21,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 02:50:21,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 02:50:21,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 02:50:21,734 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:50:21" (1/1) ... [2023-12-24 02:50:21,745 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:50:21" (1/1) ... [2023-12-24 02:50:21,767 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-12-24 02:50:21,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 02:50:21,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 02:50:21,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 02:50:21,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 02:50:21,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,808 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:50:21,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,840 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 02:50:21,841 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 02:50:21,841 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 02:50:21,841 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 02:50:21,842 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (1/1) ... [2023-12-24 02:50:21,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 02:50:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 02:50:21,872 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:50:21,893 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:50:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 02:50:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 02:50:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 02:50:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 02:50:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 02:50:21,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 02:50:21,967 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 02:50:21,969 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 02:50:32,768 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 02:50:32,802 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 02:50:32,803 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 02:50:32,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:50:32 BoogieIcfgContainer [2023-12-24 02:50:32,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 02:50:32,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 02:50:32,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 02:50:32,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 02:50:32,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 02:50:21" (1/3) ... [2023-12-24 02:50:32,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77180310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:50:32, skipping insertion in model container [2023-12-24 02:50:32,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 02:50:21" (2/3) ... [2023-12-24 02:50:32,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77180310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:50:32, skipping insertion in model container [2023-12-24 02:50:32,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:50:32" (3/3) ... [2023-12-24 02:50:32,810 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-30.i [2023-12-24 02:50:32,826 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 02:50:32,827 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 02:50:32,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 02:50:32,878 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;@266664a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 02:50:32,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 02:50:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 32 states have (on average 1.5625) internal successors, (50), 33 states have internal predecessors, (50), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 02:50:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-24 02:50:32,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:50:32,893 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:50:32,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:50:32,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:50:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 648497747, now seen corresponding path program 1 times [2023-12-24 02:50:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:50:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376189311] [2023-12-24 02:50:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:50:32,917 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:50:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:50:32,922 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:50:32,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-24 02:50:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:50:33,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 02:50:33,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:50:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2023-12-24 02:50:33,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:50:33,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:50:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376189311] [2023-12-24 02:50:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376189311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:50:33,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:50:33,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 02:50:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019236427] [2023-12-24 02:50:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:50:33,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 02:50:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:50:33,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 02:50:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 02:50:33,510 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.5625) internal successors, (50), 33 states have internal predecessors, (50), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 02:50:37,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:50:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:50:37,776 INFO L93 Difference]: Finished difference Result 89 states and 149 transitions. [2023-12-24 02:50:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 02:50:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2023-12-24 02:50:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:50:37,791 INFO L225 Difference]: With dead ends: 89 [2023-12-24 02:50:37,792 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 02:50:37,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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:50:37,799 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:50:37,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-24 02:50:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 02:50:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-24 02:50:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-24 02:50:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2023-12-24 02:50:37,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 71 [2023-12-24 02:50:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:50:37,842 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2023-12-24 02:50:37,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-24 02:50:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2023-12-24 02:50:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-24 02:50:37,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:50:37,845 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:50:37,859 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:50:38,058 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:50:38,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:50:38,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:50:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1312650229, now seen corresponding path program 1 times [2023-12-24 02:50:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:50:38,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722760201] [2023-12-24 02:50:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:50:38,061 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:50:38,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:50:38,062 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:50:38,064 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:50:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:50:38,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 02:50:38,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:50:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 02:50:39,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:50:39,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:50:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722760201] [2023-12-24 02:50:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722760201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:50:39,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:50:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 02:50:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731535726] [2023-12-24 02:50:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:50:39,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 02:50:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:50:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 02:50:39,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 02:50:39,048 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:50:43,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:50:47,734 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 [] [2023-12-24 02:50:49,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:50:53,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:50:57,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:50:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:50:57,357 INFO L93 Difference]: Finished difference Result 144 states and 220 transitions. [2023-12-24 02:50:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 02:50:57,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2023-12-24 02:50:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:50:57,360 INFO L225 Difference]: With dead ends: 144 [2023-12-24 02:50:57,360 INFO L226 Difference]: Without dead ends: 102 [2023-12-24 02:50:57,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 02:50:57,362 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2023-12-24 02:50:57,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 193 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 18.2s Time] [2023-12-24 02:50:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-24 02:50:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2023-12-24 02:50:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 02:50:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2023-12-24 02:50:57,378 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 71 [2023-12-24 02:50:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:50:57,379 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2023-12-24 02:50:57,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:50:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2023-12-24 02:50:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-24 02:50:57,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:50:57,382 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:50:57,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 02:50:57,584 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:50:57,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:50:57,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:50:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1212675783, now seen corresponding path program 1 times [2023-12-24 02:50:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:50:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705330677] [2023-12-24 02:50:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:50:57,586 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:50:57,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:50:57,588 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:50:57,589 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:50:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:50:57,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 02:50:57,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:50:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-24 02:50:59,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 02:50:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-24 02:50:59,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:50:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705330677] [2023-12-24 02:50:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705330677] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 02:50:59,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 02:50:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2023-12-24 02:50:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356072067] [2023-12-24 02:50:59,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 02:50:59,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 02:50:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:50:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 02:50:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-24 02:50:59,979 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 02:51:05,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:51:09,488 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 [] [2023-12-24 02:51:13,491 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 [] [2023-12-24 02:51:17,495 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 [] [2023-12-24 02:51:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:51:17,888 INFO L93 Difference]: Finished difference Result 142 states and 202 transitions. [2023-12-24 02:51:17,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 02:51:17,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 72 [2023-12-24 02:51:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:51:17,891 INFO L225 Difference]: With dead ends: 142 [2023-12-24 02:51:17,891 INFO L226 Difference]: Without dead ends: 100 [2023-12-24 02:51:17,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2023-12-24 02:51:17,893 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 141 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 41 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2023-12-24 02:51:17,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 181 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 17.5s Time] [2023-12-24 02:51:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-24 02:51:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-12-24 02:51:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 02:51:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2023-12-24 02:51:17,910 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 72 [2023-12-24 02:51:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:51:17,911 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2023-12-24 02:51:17,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-24 02:51:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2023-12-24 02:51:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-24 02:51:17,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:51:17,912 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:51:17,932 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:51:18,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:51:18,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:51:18,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:51:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1096892497, now seen corresponding path program 1 times [2023-12-24 02:51:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:51:18,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844881938] [2023-12-24 02:51:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:51:18,127 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:51:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:51:18,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:51:18,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 02:51:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:51:18,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 02:51:18,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:51:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-24 02:51:18,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 02:51:18,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 02:51:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844881938] [2023-12-24 02:51:18,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844881938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 02:51:18,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 02:51:18,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 02:51:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920871921] [2023-12-24 02:51:18,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 02:51:18,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 02:51:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 02:51:18,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 02:51:18,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 02:51:18,538 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:51:22,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 02:51:26,780 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 [] [2023-12-24 02:51:26,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 02:51:26,868 INFO L93 Difference]: Finished difference Result 197 states and 269 transitions. [2023-12-24 02:51:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 02:51:26,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 73 [2023-12-24 02:51:26,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 02:51:26,870 INFO L225 Difference]: With dead ends: 197 [2023-12-24 02:51:26,870 INFO L226 Difference]: Without dead ends: 99 [2023-12-24 02:51:26,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 02:51:26,872 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-24 02:51:26,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2023-12-24 02:51:26,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-24 02:51:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-24 02:51:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-24 02:51:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2023-12-24 02:51:26,886 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2023-12-24 02:51:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 02:51:26,887 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2023-12-24 02:51:26,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-24 02:51:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2023-12-24 02:51:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-24 02:51:26,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 02:51:26,888 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 02:51:26,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 02:51:27,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 02:51:27,106 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 02:51:27,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 02:51:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash -576331342, now seen corresponding path program 1 times [2023-12-24 02:51:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 02:51:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149050012] [2023-12-24 02:51:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 02:51:27,107 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:51:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 02:51:27,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 02:51:27,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 02:51:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 02:51:27,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 02:51:27,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 02:52:26,221 WARN L293 SmtUtils]: Spent 11.96s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 02:53:15,872 WARN L293 SmtUtils]: Spent 15.10s 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:53:24,139 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:53:32,187 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:53:40,342 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:53:48,519 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:53:56,726 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:03,784 WARN L293 SmtUtils]: Spent 7.06s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:09,229 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:17,445 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:25,646 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:33,849 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:42,051 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:54:50,254 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:02,548 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:10,755 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:18,963 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:25,754 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:34,121 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:45,961 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:55:54,172 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:01,987 WARN L293 SmtUtils]: Spent 7.81s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:10,210 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:18,444 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:29,773 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:37,984 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:43,048 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:51,263 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:56:59,267 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:57:07,478 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 02:57:11,540 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse11 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse11))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse11)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (and (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 .cse3))) (= c_~var_1_15~0 c_~var_1_13~0) (= (_ bv1 8) c_~last_1_var_1_1~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (and (fp.leq c_~var_1_7~0 .cse3) (fp.geq c_~var_1_7~0 .cse2))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse4 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse4 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse4) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse9 (bvadd (_ bv4294967291 32) c_~var_1_13~0))) (let ((.cse7 (bvsgt .cse9 c_~var_1_14~0)) (.cse5 (= c_~last_1_var_1_15~0 c_~var_1_11~0))) (or (and (let ((.cse6 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse5 .cse6) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse6)))) (not .cse7)) (and .cse7 (let ((.cse8 (bvslt c_~last_1_var_1_15~0 .cse9))) (or (and (not .cse8) (= c_~var_1_13~0 (bvadd c_~var_1_11~0 (_ bv5 32)))) (and .cse5 .cse8)))))))))) is different from false