./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version c4f91361
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-c4f9136-m
[2023-11-23 14:56:56,283 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-23 14:56:56,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2023-11-23 14:56:56,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-23 14:56:56,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-23 14:56:56,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-23 14:56:56,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-23 14:56:56,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-23 14:56:56,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-23 14:56:56,344 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-23 14:56:56,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-23 14:56:56,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-23 14:56:56,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-23 14:56:56,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-23 14:56:56,345 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-23 14:56:56,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-23 14:56:56,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-23 14:56:56,346 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-23 14:56:56,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-23 14:56:56,347 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-23 14:56:56,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-23 14:56:56,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-23 14:56:56,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-23 14:56:56,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-23 14:56:56,348 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-23 14:56:56,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-23 14:56:56,349 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-23 14:56:56,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-23 14:56:56,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-23 14:56:56,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-23 14:56:56,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-23 14:56:56,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:56:56,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-23 14:56:56,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-23 14:56:56,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-23 14:56:56,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-23 14:56:56,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-23 14:56:56,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-23 14:56:56,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-23 14:56:56,351 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-23 14:56:56,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-23 14:56:56,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-23 14:56:56,352 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: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc
[2023-11-23 14:56:56,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-23 14:56:56,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-23 14:56:56,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-23 14:56:56,648 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-23 14:56:56,660 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-23 14:56:56,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c
[2023-11-23 14:56:57,693 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-23 14:56:57,855 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-23 14:56:57,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c
[2023-11-23 14:56:57,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38581731c/d33965ebc4984c9a92e8babda43e78c6/FLAG294aa7eb6
[2023-11-23 14:56:57,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38581731c/d33965ebc4984c9a92e8babda43e78c6
[2023-11-23 14:56:57,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-23 14:56:57,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-23 14:56:57,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-23 14:56:57,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-23 14:56:57,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-23 14:56:57,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:57" (1/1) ...
[2023-11-23 14:56:57,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be4b2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:57, skipping insertion in model container
[2023-11-23 14:56:57,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:56:57" (1/1) ...
[2023-11-23 14:56:57,907 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-23 14:56:58,029 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c[472,485]
[2023-11-23 14:56:58,046 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:56:58,054 INFO L202 MainTranslator]: Completed pre-run
[2023-11-23 14:56:58,068 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c[472,485]
[2023-11-23 14:56:58,077 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:56:58,088 INFO L206 MainTranslator]: Completed translation
[2023-11-23 14:56:58,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58 WrapperNode
[2023-11-23 14:56:58,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-23 14:56:58,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-23 14:56:58,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-23 14:56:58,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-23 14:56:58,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,149 INFO L138 Inliner]: procedures = 15, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62
[2023-11-23 14:56:58,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-23 14:56:58,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-23 14:56:58,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-23 14:56:58,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-23 14:56:58,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,185 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0].
[2023-11-23 14:56:58,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-23 14:56:58,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-23 14:56:58,195 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-23 14:56:58,195 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-23 14:56:58,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (1/1) ...
[2023-11-23 14:56:58,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:56:58,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-23 14:56:58,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-23 14:56:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-23 14:56:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-23 14:56:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2023-11-23 14:56:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2023-11-23 14:56:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-23 14:56:58,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-23 14:56:58,307 INFO L241 CfgBuilder]: Building ICFG
[2023-11-23 14:56:58,309 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-23 14:56:58,394 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-23 14:56:58,413 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-23 14:56:58,413 INFO L309 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-23 14:56:58,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:58 BoogieIcfgContainer
[2023-11-23 14:56:58,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-23 14:56:58,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-23 14:56:58,416 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-23 14:56:58,419 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-23 14:56:58,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:56:57" (1/3) ...
[2023-11-23 14:56:58,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffa17e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:58, skipping insertion in model container
[2023-11-23 14:56:58,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:56:58" (2/3) ...
[2023-11-23 14:56:58,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffa17e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:56:58, skipping insertion in model container
[2023-11-23 14:56:58,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:58" (3/3) ...
[2023-11-23 14:56:58,422 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3.c
[2023-11-23 14:56:58,436 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-23 14:56:58,436 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-23 14:56:58,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-23 14:56:58,476 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;@599ae9cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-23 14:56:58,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-23 14:56:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 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)
[2023-11-23 14:56:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2023-11-23 14:56:58,484 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:56:58,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-23 14:56:58,486 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:56:58,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:56:58,491 INFO L85 PathProgramCache]: Analyzing trace with hash 515220282, now seen corresponding path program 1 times
[2023-11-23 14:56:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-23 14:56:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902942618]
[2023-11-23 14:56:58,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:56:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-23 14:56:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-23 14:56:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-23 14:56:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-23 14:56:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902942618]
[2023-11-23 14:56:58,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902942618] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-23 14:56:58,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-23 14:56:58,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-23 14:56:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025689940]
[2023-11-23 14:56:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-23 14:56:58,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-23 14:56:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-23 14:56:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-23 14:56:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-23 14:56:58,642 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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)
[2023-11-23 14:56:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-23 14:56:58,656 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions.
[2023-11-23 14:56:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-23 14:56:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Word has length 7
[2023-11-23 14:56:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-23 14:56:58,663 INFO L225 Difference]: With dead ends: 20
[2023-11-23 14:56:58,663 INFO L226 Difference]: Without dead ends: 9
[2023-11-23 14:56:58,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11-23 14:56:58,667 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-23 14:56:58,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-23 14:56:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2023-11-23 14:56:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2023-11-23 14:56:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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)
[2023-11-23 14:56:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2023-11-23 14:56:58,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7
[2023-11-23 14:56:58,718 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-23 14:56:58,718 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2023-11-23 14:56:58,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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)
[2023-11-23 14:56:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2023-11-23 14:56:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2023-11-23 14:56:58,719 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:56:58,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-23 14:56:58,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-23 14:56:58,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:56:58,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:56:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash 568632303, now seen corresponding path program 1 times
[2023-11-23 14:56:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-23 14:56:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390554956]
[2023-11-23 14:56:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:56:58,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-23 14:56:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-23 14:56:58,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-23 14:56:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-23 14:56:58,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-23 14:56:58,820 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-23 14:56:58,821 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2023-11-23 14:56:58,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-23 14:56:58,826 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1]
[2023-11-23 14:56:58,828 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-23 14:56:58,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:56:58 BoogieIcfgContainer
[2023-11-23 14:56:58,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-23 14:56:58,852 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-23 14:56:58,852 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-23 14:56:58,852 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-23 14:56:58,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:56:58" (3/4) ...
[2023-11-23 14:56:58,854 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-23 14:56:58,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-23 14:56:58,856 INFO L158 Benchmark]: Toolchain (without parser) took 976.41ms. Allocated memory was 138.4MB in the beginning and 230.7MB in the end (delta: 92.3MB). Free memory was 82.1MB in the beginning and 162.0MB in the end (delta: -79.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB.
[2023-11-23 14:56:58,857 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-23 14:56:58,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.41ms. Allocated memory is still 138.4MB. Free memory was 81.9MB in the beginning and 71.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2023-11-23 14:56:58,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.99ms. Allocated memory was 138.4MB in the beginning and 230.7MB in the end (delta: 92.3MB). Free memory was 71.0MB in the beginning and 200.6MB in the end (delta: -129.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB.
[2023-11-23 14:56:58,861 INFO L158 Benchmark]: Boogie Preprocessor took 44.18ms. Allocated memory is still 230.7MB. Free memory was 200.6MB in the beginning and 199.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-23 14:56:58,861 INFO L158 Benchmark]: RCFGBuilder took 219.57ms. Allocated memory is still 230.7MB. Free memory was 199.0MB in the beginning and 187.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2023-11-23 14:56:58,862 INFO L158 Benchmark]: TraceAbstraction took 434.89ms. Allocated memory is still 230.7MB. Free memory was 187.1MB in the beginning and 162.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2023-11-23 14:56:58,862 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 230.7MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-23 14:56:58,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 208.41ms. Allocated memory is still 138.4MB. Free memory was 81.9MB in the beginning and 71.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 59.99ms. Allocated memory was 138.4MB in the beginning and 230.7MB in the end (delta: 92.3MB). Free memory was 71.0MB in the beginning and 200.6MB in the end (delta: -129.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 44.18ms. Allocated memory is still 230.7MB. Free memory was 200.6MB in the beginning and 199.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 219.57ms. Allocated memory is still 230.7MB. Free memory was 199.0MB in the beginning and 187.8MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 434.89ms. Allocated memory is still 230.7MB. Free memory was 187.1MB in the beginning and 162.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Witness Printer took 3.43ms. Allocated memory is still 230.7MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 13]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of to_real at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 34.
Possible FailurePath:
[L15] float pi = 3.14159 ;
[L21] float x = __VERIFIER_nondet_float() ;
[L22] float octant1 = 0 ;
[L23] float octant2 = pi/8 ;
[L24] CALL assume_abort_if_not(x > octant1 && x < octant2)
[L11] COND FALSE !(!cond)
VAL [\old(cond)=1, cond=1, pi=314159/100000]
[L24] RET assume_abort_if_not(x > octant1 && x < octant2)
[L25] float oddExp = x ;
[L26] float evenExp = 1.0 ;
[L27] float term = x ;
[L28] unsigned int count = 2 ;
[L29] int multFactor = 0 ;
[L30] int temp ;
VAL [count=2, evenExp=1, multFactor=0, oddExp=119, pi=314159/100000, term=119, x=119]
[L32] COND TRUE 1
[L34] term = term * (x/count)
[L35] multFactor = (count>>1 % 2 == 0) ? 1 : -1
[L37] evenExp = evenExp + multFactor*term
[L39] count++
[L41] term = term * (x/count)
[L43] oddExp = oddExp + multFactor*term
[L45] count++
[L47] temp = __VERIFIER_nondet_int()
[L48] COND TRUE temp == 0
VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=119]
[L51] CALL __VERIFIER_assert( evenExp >= oddExp )
[L13] COND TRUE !(cond)
VAL [\old(cond)=0, cond=0, pi=314159/100000]
[L13] reach_error()
VAL [\old(cond)=0, cond=0, pi=314159/100000]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 9 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-11-23 14:56:58,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-c4f9136-m
[2023-11-23 14:57:00,868 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-23 14:57:00,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2023-11-23 14:57:00,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-23 14:57:00,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-23 14:57:00,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-23 14:57:00,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-23 14:57:00,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-23 14:57:00,981 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2023-11-23 14:57:00,981 INFO L153 SettingsManager]: * Use memory slicer=true
[2023-11-23 14:57:00,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-23 14:57:00,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-23 14:57:00,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-23 14:57:00,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-23 14:57:00,986 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-23 14:57:00,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-23 14:57:00,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-11-23 14:57:00,988 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-23 14:57:00,988 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-23 14:57:00,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-23 14:57:00,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-11-23 14:57:00,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-23 14:57:00,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-11-23 14:57:00,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-23 14:57:00,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-23 14:57:00,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-23 14:57:00,990 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-23 14:57:00,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-11-23 14:57:00,991 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-23 14:57:00,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-23 14:57:00,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-23 14:57:00,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2023-11-23 14:57:00,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-23 14:57:00,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:57:00,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-23 14:57:00,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-23 14:57:00,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-23 14:57:00,994 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-23 14:57:00,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-23 14:57:00,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-23 14:57:00,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-23 14:57:00,994 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-23 14:57:00,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-23 14:57:00,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-23 14:57:00,995 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-23 14:57:00,995 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: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc
[2023-11-23 14:57:01,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-23 14:57:01,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-23 14:57:01,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-23 14:57:01,305 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-23 14:57:01,305 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-23 14:57:01,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c
[2023-11-23 14:57:02,475 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-23 14:57:02,604 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-23 14:57:02,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c
[2023-11-23 14:57:02,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6771ab183/f17d85407a3e4999be1ac386eca61274/FLAG3f80589ad
[2023-11-23 14:57:02,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6771ab183/f17d85407a3e4999be1ac386eca61274
[2023-11-23 14:57:02,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-23 14:57:02,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-23 14:57:02,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-23 14:57:02,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-23 14:57:02,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-23 14:57:02,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8865bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02, skipping insertion in model container
[2023-11-23 14:57:02,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,655 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-23 14:57:02,801 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c[472,485]
[2023-11-23 14:57:02,822 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:57:02,837 INFO L202 MainTranslator]: Completed pre-run
[2023-11-23 14:57:02,850 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-floats-scientific-comp/loop3.c[472,485]
[2023-11-23 14:57:02,858 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-23 14:57:02,872 INFO L206 MainTranslator]: Completed translation
[2023-11-23 14:57:02,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02 WrapperNode
[2023-11-23 14:57:02,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-23 14:57:02,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-23 14:57:02,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-23 14:57:02,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-23 14:57:02,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,901 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62
[2023-11-23 14:57:02,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-23 14:57:02,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-23 14:57:02,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-23 14:57:02,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-23 14:57:02,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,939 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0].
[2023-11-23 14:57:02,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-23 14:57:02,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-23 14:57:02,961 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-23 14:57:02,962 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-23 14:57:02,962 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (1/1) ...
[2023-11-23 14:57:02,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-23 14:57:02,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-23 14:57:02,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-23 14:57:03,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-23 14:57:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-23 14:57:03,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2023-11-23 14:57:03,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2023-11-23 14:57:03,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-23 14:57:03,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-23 14:57:03,093 INFO L241 CfgBuilder]: Building ICFG
[2023-11-23 14:57:03,096 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-23 14:57:05,530 INFO L282 CfgBuilder]: Performing block encoding
[2023-11-23 14:57:05,548 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-23 14:57:05,548 INFO L309 CfgBuilder]: Removed 1 assume(true) statements.
[2023-11-23 14:57:05,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:05 BoogieIcfgContainer
[2023-11-23 14:57:05,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-23 14:57:05,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-23 14:57:05,550 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-23 14:57:05,553 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-23 14:57:05,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:57:02" (1/3) ...
[2023-11-23 14:57:05,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3c344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:05, skipping insertion in model container
[2023-11-23 14:57:05,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:57:02" (2/3) ...
[2023-11-23 14:57:05,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3c344d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:57:05, skipping insertion in model container
[2023-11-23 14:57:05,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:57:05" (3/3) ...
[2023-11-23 14:57:05,555 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3.c
[2023-11-23 14:57:05,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-23 14:57:05,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-23 14:57:05,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-23 14:57:05,634 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;@5054ef7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-23 14:57:05,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2023-11-23 14:57:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 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)
[2023-11-23 14:57:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2023-11-23 14:57:05,646 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:57:05,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-23 14:57:05,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:57:05,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:57:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 515220282, now seen corresponding path program 1 times
[2023-11-23 14:57:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:57:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588987676]
[2023-11-23 14:57:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:57:05,665 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-11-23 14:57:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:57:05,690 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-11-23 14:57:05,691 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-11-23 14:57:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-23 14:57:05,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-11-23 14:57:05,773 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:57:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-23 14:57:05,792 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-23 14:57:05,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-23 14:57:05,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588987676]
[2023-11-23 14:57:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588987676] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-23 14:57:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-23 14:57:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-23 14:57:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484604388]
[2023-11-23 14:57:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-23 14:57:05,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-23 14:57:05,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-23 14:57:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-23 14:57:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-23 14:57:05,826 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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)
[2023-11-23 14:57:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-23 14:57:05,870 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions.
[2023-11-23 14:57:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-23 14:57:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Word has length 7
[2023-11-23 14:57:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-23 14:57:05,877 INFO L225 Difference]: With dead ends: 20
[2023-11-23 14:57:05,877 INFO L226 Difference]: Without dead ends: 9
[2023-11-23 14:57:05,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-11-23 14:57:05,882 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2023-11-23 14:57:05,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2023-11-23 14:57:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2023-11-23 14:57:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2023-11-23 14:57:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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)
[2023-11-23 14:57:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2023-11-23 14:57:05,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7
[2023-11-23 14:57:05,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-23 14:57:05,904 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2023-11-23 14:57:05,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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)
[2023-11-23 14:57:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2023-11-23 14:57:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2023-11-23 14:57:05,905 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:57:05,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-23 14:57:05,912 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-11-23 14:57:06,109 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-11-23 14:57:06,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:57:06,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:57:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 568632303, now seen corresponding path program 1 times
[2023-11-23 14:57:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:57:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753458351]
[2023-11-23 14:57:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:57:06,114 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-11-23 14:57:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:57:06,130 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-11-23 14:57:06,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-11-23 14:57:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-23 14:57:07,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core
[2023-11-23 14:57:07,794 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:57:27,574 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false
[2023-11-23 14:57:29,611 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true
[2023-11-23 14:58:17,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse7 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false
[2023-11-23 14:58:32,432 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false
[2023-11-23 14:58:34,471 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true
[2023-11-23 14:58:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-23 14:58:34,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-23 14:58:34,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-23 14:58:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753458351]
[2023-11-23 14:58:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753458351] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-23 14:58:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-23 14:58:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-23 14:58:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654733672]
[2023-11-23 14:58:34,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-23 14:58:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-23 14:58:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-23 14:58:34,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-23 14:58:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56
[2023-11-23 14:58:34,474 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second 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)
[2023-11-23 14:58:37,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:58:39,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:58:41,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:58:43,170 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false
[2023-11-23 14:58:45,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:58:47,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:58:49,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2023-11-23 14:58:49,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2023-11-23 14:58:49,471 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2023-11-23 14:58:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-23 14:58:49,563 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 8
[2023-11-23 14:58:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2023-11-23 14:58:49,563 INFO L225 Difference]: With dead ends: 15
[2023-11-23 14:58:49,563 INFO L226 Difference]: Without dead ends: 11
[2023-11-23 14:58:49,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=20, Invalid=20, Unknown=6, NotChecked=44, Total=90
[2023-11-23 14:58:49,564 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time
[2023-11-23 14:58:49,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 6 Unknown, 50 Unchecked, 12.5s Time]
[2023-11-23 14:58:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states.
[2023-11-23 14:58:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11.
[2023-11-23 14:58:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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)
[2023-11-23 14:58:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions.
[2023-11-23 14:58:49,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8
[2023-11-23 14:58:49,568 INFO L84 Accepts]: Finished accepts. word is rejected.
[2023-11-23 14:58:49,568 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions.
[2023-11-23 14:58:49,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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)
[2023-11-23 14:58:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions.
[2023-11-23 14:58:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2023-11-23 14:58:49,568 INFO L187 NwaCegarLoop]: Found error trace
[2023-11-23 14:58:49,569 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-23 14:58:49,582 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-11-23 14:58:49,781 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-11-23 14:58:49,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2023-11-23 14:58:49,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-23 14:58:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1043471242, now seen corresponding path program 1 times
[2023-11-23 14:58:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-23 14:58:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914405707]
[2023-11-23 14:58:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-23 14:58:49,783 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-11-23 14:58:49,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-11-23 14:58:49,784 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-11-23 14:58:49,785 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-11-23 14:59:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-23 14:59:17,183 WARN L260 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core
[2023-11-23 14:59:17,185 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-23 14:59:50,114 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false
[2023-11-23 14:59:52,272 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true
[2023-11-23 15:00:39,997 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false
[2023-11-23 15:00:42,075 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true
[2023-11-23 15:01:32,268 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse11 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse11)) (fp.mul roundNearestTiesToEven .cse1 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse13)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false
Killed by 15