/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc5 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 06:12:23,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 06:12:23,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 06:12:23,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 06:12:23,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 06:12:23,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 06:12:23,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 06:12:23,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 06:12:23,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 06:12:23,636 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 06:12:23,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 06:12:23,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 06:12:23,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 06:12:23,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 06:12:23,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 06:12:23,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 06:12:23,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 06:12:23,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 06:12:23,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 06:12:23,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 06:12:23,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 06:12:23,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 06:12:23,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 06:12:23,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 06:12:23,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 06:12:23,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 06:12:23,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 06:12:23,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 06:12:23,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 06:12:23,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 06:12:23,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 06:12:23,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 06:12:23,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 06:12:23,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 06:12:23,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 06:12:23,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 06:12:23,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 06:12:23,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 06:12:23,646 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 06:12:23,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 06:12:23,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 06:12:23,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 06:12:23,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 06:12:23,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 06:12:23,648 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:23,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 06:12:23,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 06:12:23,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 06:12:23,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 06:12:23,928 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 06:12:23,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2024-11-03 06:12:25,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 06:12:25,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 06:12:25,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c [2024-11-03 06:12:25,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cccb9d1/803b808dd63f4e0eaa2fdf0567c1bdee/FLAG1cd0c424f [2024-11-03 06:12:25,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7cccb9d1/803b808dd63f4e0eaa2fdf0567c1bdee [2024-11-03 06:12:25,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 06:12:25,602 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 06:12:25,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 06:12:25,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 06:12:25,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 06:12:25,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a97ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25, skipping insertion in model container [2024-11-03 06:12:25,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 06:12:25,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c[1765,1778] [2024-11-03 06:12:25,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 06:12:25,842 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 06:12:25,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b.c[1765,1778] [2024-11-03 06:12:25,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 06:12:25,883 INFO L204 MainTranslator]: Completed translation [2024-11-03 06:12:25,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25 WrapperNode [2024-11-03 06:12:25,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 06:12:25,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 06:12:25,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 06:12:25,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 06:12:25,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,916 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-11-03 06:12:25,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 06:12:25,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 06:12:25,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 06:12:25,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 06:12:25,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,945 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-03 06:12:25,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 06:12:25,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 06:12:25,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 06:12:25,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 06:12:25,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (1/1) ... [2024-11-03 06:12:25,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 06:12:25,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 06:12:25,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-03 06:12:26,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-03 06:12:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 06:12:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-03 06:12:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-03 06:12:26,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 06:12:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 06:12:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 06:12:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-03 06:12:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-03 06:12:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 06:12:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 06:12:26,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 06:12:26,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 06:12:26,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 06:12:26,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 06:12:26,119 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 06:12:26,330 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-03 06:12:26,330 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 06:12:26,347 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 06:12:26,347 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 06:12:26,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 06:12:26 BoogieIcfgContainer [2024-11-03 06:12:26,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 06:12:26,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 06:12:26,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 06:12:26,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 06:12:26,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 06:12:25" (1/3) ... [2024-11-03 06:12:26,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7a8523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 06:12:26, skipping insertion in model container [2024-11-03 06:12:26,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:25" (2/3) ... [2024-11-03 06:12:26,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f7a8523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 06:12:26, skipping insertion in model container [2024-11-03 06:12:26,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 06:12:26" (3/3) ... [2024-11-03 06:12:26,364 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2024-11-03 06:12:26,379 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 06:12:26,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 06:12:26,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 06:12:26,433 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5422c008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 06:12:26,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 06:12:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 06:12:26,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:26,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:26,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:26,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -315010535, now seen corresponding path program 1 times [2024-11-03 06:12:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:26,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872013743] [2024-11-03 06:12:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:26,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:26,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:26,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-03 06:12:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:26,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 06:12:26,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:26,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:26,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:26,594 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872013743] [2024-11-03 06:12:26,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1872013743] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:26,595 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:26,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 06:12:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550340358] [2024-11-03 06:12:26,597 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:26,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 06:12:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:26,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 06:12:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 06:12:26,627 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 06:12:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:26,644 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2024-11-03 06:12:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 06:12:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-03 06:12:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:26,655 INFO L225 Difference]: With dead ends: 45 [2024-11-03 06:12:26,656 INFO L226 Difference]: Without dead ends: 21 [2024-11-03 06:12:26,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 06:12:26,663 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:26,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 06:12:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-03 06:12:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-03 06:12:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-03 06:12:26,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2024-11-03 06:12:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:26,698 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-03 06:12:26,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 06:12:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-11-03 06:12:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-03 06:12:26,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:26,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:26,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-03 06:12:26,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:26,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1327229704, now seen corresponding path program 1 times [2024-11-03 06:12:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341355986] [2024-11-03 06:12:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:26,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:26,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-03 06:12:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:26,996 WARN L253 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-03 06:12:27,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:27,299 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_4| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_6| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_6| (_ bv0 1))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_6| (_ bv8 32)) |c_#length|) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_4|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_4|))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_6| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_6|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_4|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_4|)))))) is different from true [2024-11-03 06:12:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:27,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:27,821 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:27,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341355986] [2024-11-03 06:12:27,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [341355986] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:27,821 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:27,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 4] imperfect sequences [] total 12 [2024-11-03 06:12:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861005582] [2024-11-03 06:12:27,822 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:27,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-03 06:12:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-03 06:12:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2024-11-03 06:12:27,825 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:28,454 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-03 06:12:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-03 06:12:28,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2024-11-03 06:12:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:28,457 INFO L225 Difference]: With dead ends: 31 [2024-11-03 06:12:28,457 INFO L226 Difference]: Without dead ends: 27 [2024-11-03 06:12:28,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=309, Unknown=6, NotChecked=36, Total=420 [2024-11-03 06:12:28,461 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:28,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 136 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2024-11-03 06:12:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-03 06:12:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-03 06:12:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 06:12:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-03 06:12:28,473 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2024-11-03 06:12:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:28,474 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-03 06:12:28,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-03 06:12:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-03 06:12:28,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:28,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:28,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-03 06:12:28,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:28,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1957241665, now seen corresponding path program 1 times [2024-11-03 06:12:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554055716] [2024-11-03 06:12:28,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:28,680 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:28,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:28,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:28,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-03 06:12:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:28,775 WARN L253 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-03 06:12:28,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:29,017 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_14| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_14|))) (and (= (select .cse0 (_ bv4 32)) c___fpclassify_double_~msw~0) (= c___fpclassify_double_~lsw~0 (select .cse0 (_ bv0 32))) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_14| (_ bv8 32)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_14| (_ bv0 1))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_14| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_14|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|))))))) is different from true [2024-11-03 06:12:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:30,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:35,285 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:35,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554055716] [2024-11-03 06:12:35,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1554055716] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:35,285 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:35,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 20 [2024-11-03 06:12:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408347350] [2024-11-03 06:12:35,286 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:35,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-03 06:12:35,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-03 06:12:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=284, Unknown=2, NotChecked=34, Total=380 [2024-11-03 06:12:35,288 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:51,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-03 06:12:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:52,086 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-11-03 06:12:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-03 06:12:52,088 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-03 06:12:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:52,089 INFO L225 Difference]: With dead ends: 48 [2024-11-03 06:12:52,089 INFO L226 Difference]: Without dead ends: 30 [2024-11-03 06:12:52,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=177, Invalid=881, Unknown=2, NotChecked=62, Total=1122 [2024-11-03 06:12:52,091 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 60 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:52,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 75 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 28 Unchecked, 5.4s Time] [2024-11-03 06:12:52,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-03 06:12:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-03 06:12:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-03 06:12:52,104 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2024-11-03 06:12:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:52,104 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-03 06:12:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-03 06:12:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 06:12:52,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:52,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:52,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-03 06:12:52,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:52,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:52,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash 97089329, now seen corresponding path program 1 times [2024-11-03 06:12:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443798112] [2024-11-03 06:12:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:52,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:52,313 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:52,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-03 06:12:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:52,377 WARN L253 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-03 06:12:52,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:52,636 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_15| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_24| (_ BitVec 32))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_24| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_24|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_15|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_15|)))) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_15|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_15|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_15|))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_24| (_ bv8 32)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_24| (_ bv0 1))))) is different from true [2024-11-03 06:12:52,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-03 06:12:52,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:52,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:53,148 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_16| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_25| (_ BitVec 32))) (and (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_25| (_ bv8 32)) |c_#length|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_25| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_25|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_16|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_16|)))) (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_25| (_ bv0 1))))) is different from true [2024-11-03 06:12:53,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-03 06:12:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-03 06:12:53,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:54,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-03 06:12:54,203 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:54,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443798112] [2024-11-03 06:12:54,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1443798112] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 06:12:54,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 06:12:54,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 16 [2024-11-03 06:12:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92089772] [2024-11-03 06:12:54,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:54,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 06:12:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 06:12:54,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=152, Unknown=3, NotChecked=50, Total=240 [2024-11-03 06:12:54,205 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:54,232 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-03 06:12:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 06:12:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-03 06:12:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:54,234 INFO L225 Difference]: With dead ends: 34 [2024-11-03 06:12:54,234 INFO L226 Difference]: Without dead ends: 30 [2024-11-03 06:12:54,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=152, Unknown=3, NotChecked=50, Total=240 [2024-11-03 06:12:54,235 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:54,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 06:12:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-03 06:12:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-03 06:12:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-03 06:12:54,242 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 26 [2024-11-03 06:12:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-03 06:12:54,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-03 06:12:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 06:12:54,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:54,243 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:54,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-03 06:12:54,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:54,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:54,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:54,445 INFO L85 PathProgramCache]: Analyzing trace with hash 97029747, now seen corresponding path program 1 times [2024-11-03 06:12:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:54,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [929046286] [2024-11-03 06:12:54,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:54,445 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:54,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:54,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:54,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-03 06:12:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:54,523 WARN L253 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-03 06:12:54,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:54,794 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_25| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_40| (_ BitVec 32))) (and (= (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_40| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_40|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_25|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_25|))) |c_#memory_int#1|) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_40| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_40| (_ bv0 1)) |c_#valid|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_25|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_25|)) |c___fpclassify_double_#in~x|))) is different from true [2024-11-03 06:12:54,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-03 06:12:54,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:54,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:55,111 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_41| (_ BitVec 32))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_41| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_41|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|)))) (= |c_#length| (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_41| (_ bv8 32))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_41| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-03 06:12:55,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-03 06:12:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-03 06:12:55,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 06:12:56,526 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [929046286] [2024-11-03 06:12:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [929046286] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 06:12:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 06:12:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2024-11-03 06:12:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988779274] [2024-11-03 06:12:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-03 06:12:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-03 06:12:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=248, Unknown=2, NotChecked=66, Total=380 [2024-11-03 06:12:56,528 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:56,603 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-03 06:12:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 06:12:56,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-03 06:12:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:56,604 INFO L225 Difference]: With dead ends: 30 [2024-11-03 06:12:56,604 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 06:12:56,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=248, Unknown=2, NotChecked=66, Total=380 [2024-11-03 06:12:56,606 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:56,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 06:12:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 06:12:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 06:12:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 06:12:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 06:12:56,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-03 06:12:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:56,609 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 06:12:56,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 06:12:56,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 06:12:56,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 06:12:56,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-03 06:12:56,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:56,817 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-03 06:12:56,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 06:13:03,935 WARN L286 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 152 DAG size of output: 101 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-03 06:13:04,019 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 06:13:04,032 WARN L156 FloydHoareUtils]: Requires clause for __fpclassify_double contained old-variable. Original clause: (and (= |old(#memory_int#1)| |#memory_int#1|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|) (= currentRoundingMode roundNearestTiesToEven)) Eliminated clause: (= currentRoundingMode roundNearestTiesToEven) [2024-11-03 06:13:04,085 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-03 06:13:04,091 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-03 06:13:04,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,094 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,095 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:04,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-03 06:13:04,096 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-03 06:13:04,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 06:13:04 BoogieIcfgContainer [2024-11-03 06:13:04,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 06:13:04,100 INFO L158 Benchmark]: Toolchain (without parser) took 38497.07ms. Allocated memory was 332.4MB in the beginning and 413.1MB in the end (delta: 80.7MB). Free memory was 280.5MB in the beginning and 265.6MB in the end (delta: 14.9MB). Peak memory consumption was 96.7MB. Max. memory is 8.0GB. [2024-11-03 06:13:04,100 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 204.5MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 06:13:04,100 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.05ms. Allocated memory is still 332.4MB. Free memory was 280.0MB in the beginning and 266.3MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 06:13:04,100 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.62ms. Allocated memory is still 332.4MB. Free memory was 266.3MB in the beginning and 264.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-03 06:13:04,100 INFO L158 Benchmark]: Boogie Preprocessor took 42.68ms. Allocated memory is still 332.4MB. Free memory was 264.8MB in the beginning and 262.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 06:13:04,101 INFO L158 Benchmark]: RCFGBuilder took 384.37ms. Allocated memory is still 332.4MB. Free memory was 262.7MB in the beginning and 247.5MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-03 06:13:04,101 INFO L158 Benchmark]: TraceAbstraction took 37744.82ms. Allocated memory was 332.4MB in the beginning and 413.1MB in the end (delta: 80.7MB). Free memory was 246.9MB in the beginning and 265.6MB in the end (delta: -18.7MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. [2024-11-03 06:13:04,104 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.25ms. Allocated memory is still 204.5MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 280.05ms. Allocated memory is still 332.4MB. Free memory was 280.0MB in the beginning and 266.3MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.62ms. Allocated memory is still 332.4MB. Free memory was 266.3MB in the beginning and 264.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.68ms. Allocated memory is still 332.4MB. Free memory was 264.8MB in the beginning and 262.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 384.37ms. Allocated memory is still 332.4MB. Free memory was 262.7MB in the beginning and 247.5MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 37744.82ms. Allocated memory was 332.4MB in the beginning and 413.1MB in the end (delta: 80.7MB). Free memory was 246.9MB in the beginning and 265.6MB in the end (delta: -18.7MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 61 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 107 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 42, 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 188 ConstructedInterpolants, 52 QuantifiedInterpolants, 4240 SizeOfPredicates, 47 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 14/24 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 19]: Procedure Contract for __fpclassify_double Derived contract for procedure __fpclassify_double. Ensures: ((0 != \result) || (0 == \result)) RESULT: Ultimate proved your program to be correct! [2024-11-03 06:13:04,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...