/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 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 01:51:56,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 01:51:56,932 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 01:51:56,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 01:51:56,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 01:51:56,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 01:51:56,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 01:51:56,956 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 01:51:56,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 01:51:56,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 01:51:56,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 01:51:56,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 01:51:56,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 01:51:56,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 01:51:56,960 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 01:51:56,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 01:51:56,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 01:51:56,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 01:51:56,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 01:51:56,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 01:51:56,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 01:51:56,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 01:51:56,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 01:51:56,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 01:51:56,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 01:51:56,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 01:51:56,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 01:51:56,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 01:51:56,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 01:51:56,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 01:51:56,967 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 -> cvc4 --incremental --print-success --lang smt [2024-11-03 01:51:57,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 01:51:57,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 01:51:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 01:51:57,175 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 01:51:57,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 01:51:57,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-03 01:51:58,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 01:51:58,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 01:51:58,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-29.i [2024-11-03 01:51:58,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac411c4e8/78eb01e2943d4ed485ab622754e7c2d9/FLAG71f5948a7 [2024-11-03 01:51:58,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac411c4e8/78eb01e2943d4ed485ab622754e7c2d9 [2024-11-03 01:51:58,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 01:51:58,951 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 01:51:58,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 01:51:58,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 01:51:58,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 01:51:58,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:51:58" (1/1) ... [2024-11-03 01:51:58,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421a2f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:58, skipping insertion in model container [2024-11-03 01:51:58,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:51:58" (1/1) ... [2024-11-03 01:51:58,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 01:51:59,131 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-03 01:51:59,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 01:51:59,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 01:51:59,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-29.i[915,928] [2024-11-03 01:51:59,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 01:51:59,276 INFO L204 MainTranslator]: Completed translation [2024-11-03 01:51:59,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59 WrapperNode [2024-11-03 01:51:59,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 01:51:59,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 01:51:59,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 01:51:59,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 01:51:59,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,313 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-11-03 01:51:59,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 01:51:59,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 01:51:59,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 01:51:59,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 01:51:59,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,336 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 01:51:59,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 01:51:59,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 01:51:59,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 01:51:59,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 01:51:59,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (1/1) ... [2024-11-03 01:51:59,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 01:51:59,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 01:51:59,381 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 01:51:59,384 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 01:51:59,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 01:51:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 01:51:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 01:51:59,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 01:51:59,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 01:51:59,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 01:51:59,475 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 01:51:59,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 01:52:02,108 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-03 01:52:02,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 01:52:02,118 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 01:52:02,118 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 01:52:02,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:02 BoogieIcfgContainer [2024-11-03 01:52:02,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 01:52:02,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 01:52:02,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 01:52:02,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 01:52:02,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:51:58" (1/3) ... [2024-11-03 01:52:02,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b17c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:02, skipping insertion in model container [2024-11-03 01:52:02,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:51:59" (2/3) ... [2024-11-03 01:52:02,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b17c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:02, skipping insertion in model container [2024-11-03 01:52:02,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:02" (3/3) ... [2024-11-03 01:52:02,125 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-29.i [2024-11-03 01:52:02,142 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 01:52:02,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 01:52:02,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 01:52:02,212 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;@36a9f437, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 01:52:02,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 01:52:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-03 01:52:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-03 01:52:02,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:02,226 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:02,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:02,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash 731389584, now seen corresponding path program 1 times [2024-11-03 01:52:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:02,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1799909037] [2024-11-03 01:52:02,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:02,239 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:02,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:02,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:02,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-03 01:52:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:02,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 01:52:02,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:52:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 01:52:03,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 01:52:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 01:52:03,525 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 01:52:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1799909037] [2024-11-03 01:52:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1799909037] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 01:52:03,526 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 01:52:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2024-11-03 01:52:03,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068510773] [2024-11-03 01:52:03,529 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 01:52:03,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 01:52:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 01:52:03,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 01:52:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 01:52:03,553 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-03 01:52:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 01:52:04,306 INFO L93 Difference]: Finished difference Result 202 states and 380 transitions. [2024-11-03 01:52:04,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 01:52:04,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 170 [2024-11-03 01:52:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 01:52:04,333 INFO L225 Difference]: With dead ends: 202 [2024-11-03 01:52:04,333 INFO L226 Difference]: Without dead ends: 133 [2024-11-03 01:52:04,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 01:52:04,338 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-03 01:52:04,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-03 01:52:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-03 01:52:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-03 01:52:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-03 01:52:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 205 transitions. [2024-11-03 01:52:04,408 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 205 transitions. Word has length 170 [2024-11-03 01:52:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 01:52:04,409 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 205 transitions. [2024-11-03 01:52:04,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-03 01:52:04,409 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 205 transitions. [2024-11-03 01:52:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-03 01:52:04,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:04,414 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:04,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-03 01:52:04,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:04,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:04,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 788647886, now seen corresponding path program 1 times [2024-11-03 01:52:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1782140767] [2024-11-03 01:52:04,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:04,621 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:04,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:04,624 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:04,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-03 01:52:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:05,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 01:52:05,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:52:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 01:52:05,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 01:52:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 01:52:07,958 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 01:52:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1782140767] [2024-11-03 01:52:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1782140767] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 01:52:07,958 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 01:52:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 01:52:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096691870] [2024-11-03 01:52:07,959 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 01:52:07,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 01:52:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 01:52:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 01:52:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 01:52:07,961 INFO L87 Difference]: Start difference. First operand 131 states and 205 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-03 01:52:10,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 01:52:12,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 01:52:15,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 01:52:17,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-03 01:52:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 01:52:21,610 INFO L93 Difference]: Finished difference Result 513 states and 807 transitions. [2024-11-03 01:52:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 01:52:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-03 01:52:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 01:52:21,615 INFO L225 Difference]: With dead ends: 513 [2024-11-03 01:52:21,616 INFO L226 Difference]: Without dead ends: 385 [2024-11-03 01:52:21,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 01:52:21,618 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 208 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-03 01:52:21,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 323 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 13.6s Time] [2024-11-03 01:52:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-03 01:52:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 381. [2024-11-03 01:52:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 206 states have (on average 1.266990291262136) internal successors, (261), 206 states have internal predecessors, (261), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-03 01:52:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 597 transitions. [2024-11-03 01:52:21,672 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 597 transitions. Word has length 170 [2024-11-03 01:52:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 01:52:21,673 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 597 transitions. [2024-11-03 01:52:21,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-03 01:52:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 597 transitions. [2024-11-03 01:52:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-03 01:52:21,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:21,678 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:21,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-03 01:52:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:21,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:21,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1731312048, now seen corresponding path program 1 times [2024-11-03 01:52:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:21,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710154558] [2024-11-03 01:52:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:21,882 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:21,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-03 01:52:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:22,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 01:52:22,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:52:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 183 proven. 3 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-03 01:52:23,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 01:52:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-03 01:52:23,953 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 01:52:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710154558] [2024-11-03 01:52:23,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1710154558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 01:52:23,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 01:52:23,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 01:52:23,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122737002] [2024-11-03 01:52:23,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 01:52:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 01:52:23,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 01:52:23,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 01:52:23,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-03 01:52:23,956 INFO L87 Difference]: Start difference. First operand 381 states and 597 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-03 01:52:31,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 01:52:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 01:52:34,650 INFO L93 Difference]: Finished difference Result 1079 states and 1651 transitions. [2024-11-03 01:52:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-03 01:52:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 170 [2024-11-03 01:52:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 01:52:34,658 INFO L225 Difference]: With dead ends: 1079 [2024-11-03 01:52:34,658 INFO L226 Difference]: Without dead ends: 701 [2024-11-03 01:52:34,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2024-11-03 01:52:34,662 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 420 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-03 01:52:34,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 247 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-03 01:52:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-03 01:52:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 409. [2024-11-03 01:52:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 228 states have (on average 1.2412280701754386) internal successors, (283), 228 states have internal predecessors, (283), 168 states have call successors, (168), 12 states have call predecessors, (168), 12 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-03 01:52:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 619 transitions. [2024-11-03 01:52:34,726 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 619 transitions. Word has length 170 [2024-11-03 01:52:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 01:52:34,727 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 619 transitions. [2024-11-03 01:52:34,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-03 01:52:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 619 transitions. [2024-11-03 01:52:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-03 01:52:34,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:34,729 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:34,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-03 01:52:34,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:34,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1242238079, now seen corresponding path program 1 times [2024-11-03 01:52:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:34,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [601750854] [2024-11-03 01:52:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:34,932 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:34,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:34,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-03 01:52:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:35,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 01:52:35,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:52:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 133 proven. 78 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-03 01:52:36,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 01:52:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 78 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-03 01:52:37,766 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 01:52:37,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [601750854] [2024-11-03 01:52:37,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [601750854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 01:52:37,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 01:52:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-03 01:52:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827790890] [2024-11-03 01:52:37,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 01:52:37,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 01:52:37,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 01:52:37,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 01:52:37,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-03 01:52:37,768 INFO L87 Difference]: Start difference. First operand 409 states and 619 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-03 01:52:40,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 01:52:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 01:52:40,736 INFO L93 Difference]: Finished difference Result 1086 states and 1594 transitions. [2024-11-03 01:52:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-03 01:52:40,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 171 [2024-11-03 01:52:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 01:52:40,744 INFO L225 Difference]: With dead ends: 1086 [2024-11-03 01:52:40,744 INFO L226 Difference]: Without dead ends: 680 [2024-11-03 01:52:40,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-03 01:52:40,749 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 158 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-03 01:52:40,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 242 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-03 01:52:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-03 01:52:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 433. [2024-11-03 01:52:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 246 states have (on average 1.2113821138211383) internal successors, (298), 246 states have internal predecessors, (298), 168 states have call successors, (168), 18 states have call predecessors, (168), 18 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-03 01:52:40,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 634 transitions. [2024-11-03 01:52:40,796 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 634 transitions. Word has length 171 [2024-11-03 01:52:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 01:52:40,796 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 634 transitions. [2024-11-03 01:52:40,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-03 01:52:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 634 transitions. [2024-11-03 01:52:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-03 01:52:40,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:40,800 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:40,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-03 01:52:41,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:41,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:41,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1184979777, now seen corresponding path program 1 times [2024-11-03 01:52:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:41,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777734663] [2024-11-03 01:52:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:41,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:41,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-03 01:52:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:41,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 01:52:41,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:52:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 01:52:41,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 01:52:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-03 01:52:41,855 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 01:52:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777734663] [2024-11-03 01:52:41,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [777734663] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 01:52:41,855 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 01:52:41,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2024-11-03 01:52:41,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732444431] [2024-11-03 01:52:41,856 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 01:52:41,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-03 01:52:41,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 01:52:41,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-03 01:52:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-03 01:52:41,857 INFO L87 Difference]: Start difference. First operand 433 states and 634 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-03 01:52:44,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 01:52:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 01:52:45,616 INFO L93 Difference]: Finished difference Result 1185 states and 1706 transitions. [2024-11-03 01:52:45,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 01:52:45,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 171 [2024-11-03 01:52:45,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 01:52:45,624 INFO L225 Difference]: With dead ends: 1185 [2024-11-03 01:52:45,625 INFO L226 Difference]: Without dead ends: 755 [2024-11-03 01:52:45,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-03 01:52:45,629 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 157 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-03 01:52:45,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 420 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-03 01:52:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-03 01:52:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 439. [2024-11-03 01:52:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 252 states have (on average 1.2182539682539681) internal successors, (307), 252 states have internal predecessors, (307), 168 states have call successors, (168), 18 states have call predecessors, (168), 18 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-03 01:52:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 643 transitions. [2024-11-03 01:52:45,691 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 643 transitions. Word has length 171 [2024-11-03 01:52:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 01:52:45,692 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 643 transitions. [2024-11-03 01:52:45,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-03 01:52:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 643 transitions. [2024-11-03 01:52:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-03 01:52:45,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:45,696 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:45,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-03 01:52:45,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:45,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:45,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1994326403, now seen corresponding path program 1 times [2024-11-03 01:52:45,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:45,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091338225] [2024-11-03 01:52:45,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:45,898 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:45,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:45,899 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:45,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-03 01:52:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:46,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-03 01:52:46,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:52:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 441 proven. 12 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2024-11-03 01:52:46,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 01:52:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 69 proven. 12 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-03 01:52:47,638 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 01:52:47,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091338225] [2024-11-03 01:52:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1091338225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 01:52:47,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 01:52:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 01:52:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029980500] [2024-11-03 01:52:47,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 01:52:47,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 01:52:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 01:52:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 01:52:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 01:52:47,639 INFO L87 Difference]: Start difference. First operand 439 states and 643 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-03 01:52:49,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-03 01:52:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 01:52:50,012 INFO L93 Difference]: Finished difference Result 923 states and 1325 transitions. [2024-11-03 01:52:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 01:52:50,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 171 [2024-11-03 01:52:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 01:52:50,039 INFO L225 Difference]: With dead ends: 923 [2024-11-03 01:52:50,039 INFO L226 Difference]: Without dead ends: 487 [2024-11-03 01:52:50,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-03 01:52:50,041 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 102 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-03 01:52:50,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 151 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-03 01:52:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-03 01:52:50,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 463. [2024-11-03 01:52:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 270 states have (on average 1.1814814814814816) internal successors, (319), 270 states have internal predecessors, (319), 168 states have call successors, (168), 24 states have call predecessors, (168), 24 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-03 01:52:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 655 transitions. [2024-11-03 01:52:50,082 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 655 transitions. Word has length 171 [2024-11-03 01:52:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 01:52:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 655 transitions. [2024-11-03 01:52:50,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-03 01:52:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 655 transitions. [2024-11-03 01:52:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-03 01:52:50,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 01:52:50,084 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 01:52:50,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-03 01:52:50,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:50,284 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 01:52:50,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 01:52:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1933300087, now seen corresponding path program 1 times [2024-11-03 01:52:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 01:52:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [849638212] [2024-11-03 01:52:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 01:52:50,285 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-03 01:52:50,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-03 01:52:50,286 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 01:52:50,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-03 01:52:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 01:52:51,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-03 01:52:51,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 01:53:06,948 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2024-11-03 01:53:15,539 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true [2024-11-03 01:53:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-03 01:53:21,310 INFO L311 TraceCheckSpWp]: Computing backward predicates...