/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.5-dev-17387ad-m
[2024-11-06 00:27:24,192 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-06 00:27:24,278 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-06 00:27:24,284 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 00:27:24,285 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 00:27:24,319 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 00:27:24,320 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 00:27:24,322 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 00:27:24,322 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 00:27:24,324 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-06 00:27:24,324 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 00:27:24,325 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 00:27:24,325 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 00:27:24,326 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-06 00:27:24,328 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-06 00:27:24,328 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 00:27:24,329 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-06 00:27:24,329 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-06 00:27:24,329 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-06 00:27:24,330 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-06 00:27:24,330 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 00:27:24,334 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 00:27:24,334 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 00:27:24,335 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-06 00:27:24,335 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-06 00:27:24,335 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-06 00:27:24,335 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-06 00:27:24,336 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-06 00:27:24,336 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-06 00:27:24,336 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-06 00:27:24,336 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 00:27:24,337 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-06 00:27:24,337 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 00:27:24,337 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-06 00:27:24,337 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:27:24,338 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 00:27:24,338 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 00:27:24,338 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 00:27:24,338 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-06 00:27:24,339 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-06 00:27:24,339 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 00:27:24,339 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 00:27:24,340 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 00:27:24,340 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 00:27:24,340 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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF
[2024-11-06 00:27:24,578 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 00:27:24,607 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 00:27:24,610 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 00:27:24,611 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-06 00:27:24,612 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-06 00:27:24,614 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c
[2024-11-06 00:27:26,164 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-06 00:27:26,360 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-06 00:27:26,361 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c
[2024-11-06 00:27:26,369 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028763624/8962a95d78624d9dbfc03b3e9261659b/FLAG0b59b570e
[2024-11-06 00:27:26,392 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/028763624/8962a95d78624d9dbfc03b3e9261659b
[2024-11-06 00:27:26,395 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 00:27:26,396 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-11-06 00:27:26,397 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 00:27:26,398 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 00:27:26,406 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 00:27:26,407 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,408 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e44ec37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26, skipping insertion in model container
[2024-11-06 00:27:26,408 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,435 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-06 00:27:26,610 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712]
[2024-11-06 00:27:26,616 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:27:26,632 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-06 00:27:26,644 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712]
[2024-11-06 00:27:26,645 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-06 00:27:26,661 INFO  L204         MainTranslator]: Completed translation
[2024-11-06 00:27:26,661 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26 WrapperNode
[2024-11-06 00:27:26,662 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 00:27:26,663 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 00:27:26,663 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 00:27:26,663 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 00:27:26,671 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,685 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,707 INFO  L138                Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29
[2024-11-06 00:27:26,707 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 00:27:26,708 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 00:27:26,708 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 00:27:26,708 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 00:27:26,718 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,718 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,721 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,735 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].
[2024-11-06 00:27:26,736 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,736 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,741 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,743 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,744 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,745 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,748 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 00:27:26,749 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 00:27:26,749 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 00:27:26,749 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-06 00:27:26,750 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (1/1) ...
[2024-11-06 00:27:26,757 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 00:27:26,769 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 00:27:26,786 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)
[2024-11-06 00:27:26,794 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
[2024-11-06 00:27:26,821 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 00:27:26,821 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 00:27:26,821 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 00:27:26,821 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-06 00:27:26,896 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-06 00:27:26,901 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 00:27:35,315 INFO  L?                        ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2024-11-06 00:27:35,316 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-06 00:27:35,327 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 00:27:35,327 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-06 00:27:35,328 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:27:35 BoogieIcfgContainer
[2024-11-06 00:27:35,328 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 00:27:35,331 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 00:27:35,332 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 00:27:35,336 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-06 00:27:35,337 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:27:26" (1/3) ...
[2024-11-06 00:27:35,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea777c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:27:35, skipping insertion in model container
[2024-11-06 00:27:35,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:27:26" (2/3) ...
[2024-11-06 00:27:35,338 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea777c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:27:35, skipping insertion in model container
[2024-11-06 00:27:35,338 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:27:35" (3/3) ...
[2024-11-06 00:27:35,340 INFO  L112   eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c
[2024-11-06 00:27:35,360 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 00:27:35,360 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 00:27:35,436 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 00:27:35,449 INFO  L333      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, 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;@3921a14a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 00:27:35,449 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 00:27:35,456 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:27:35,462 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-06 00:27:35,462 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:27:35,463 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-06 00:27:35,464 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:27:35,470 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:27:35,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times
[2024-11-06 00:27:35,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:27:35,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007304914]
[2024-11-06 00:27:35,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:27:35,483 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
[2024-11-06 00:27:35,484 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:27:35,488 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)
[2024-11-06 00:27:35,490 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
[2024-11-06 00:27:36,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:27:36,249 INFO  L255         TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-06 00:27:36,253 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:27:44,608 WARN  L286               SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-06 00:27:48,721 WARN  L873   $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))))) is different from true
[2024-11-06 00:27:48,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 00:27:48,729 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 00:27:48,730 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:27:48,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007304914]
[2024-11-06 00:27:48,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007304914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 00:27:48,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 00:27:48,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 00:27:48,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782512509]
[2024-11-06 00:27:48,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 00:27:48,737 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 00:27:48,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:27:48,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 00:27:48,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12
[2024-11-06 00:27:48,784 INFO  L87              Difference]: Start difference. First operand  has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:27:53,147 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:27:57,328 WARN  L873   $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-06 00:28:01,631 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:28:01,756 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:28:01,757 INFO  L93              Difference]: Finished difference Result 16 states and 18 transitions.
[2024-11-06 00:28:01,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-06 00:28:01,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-06 00:28:01,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:28:01,766 INFO  L225             Difference]: With dead ends: 16
[2024-11-06 00:28:01,766 INFO  L226             Difference]: Without dead ends: 7
[2024-11-06 00:28:01,768 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20
[2024-11-06 00:28:01,772 INFO  L432           NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time
[2024-11-06 00:28:01,773 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 2 Unknown, 11 Unchecked, 8.8s Time]
[2024-11-06 00:28:01,788 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7 states.
[2024-11-06 00:28:01,799 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2024-11-06 00:28:01,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:28:01,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions.
[2024-11-06 00:28:01,803 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5
[2024-11-06 00:28:01,804 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:28:01,804 INFO  L471      AbstractCegarLoop]: Abstraction has 7 states and 7 transitions.
[2024-11-06 00:28:01,804 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:28:01,805 INFO  L276                IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions.
[2024-11-06 00:28:01,805 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2024-11-06 00:28:01,805 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:28:01,805 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-11-06 00:28:01,837 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
[2024-11-06 00:28:02,006 WARN  L453      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
[2024-11-06 00:28:02,007 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:28:02,008 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:28:02,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times
[2024-11-06 00:28:02,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:28:02,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297770776]
[2024-11-06 00:28:02,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 00:28:02,009 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
[2024-11-06 00:28:02,009 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:28:02,012 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)
[2024-11-06 00:28:02,016 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
[2024-11-06 00:28:03,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 00:28:03,505 INFO  L255         TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-06 00:28:03,506 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 00:28:17,162 WARN  L873   $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))))) is different from true
[2024-11-06 00:28:17,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-11-06 00:28:17,168 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-06 00:28:25,578 WARN  L286               SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-06 00:28:29,720 WARN  L851   $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from false
[2024-11-06 00:28:33,847 WARN  L873   $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) |c_ULTIMATE.start_main_~main__x1~0#1|)) is different from true
[2024-11-06 00:28:42,256 WARN  L286               SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-06 00:28:46,433 WARN  L851   $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false
[2024-11-06 00:28:50,604 WARN  L873   $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true
[2024-11-06 00:28:50,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-11-06 00:28:50,605 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-06 00:28:50,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297770776]
[2024-11-06 00:28:50,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [297770776] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-06 00:28:50,605 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-06 00:28:50,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7
[2024-11-06 00:28:50,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988772236]
[2024-11-06 00:28:50,606 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-06 00:28:50,607 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-06 00:28:50,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-06 00:28:50,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-06 00:28:50,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56
[2024-11-06 00:28:50,608 INFO  L87              Difference]: Start difference. First operand 7 states and 7 transitions. Second operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:28:54,852 WARN  L873   $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true
[2024-11-06 00:28:58,917 WARN  L851   $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2024-11-06 00:29:03,114 WARN  L873   $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__x1~0#1|) .cse0)) |c_ULTIMATE.start_main_~main__x1~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2024-11-06 00:29:07,213 WARN  L873   $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) |c_ULTIMATE.start_main_~main__x~0#1|) (= |c_ULTIMATE.start_main_~main__x1~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven |c_ULTIMATE.start_main_~main__x~0#1|) .cse0))) (not (fp.eq |c_ULTIMATE.start_main_~main__x1~0#1| |c_ULTIMATE.start_main_~main__x~0#1|)))) is different from true
[2024-11-06 00:29:11,395 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-06 00:29:11,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 00:29:11,740 INFO  L93              Difference]: Finished difference Result 11 states and 11 transitions.
[2024-11-06 00:29:11,740 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-06 00:29:11,741 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6
[2024-11-06 00:29:11,741 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 00:29:11,741 INFO  L225             Difference]: With dead ends: 11
[2024-11-06 00:29:11,741 INFO  L226             Difference]: Without dead ends: 8
[2024-11-06 00:29:11,742 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.2s TimeCoverageRelationStatistics Valid=20, Invalid=15, Unknown=9, NotChecked=66, Total=110
[2024-11-06 00:29:11,742 INFO  L432           NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time
[2024-11-06 00:29:11,743 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 31 Unchecked, 4.6s Time]
[2024-11-06 00:29:11,743 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8 states.
[2024-11-06 00:29:11,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8.
[2024-11-06 00:29:11,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:29:11,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions.
[2024-11-06 00:29:11,746 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6
[2024-11-06 00:29:11,746 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-06 00:29:11,746 INFO  L471      AbstractCegarLoop]: Abstraction has 8 states and 8 transitions.
[2024-11-06 00:29:11,747 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 00:29:11,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions.
[2024-11-06 00:29:11,747 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-11-06 00:29:11,747 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-06 00:29:11,747 INFO  L215           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1]
[2024-11-06 00:29:11,782 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-06 00:29:11,948 WARN  L453      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
[2024-11-06 00:29:11,948 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 00:29:11,949 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 00:29:11,949 INFO  L85        PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times
[2024-11-06 00:29:11,949 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-06 00:29:11,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831409151]
[2024-11-06 00:29:11,950 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-06 00:29:11,950 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
[2024-11-06 00:29:11,950 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-06 00:29:11,952 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)
[2024-11-06 00:29:11,953 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
[2024-11-06 00:29:14,151 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-06 00:29:14,151 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-06 00:29:14,230 INFO  L255         TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-06 00:29:14,233 INFO  L278         TraceCheckSpWp]: Computing forward predicates...