/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_codestructure_dependencies_file-26.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 19:44:43,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 19:44:43,576 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-22 19:44:43,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 19:44:43,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 19:44:43,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 19:44:43,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 19:44:43,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 19:44:43,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 19:44:43,625 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 19:44:43,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 19:44:43,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 19:44:43,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 19:44:43,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 19:44:43,628 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 19:44:43,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 19:44:43,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 19:44:43,629 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 19:44:43,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 19:44:43,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 19:44:43,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 19:44:43,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 19:44:43,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 19:44:43,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 19:44:43,630 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 19:44:43,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 19:44:43,631 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 19:44:43,631 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 19:44:43,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 19:44:43,631 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 19:44:43,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 19:44:43,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 19:44:43,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 19:44:43,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 19:44:43,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 19:44:43,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 19:44:43,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 19:44:43,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 19:44:43,634 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 19:44:43,634 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 19:44:43,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 19:44:43,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 19:44:43,635 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 19:44:43,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 19:44:43,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 19:44:43,636 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 19:44:43,636 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-22 19:44:43,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 19:44:43,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 19:44:43,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 19:44:43,867 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 19:44:43,867 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 19:44:43,869 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-26.i [2023-12-22 19:44:45,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 19:44:45,287 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 19:44:45,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-26.i [2023-12-22 19:44:45,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91e6f097/f4c26e5e2baf48278280faf55233794b/FLAGd5cee86f8 [2023-12-22 19:44:45,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91e6f097/f4c26e5e2baf48278280faf55233794b [2023-12-22 19:44:45,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 19:44:45,323 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 19:44:45,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 19:44:45,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 19:44:45,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 19:44:45,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3561a523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45, skipping insertion in model container [2023-12-22 19:44:45,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,369 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 19:44:45,504 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_codestructure_dependencies_file-26.i[919,932] [2023-12-22 19:44:45,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 19:44:45,564 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 19:44:45,573 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_codestructure_dependencies_file-26.i[919,932] [2023-12-22 19:44:45,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 19:44:45,621 INFO L206 MainTranslator]: Completed translation [2023-12-22 19:44:45,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45 WrapperNode [2023-12-22 19:44:45,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 19:44:45,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 19:44:45,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 19:44:45,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 19:44:45,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,665 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2023-12-22 19:44:45,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 19:44:45,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 19:44:45,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 19:44:45,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 19:44:45,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,694 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-22 19:44:45,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 19:44:45,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 19:44:45,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 19:44:45,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 19:44:45,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (1/1) ... [2023-12-22 19:44:45,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 19:44:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 19:44:45,745 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-22 19:44:45,771 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-22 19:44:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 19:44:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 19:44:45,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-22 19:44:45,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-22 19:44:45,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 19:44:45,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 19:44:45,846 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 19:44:45,848 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 19:44:59,665 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 19:44:59,732 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 19:44:59,732 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 19:44:59,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:44:59 BoogieIcfgContainer [2023-12-22 19:44:59,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 19:44:59,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 19:44:59,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 19:44:59,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 19:44:59,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:44:45" (1/3) ... [2023-12-22 19:44:59,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fe768d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:44:59, skipping insertion in model container [2023-12-22 19:44:59,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:44:45" (2/3) ... [2023-12-22 19:44:59,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fe768d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:44:59, skipping insertion in model container [2023-12-22 19:44:59,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:44:59" (3/3) ... [2023-12-22 19:44:59,740 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-26.i [2023-12-22 19:44:59,754 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 19:44:59,754 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 19:44:59,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 19:44:59,797 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;@a696c0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 19:44:59,797 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 19:44:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-22 19:44:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-22 19:44:59,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 19:44:59,821 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:44:59,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 19:44:59,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 19:44:59,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1120218159, now seen corresponding path program 1 times [2023-12-22 19:44:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 19:44:59,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976452446] [2023-12-22 19:44:59,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 19:44:59,839 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-22 19:44:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 19:44:59,840 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-22 19:44:59,844 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-22 19:45:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 19:45:00,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 19:45:00,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 19:45:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2023-12-22 19:45:00,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 19:45:00,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 19:45:00,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976452446] [2023-12-22 19:45:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976452446] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 19:45:00,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 19:45:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 19:45:00,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580508098] [2023-12-22 19:45:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 19:45:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 19:45:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 19:45:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 19:45:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 19:45:00,753 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-22 19:45:01,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:06,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 19:45:06,668 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2023-12-22 19:45:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 19:45:06,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 111 [2023-12-22 19:45:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 19:45:06,935 INFO L225 Difference]: With dead ends: 99 [2023-12-22 19:45:06,935 INFO L226 Difference]: Without dead ends: 49 [2023-12-22 19:45:06,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-22 19:45:06,940 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-22 19:45:06,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2023-12-22 19:45:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-22 19:45:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-22 19:45:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-22 19:45:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 76 transitions. [2023-12-22 19:45:06,976 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 76 transitions. Word has length 111 [2023-12-22 19:45:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 19:45:06,976 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 76 transitions. [2023-12-22 19:45:06,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-22 19:45:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 76 transitions. [2023-12-22 19:45:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-22 19:45:06,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 19:45:06,979 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:45:07,015 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-22 19:45:07,192 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-22 19:45:07,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 19:45:07,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 19:45:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -26933837, now seen corresponding path program 1 times [2023-12-22 19:45:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 19:45:07,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773877953] [2023-12-22 19:45:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 19:45:07,195 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-22 19:45:07,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 19:45:07,196 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-22 19:45:07,199 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-22 19:45:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 19:45:08,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 19:45:08,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 19:45:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-22 19:45:08,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 19:45:08,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 19:45:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773877953] [2023-12-22 19:45:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773877953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 19:45:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 19:45:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 19:45:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009482419] [2023-12-22 19:45:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 19:45:08,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 19:45:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 19:45:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 19:45:08,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 19:45:08,177 INFO L87 Difference]: Start difference. First operand 49 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-22 19:45:12,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:16,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:21,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:25,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:29,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:33,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 19:45:33,131 INFO L93 Difference]: Finished difference Result 119 states and 183 transitions. [2023-12-22 19:45:33,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 19:45:33,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-12-22 19:45:33,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 19:45:33,134 INFO L225 Difference]: With dead ends: 119 [2023-12-22 19:45:33,134 INFO L226 Difference]: Without dead ends: 71 [2023-12-22 19:45:33,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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-22 19:45:33,136 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 29 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-12-22 19:45:33,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 148 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 5 Unknown, 0 Unchecked, 24.9s Time] [2023-12-22 19:45:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-22 19:45:33,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-12-22 19:45:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-22 19:45:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2023-12-22 19:45:33,151 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 111 [2023-12-22 19:45:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 19:45:33,151 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2023-12-22 19:45:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-22 19:45:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2023-12-22 19:45:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-22 19:45:33,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 19:45:33,154 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:45:33,184 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-22 19:45:33,368 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-22 19:45:33,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 19:45:33,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 19:45:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1524997587, now seen corresponding path program 1 times [2023-12-22 19:45:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 19:45:33,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346053002] [2023-12-22 19:45:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 19:45:33,370 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-22 19:45:33,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 19:45:33,372 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-22 19:45:33,373 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-22 19:45:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 19:45:34,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 19:45:34,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 19:45:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-22 19:45:35,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 19:45:35,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 19:45:35,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346053002] [2023-12-22 19:45:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346053002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 19:45:35,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 19:45:35,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 19:45:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389701842] [2023-12-22 19:45:35,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 19:45:35,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 19:45:35,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 19:45:35,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 19:45:35,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 19:45:35,989 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-22 19:45:41,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:45,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:49,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:50,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:54,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:45:59,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:46:03,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:46:07,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:46:08,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 19:46:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 19:46:08,632 INFO L93 Difference]: Finished difference Result 204 states and 316 transitions. [2023-12-22 19:46:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 19:46:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2023-12-22 19:46:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 19:46:08,636 INFO L225 Difference]: With dead ends: 204 [2023-12-22 19:46:08,636 INFO L226 Difference]: Without dead ends: 137 [2023-12-22 19:46:08,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-22 19:46:08,638 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 37 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.6s IncrementalHoareTripleChecker+Time [2023-12-22 19:46:08,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 210 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 32.6s Time] [2023-12-22 19:46:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-22 19:46:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2023-12-22 19:46:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-22 19:46:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 186 transitions. [2023-12-22 19:46:08,675 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 186 transitions. Word has length 112 [2023-12-22 19:46:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 19:46:08,676 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 186 transitions. [2023-12-22 19:46:08,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-22 19:46:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 186 transitions. [2023-12-22 19:46:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-22 19:46:08,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 19:46:08,678 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 19:46:08,703 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-22 19:46:08,892 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-22 19:46:08,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 19:46:08,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 19:46:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash 250009775, now seen corresponding path program 1 times [2023-12-22 19:46:08,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 19:46:08,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381580498] [2023-12-22 19:46:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 19:46:08,894 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-22 19:46:08,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 19:46:08,895 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-22 19:46:08,896 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-22 19:46:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 19:46:09,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-22 19:46:09,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 19:46:29,199 WARN L293 SmtUtils]: Spent 8.89s 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-22 19:46:38,083 WARN L293 SmtUtils]: Spent 8.88s 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-22 19:46:46,989 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:46:55,510 WARN L293 SmtUtils]: Spent 8.52s 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-22 19:47:04,421 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:47:13,332 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:47:22,239 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:47:31,149 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:47:40,086 WARN L293 SmtUtils]: Spent 8.94s 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-22 19:47:49,010 WARN L293 SmtUtils]: Spent 8.92s 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-22 19:47:57,915 WARN L293 SmtUtils]: Spent 8.90s 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-22 19:48:06,849 WARN L293 SmtUtils]: Spent 8.93s 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-22 19:48:15,772 WARN L293 SmtUtils]: Spent 8.92s 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-22 19:48:20,042 WARN L854 $PredicateComparison]: unable to prove that (and (= c_~var_1_22~0 c_~var_1_24~0) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_25~0) (not (= c_~var_1_10~0 (_ bv0 8))) (= c_~var_1_9~0 c_~var_1_11~0) (= ((_ zero_extend 8) c_~last_1_var_1_22~0) c_~var_1_12~0) (= (_ bv10000 16) c_~last_1_var_1_12~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0))) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1)))) (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0))))) (= c_~var_1_20~0 c_~var_1_21~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_26~0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_13~0)))) is different from false [2023-12-22 19:48:24,290 WARN L876 $PredicateComparison]: unable to prove that (and (= c_~var_1_22~0 c_~var_1_24~0) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_25~0) (not (= c_~var_1_10~0 (_ bv0 8))) (= c_~var_1_9~0 c_~var_1_11~0) (= ((_ zero_extend 8) c_~last_1_var_1_22~0) c_~var_1_12~0) (= (_ bv10000 16) c_~last_1_var_1_12~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse0))) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1)))) (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0))))) (= c_~var_1_20~0 c_~var_1_21~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_26~0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_13~0)))) is different from true [2023-12-22 19:48:33,305 WARN L293 SmtUtils]: Spent 8.98s 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-22 19:48:42,237 WARN L293 SmtUtils]: Spent 8.93s 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-22 19:48:51,289 WARN L293 SmtUtils]: Spent 9.05s 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-22 19:48:59,817 WARN L293 SmtUtils]: Spent 8.53s 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-22 19:49:08,752 WARN L293 SmtUtils]: Spent 8.93s 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-22 19:49:17,675 WARN L293 SmtUtils]: Spent 8.92s 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-22 19:49:26,587 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:49:35,519 WARN L293 SmtUtils]: Spent 8.93s 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-22 19:49:44,434 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:49:53,356 WARN L293 SmtUtils]: Spent 8.92s 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-22 19:50:02,277 WARN L293 SmtUtils]: Spent 8.92s 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-22 19:50:11,210 WARN L293 SmtUtils]: Spent 8.93s 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-22 19:50:20,146 WARN L293 SmtUtils]: Spent 8.94s 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-22 19:50:27,477 WARN L293 SmtUtils]: Spent 7.33s 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-22 19:50:36,392 WARN L293 SmtUtils]: Spent 8.91s 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-22 19:50:45,314 WARN L293 SmtUtils]: Spent 8.92s 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-22 19:50:54,246 WARN L293 SmtUtils]: Spent 8.93s 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-22 19:50:58,507 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ zero_extend 16) c_~var_1_12~0)) (.cse1 ((_ zero_extend 24) c_~var_1_22~0))) (let ((.cse0 (bvslt .cse2 .cse1))) (or (and .cse0 (= c_~var_1_1~0 (bvadd .cse1 .cse2))) (and (= c_~var_1_1~0 (bvmul .cse1 (_ bv2 32))) (not .cse0))))) (= c_~var_1_22~0 c_~var_1_24~0) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_25~0) (not (= c_~var_1_10~0 (_ bv0 8))) (= c_~var_1_9~0 c_~var_1_11~0) (= ((_ zero_extend 8) c_~last_1_var_1_22~0) c_~var_1_12~0) (= (_ bv10000 16) c_~last_1_var_1_12~0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4)))) (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3))))) (= c_~var_1_20~0 c_~var_1_21~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_26~0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_13~0)))) is different from false [2023-12-22 19:51:02,777 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ zero_extend 16) c_~var_1_12~0)) (.cse1 ((_ zero_extend 24) c_~var_1_22~0))) (let ((.cse0 (bvslt .cse2 .cse1))) (or (and .cse0 (= c_~var_1_1~0 (bvadd .cse1 .cse2))) (and (= c_~var_1_1~0 (bvmul .cse1 (_ bv2 32))) (not .cse0))))) (= c_~var_1_22~0 c_~var_1_24~0) (= ((_ sign_extend 8) c_~var_1_11~0) c_~var_1_25~0) (not (= c_~var_1_10~0 (_ bv0 8))) (= c_~var_1_9~0 c_~var_1_11~0) (= ((_ zero_extend 8) c_~last_1_var_1_22~0) c_~var_1_12~0) (= (_ bv10000 16) c_~last_1_var_1_12~0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse4)))) (and (fp.geq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse4)) (fp.leq c_~var_1_21~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3))))) (= c_~var_1_20~0 c_~var_1_21~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_26~0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_13~0)))) is different from true