/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 02:11:54,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 02:11:54,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-23 02:11:54,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 02:11:54,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 02:11:54,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 02:11:54,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 02:11:54,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 02:11:54,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 02:11:54,360 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 02:11:54,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 02:11:54,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 02:11:54,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 02:11:54,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 02:11:54,362 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 02:11:54,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 02:11:54,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 02:11:54,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 02:11:54,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 02:11:54,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 02:11:54,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 02:11:54,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 02:11:54,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 02:11:54,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 02:11:54,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 02:11:54,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 02:11:54,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 02:11:54,365 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 02:11:54,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 02:11:54,365 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 02:11:54,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 02:11:54,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 02:11:54,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 02:11:54,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 02:11:54,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 02:11:54,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 02:11:54,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 02:11:54,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 02:11:54,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 02:11:54,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 02:11:54,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 02:11:54,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 02:11:54,368 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 02:11:54,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 02:11:54,369 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 02:11:54,369 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 02:11:54,369 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-23 02:11:54,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 02:11:54,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 02:11:54,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 02:11:54,578 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 02:11:54,579 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 02:11:54,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2023-12-23 02:11:55,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 02:11:55,836 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 02:11:55,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2023-12-23 02:11:55,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afedaf3c/f47208625e984366b3800234bc3a642a/FLAG1fb1ec03d [2023-12-23 02:11:55,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6afedaf3c/f47208625e984366b3800234bc3a642a [2023-12-23 02:11:55,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 02:11:55,858 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 02:11:55,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 02:11:55,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 02:11:55,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 02:11:55,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:11:55" (1/1) ... [2023-12-23 02:11:55,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711c06db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:55, skipping insertion in model container [2023-12-23 02:11:55,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 02:11:55" (1/1) ... [2023-12-23 02:11:55,899 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 02:11:55,995 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i[916,929] [2023-12-23 02:11:56,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 02:11:56,104 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 02:11:56,114 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-29.i[916,929] [2023-12-23 02:11:56,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 02:11:56,201 INFO L206 MainTranslator]: Completed translation [2023-12-23 02:11:56,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56 WrapperNode [2023-12-23 02:11:56,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 02:11:56,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 02:11:56,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 02:11:56,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 02:11:56,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,254 INFO L138 Inliner]: procedures = 27, calls = 89, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 433 [2023-12-23 02:11:56,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 02:11:56,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 02:11:56,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 02:11:56,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 02:11:56,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,305 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-23 02:11:56,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 02:11:56,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 02:11:56,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 02:11:56,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 02:11:56,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (1/1) ... [2023-12-23 02:11:56,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 02:11:56,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 02:11:56,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-23 02:11:56,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-23 02:11:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 02:11:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 02:11:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 02:11:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 02:11:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 02:11:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 02:11:56,505 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 02:11:56,506 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 02:12:01,118 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 02:12:01,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 02:12:01,187 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 02:12:01,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:12:01 BoogieIcfgContainer [2023-12-23 02:12:01,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 02:12:01,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 02:12:01,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 02:12:01,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 02:12:01,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 02:11:55" (1/3) ... [2023-12-23 02:12:01,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b21fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:12:01, skipping insertion in model container [2023-12-23 02:12:01,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 02:11:56" (2/3) ... [2023-12-23 02:12:01,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b21fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:12:01, skipping insertion in model container [2023-12-23 02:12:01,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:12:01" (3/3) ... [2023-12-23 02:12:01,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-29.i [2023-12-23 02:12:01,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 02:12:01,207 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 02:12:01,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 02:12:01,248 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@83671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 02:12:01,248 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 02:12:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 110 states have (on average 1.5545454545454545) internal successors, (171), 111 states have internal predecessors, (171), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-23 02:12:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-12-23 02:12:01,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:01,281 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:01,281 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:01,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:01,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2011844461, now seen corresponding path program 1 times [2023-12-23 02:12:01,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:01,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114885374] [2023-12-23 02:12:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:01,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:01,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:01,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-23 02:12:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:02,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 02:12:02,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 4550 proven. 0 refuted. 0 times theorem prover too weak. 6850 trivial. 0 not checked. [2023-12-23 02:12:02,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 02:12:02,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:12:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114885374] [2023-12-23 02:12:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114885374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 02:12:02,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 02:12:02,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 02:12:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898838073] [2023-12-23 02:12:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 02:12:02,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 02:12:02,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:12:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 02:12:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 02:12:02,373 INFO L87 Difference]: Start difference. First operand has 189 states, 110 states have (on average 1.5545454545454545) internal successors, (171), 111 states have internal predecessors, (171), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2023-12-23 02:12:03,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 02:12:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:12:03,432 INFO L93 Difference]: Finished difference Result 375 states and 720 transitions. [2023-12-23 02:12:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 02:12:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 463 [2023-12-23 02:12:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:12:03,463 INFO L225 Difference]: With dead ends: 375 [2023-12-23 02:12:03,463 INFO L226 Difference]: Without dead ends: 187 [2023-12-23 02:12:03,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 02:12:03,470 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-23 02:12:03,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-23 02:12:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-23 02:12:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-12-23 02:12:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 109 states have (on average 1.5229357798165137) internal successors, (166), 109 states have internal predecessors, (166), 76 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-23 02:12:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 318 transitions. [2023-12-23 02:12:03,527 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 318 transitions. Word has length 463 [2023-12-23 02:12:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:12:03,528 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 318 transitions. [2023-12-23 02:12:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (76), 2 states have call predecessors, (76), 2 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2023-12-23 02:12:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 318 transitions. [2023-12-23 02:12:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-12-23 02:12:03,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:03,544 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:03,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-23 02:12:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:03,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:03,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash 571047201, now seen corresponding path program 1 times [2023-12-23 02:12:03,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661934794] [2023-12-23 02:12:03,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:03,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:03,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:03,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:03,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-23 02:12:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:04,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 02:12:04,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2023-12-23 02:12:04,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 02:12:04,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:12:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661934794] [2023-12-23 02:12:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661934794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 02:12:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 02:12:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-23 02:12:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355562557] [2023-12-23 02:12:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 02:12:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 02:12:04,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:12:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 02:12:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 02:12:04,674 INFO L87 Difference]: Start difference. First operand 187 states and 318 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:12:06,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 02:12:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:12:06,677 INFO L93 Difference]: Finished difference Result 482 states and 823 transitions. [2023-12-23 02:12:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 02:12:06,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 463 [2023-12-23 02:12:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:12:06,685 INFO L225 Difference]: With dead ends: 482 [2023-12-23 02:12:06,685 INFO L226 Difference]: Without dead ends: 296 [2023-12-23 02:12:06,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-23 02:12:06,687 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 169 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-23 02:12:06,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 745 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-23 02:12:06,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-23 02:12:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293. [2023-12-23 02:12:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 184 states have (on average 1.565217391304348) internal successors, (288), 185 states have internal predecessors, (288), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 105 states have call predecessors, (106), 106 states have call successors, (106) [2023-12-23 02:12:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 500 transitions. [2023-12-23 02:12:06,752 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 500 transitions. Word has length 463 [2023-12-23 02:12:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:12:06,753 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 500 transitions. [2023-12-23 02:12:06,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:12:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 500 transitions. [2023-12-23 02:12:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-12-23 02:12:06,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:06,759 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:06,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-23 02:12:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:06,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:06,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1230578723, now seen corresponding path program 1 times [2023-12-23 02:12:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091177516] [2023-12-23 02:12:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:06,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:06,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:07,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-23 02:12:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:07,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-23 02:12:07,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5619 proven. 93 refuted. 0 times theorem prover too weak. 5688 trivial. 0 not checked. [2023-12-23 02:12:09,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:12:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2023-12-23 02:12:10,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:12:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091177516] [2023-12-23 02:12:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091177516] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-23 02:12:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 02:12:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2023-12-23 02:12:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715840106] [2023-12-23 02:12:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 02:12:10,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-23 02:12:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:12:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-23 02:12:10,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-12-23 02:12:10,052 INFO L87 Difference]: Start difference. First operand 293 states and 500 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2023-12-23 02:12:14,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 02:12:19,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 02:12:21,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-23 02:12:25,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:12:25,711 INFO L93 Difference]: Finished difference Result 2172 states and 3683 transitions. [2023-12-23 02:12:25,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-23 02:12:25,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) Word has length 463 [2023-12-23 02:12:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:12:25,722 INFO L225 Difference]: With dead ends: 2172 [2023-12-23 02:12:25,722 INFO L226 Difference]: Without dead ends: 1880 [2023-12-23 02:12:25,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-12-23 02:12:25,725 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1688 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-12-23 02:12:25,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 1683 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2023-12-23 02:12:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2023-12-23 02:12:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1070. [2023-12-23 02:12:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 703 states have (on average 1.597439544807966) internal successors, (1123), 709 states have internal predecessors, (1123), 358 states have call successors, (358), 8 states have call predecessors, (358), 8 states have return successors, (358), 352 states have call predecessors, (358), 358 states have call successors, (358) [2023-12-23 02:12:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1839 transitions. [2023-12-23 02:12:25,815 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1839 transitions. Word has length 463 [2023-12-23 02:12:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:12:25,816 INFO L495 AbstractCegarLoop]: Abstraction has 1070 states and 1839 transitions. [2023-12-23 02:12:25,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 2 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 2 states have call predecessors, (76), 2 states have call successors, (76) [2023-12-23 02:12:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1839 transitions. [2023-12-23 02:12:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-12-23 02:12:25,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:25,820 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:25,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-23 02:12:26,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:26,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:26,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1653280549, now seen corresponding path program 1 times [2023-12-23 02:12:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299092774] [2023-12-23 02:12:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:26,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:26,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:26,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:26,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-23 02:12:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:26,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 02:12:26,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2023-12-23 02:12:27,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 02:12:27,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:12:27,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299092774] [2023-12-23 02:12:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299092774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 02:12:27,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 02:12:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-23 02:12:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108167004] [2023-12-23 02:12:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 02:12:27,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-23 02:12:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:12:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-23 02:12:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-23 02:12:27,724 INFO L87 Difference]: Start difference. First operand 1070 states and 1839 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:12:30,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-23 02:12:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:12:35,241 INFO L93 Difference]: Finished difference Result 5187 states and 8874 transitions. [2023-12-23 02:12:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 02:12:35,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 463 [2023-12-23 02:12:35,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:12:35,259 INFO L225 Difference]: With dead ends: 5187 [2023-12-23 02:12:35,259 INFO L226 Difference]: Without dead ends: 4118 [2023-12-23 02:12:35,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-23 02:12:35,265 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 810 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-12-23 02:12:35,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1227 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-12-23 02:12:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2023-12-23 02:12:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 4053. [2023-12-23 02:12:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4053 states, 2582 states have (on average 1.5546088303640588) internal successors, (4014), 2609 states have internal predecessors, (4014), 1436 states have call successors, (1436), 34 states have call predecessors, (1436), 34 states have return successors, (1436), 1409 states have call predecessors, (1436), 1436 states have call successors, (1436) [2023-12-23 02:12:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 6886 transitions. [2023-12-23 02:12:35,596 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 6886 transitions. Word has length 463 [2023-12-23 02:12:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:12:35,596 INFO L495 AbstractCegarLoop]: Abstraction has 4053 states and 6886 transitions. [2023-12-23 02:12:35,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:12:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 6886 transitions. [2023-12-23 02:12:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-12-23 02:12:35,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:35,602 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:35,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-23 02:12:35,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:35,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:35,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:35,825 INFO L85 PathProgramCache]: Analyzing trace with hash -340864157, now seen corresponding path program 1 times [2023-12-23 02:12:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103921800] [2023-12-23 02:12:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:35,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:35,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:35,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-23 02:12:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:36,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 02:12:36,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:37,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 4905 proven. 156 refuted. 0 times theorem prover too weak. 6339 trivial. 0 not checked. [2023-12-23 02:12:37,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:12:37,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:12:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103921800] [2023-12-23 02:12:37,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103921800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 02:12:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [600563072] [2023-12-23 02:12:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:37,273 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 02:12:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 02:12:37,288 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) [2023-12-23 02:12:37,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-23 02:12:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:39,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-23 02:12:39,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2023-12-23 02:12:39,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 02:12:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [600563072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 02:12:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-23 02:12:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-23 02:12:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438915487] [2023-12-23 02:12:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 02:12:39,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-23 02:12:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:12:39,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-23 02:12:39,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-23 02:12:39,514 INFO L87 Difference]: Start difference. First operand 4053 states and 6886 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:12:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:12:41,595 INFO L93 Difference]: Finished difference Result 11947 states and 20314 transitions. [2023-12-23 02:12:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-23 02:12:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 463 [2023-12-23 02:12:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:12:41,625 INFO L225 Difference]: With dead ends: 11947 [2023-12-23 02:12:41,625 INFO L226 Difference]: Without dead ends: 7984 [2023-12-23 02:12:41,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-23 02:12:41,636 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 310 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-23 02:12:41,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 918 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-23 02:12:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7984 states. [2023-12-23 02:12:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7984 to 7982. [2023-12-23 02:12:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7982 states, 5095 states have (on average 1.543277723258096) internal successors, (7863), 5148 states have internal predecessors, (7863), 2820 states have call successors, (2820), 66 states have call predecessors, (2820), 66 states have return successors, (2820), 2767 states have call predecessors, (2820), 2820 states have call successors, (2820) [2023-12-23 02:12:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7982 states to 7982 states and 13503 transitions. [2023-12-23 02:12:42,258 INFO L78 Accepts]: Start accepts. Automaton has 7982 states and 13503 transitions. Word has length 463 [2023-12-23 02:12:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:12:42,259 INFO L495 AbstractCegarLoop]: Abstraction has 7982 states and 13503 transitions. [2023-12-23 02:12:42,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:12:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7982 states and 13503 transitions. [2023-12-23 02:12:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2023-12-23 02:12:42,264 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:42,264 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:42,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-23 02:12:42,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-23 02:12:42,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:42,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:42,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -283605855, now seen corresponding path program 1 times [2023-12-23 02:12:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895384766] [2023-12-23 02:12:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:42,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:42,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:42,719 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:42,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-23 02:12:43,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:43,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-23 02:12:43,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 4905 proven. 156 refuted. 0 times theorem prover too weak. 6339 trivial. 0 not checked. [2023-12-23 02:12:43,900 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:12:43,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:12:43,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895384766] [2023-12-23 02:12:43,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895384766] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 02:12:43,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1425467599] [2023-12-23 02:12:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:43,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 02:12:43,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 02:12:43,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 02:12:43,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-23 02:12:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:46,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-23 02:12:46,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:12:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 1615 proven. 15 refuted. 0 times theorem prover too weak. 9770 trivial. 0 not checked. [2023-12-23 02:12:46,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:12:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 210 proven. 15 refuted. 0 times theorem prover too weak. 11175 trivial. 0 not checked. [2023-12-23 02:12:46,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1425467599] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 02:12:46,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-23 02:12:46,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-12-23 02:12:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380947649] [2023-12-23 02:12:46,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-23 02:12:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-23 02:12:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:12:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-23 02:12:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-23 02:12:46,615 INFO L87 Difference]: Start difference. First operand 7982 states and 13503 transitions. Second operand has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 4 states have call successors, (133), 3 states have call predecessors, (133), 5 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) [2023-12-23 02:12:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:12:50,897 INFO L93 Difference]: Finished difference Result 27362 states and 44925 transitions. [2023-12-23 02:12:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-23 02:12:50,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 4 states have call successors, (133), 3 states have call predecessors, (133), 5 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) Word has length 463 [2023-12-23 02:12:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:12:50,967 INFO L225 Difference]: With dead ends: 27362 [2023-12-23 02:12:50,967 INFO L226 Difference]: Without dead ends: 19470 [2023-12-23 02:12:50,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1452 GetRequests, 1421 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=733, Unknown=0, NotChecked=0, Total=1056 [2023-12-23 02:12:50,992 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 1095 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-23 02:12:50,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 759 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-23 02:12:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19470 states. [2023-12-23 02:12:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19470 to 14726. [2023-12-23 02:12:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14726 states, 9842 states have (on average 1.5232676285307865) internal successors, (14992), 9959 states have internal predecessors, (14992), 4612 states have call successors, (4612), 271 states have call predecessors, (4612), 271 states have return successors, (4612), 4495 states have call predecessors, (4612), 4612 states have call successors, (4612) [2023-12-23 02:12:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14726 states to 14726 states and 24216 transitions. [2023-12-23 02:12:52,270 INFO L78 Accepts]: Start accepts. Automaton has 14726 states and 24216 transitions. Word has length 463 [2023-12-23 02:12:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:12:52,271 INFO L495 AbstractCegarLoop]: Abstraction has 14726 states and 24216 transitions. [2023-12-23 02:12:52,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.545454545454547) internal successors, (193), 11 states have internal predecessors, (193), 4 states have call successors, (133), 3 states have call predecessors, (133), 5 states have return successors, (135), 4 states have call predecessors, (135), 4 states have call successors, (135) [2023-12-23 02:12:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14726 states and 24216 transitions. [2023-12-23 02:12:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2023-12-23 02:12:52,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:12:52,277 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:12:52,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-23 02:12:52,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-23 02:12:52,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:52,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:12:52,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:12:52,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2039445168, now seen corresponding path program 1 times [2023-12-23 02:12:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:12:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043406070] [2023-12-23 02:12:52,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:12:52,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:12:52,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:12:52,707 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:12:52,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-23 02:12:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:12:53,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 02:12:53,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:13:33,601 WARN L876 $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 [2023-12-23 02:14:35,371 WARN L293 SmtUtils]: Spent 8.85s on a formula simplification. DAG size of input: 74 DAG size of output: 74 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-23 02:14:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5231 proven. 432 refuted. 0 times theorem prover too weak. 5737 trivial. 0 not checked. [2023-12-23 02:14:41,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:17:39,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:17:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043406070] [2023-12-23 02:17:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043406070] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 02:17:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788287543] [2023-12-23 02:17:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:17:39,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 02:17:39,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 02:17:39,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 02:17:39,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-23 02:17:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:17:42,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-23 02:17:42,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:18:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 6395 proven. 120 refuted. 0 times theorem prover too weak. 4885 trivial. 0 not checked. [2023-12-23 02:18:52,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:19:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11400 trivial. 0 not checked. [2023-12-23 02:19:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [788287543] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-23 02:19:02,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-23 02:19:02,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 13] total 27 [2023-12-23 02:19:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56730013] [2023-12-23 02:19:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 02:19:02,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-23 02:19:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 02:19:02,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-23 02:19:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=688, Unknown=20, NotChecked=54, Total=870 [2023-12-23 02:19:02,642 INFO L87 Difference]: Start difference. First operand 14726 states and 24216 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:19:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 02:19:06,708 INFO L93 Difference]: Finished difference Result 39886 states and 65866 transitions. [2023-12-23 02:19:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-23 02:19:06,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) Word has length 465 [2023-12-23 02:19:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 02:19:06,802 INFO L225 Difference]: With dead ends: 39886 [2023-12-23 02:19:06,802 INFO L226 Difference]: Without dead ends: 24582 [2023-12-23 02:19:06,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1702 GetRequests, 1674 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 207.3s TimeCoverageRelationStatistics Valid=108, Invalid=688, Unknown=20, NotChecked=54, Total=870 [2023-12-23 02:19:06,843 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 305 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-23 02:19:06,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 705 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-23 02:19:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24582 states. [2023-12-23 02:19:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24582 to 14754. [2023-12-23 02:19:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14754 states, 11725 states have (on average 1.6749680170575694) internal successors, (19639), 11778 states have internal predecessors, (19639), 2820 states have call successors, (2820), 208 states have call predecessors, (2820), 208 states have return successors, (2820), 2767 states have call predecessors, (2820), 2820 states have call successors, (2820) [2023-12-23 02:19:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14754 states to 14754 states and 25279 transitions. [2023-12-23 02:19:07,980 INFO L78 Accepts]: Start accepts. Automaton has 14754 states and 25279 transitions. Word has length 465 [2023-12-23 02:19:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 02:19:07,981 INFO L495 AbstractCegarLoop]: Abstraction has 14754 states and 25279 transitions. [2023-12-23 02:19:07,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (76), 1 states have call predecessors, (76), 1 states have return successors, (76), 1 states have call predecessors, (76), 1 states have call successors, (76) [2023-12-23 02:19:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14754 states and 25279 transitions. [2023-12-23 02:19:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2023-12-23 02:19:08,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 02:19:08,081 INFO L195 NwaCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:19:08,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-23 02:19:08,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-23 02:19:08,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:19:08,493 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 02:19:08,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 02:19:08,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2036667410, now seen corresponding path program 1 times [2023-12-23 02:19:08,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 02:19:08,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389053701] [2023-12-23 02:19:08,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:19:08,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:19:08,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 02:19:08,497 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-23 02:19:08,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-23 02:19:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:19:09,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-23 02:19:09,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:20:11,633 WARN L854 $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 false [2023-12-23 02:20:15,639 WARN L876 $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 [2023-12-23 02:20:23,850 WARN L854 $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 false [2023-12-23 02:20:27,856 WARN L876 $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 [2023-12-23 02:20:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5231 proven. 432 refuted. 0 times theorem prover too weak. 5737 trivial. 0 not checked. [2023-12-23 02:20:33,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 02:23:23,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 02:23:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389053701] [2023-12-23 02:23:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389053701] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 02:23:23,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2116020183] [2023-12-23 02:23:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 02:23:23,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 02:23:23,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 02:23:23,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 02:23:23,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-23 02:23:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 02:23:26,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-23 02:23:26,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 02:24:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 5231 proven. 432 refuted. 0 times theorem prover too weak. 5737 trivial. 0 not checked. [2023-12-23 02:24:37,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-23 02:26:27,874 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 02:26:27,876 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 02:26:27,884 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-23 02:26:28,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 02:26:28,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-23 02:26:28,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-23 02:26:28,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-23 02:26:28,683 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 466 with TraceHistMax 76,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-12-23 02:26:28,688 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 02:26:28,704 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 02:26:28,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 02:26:28 BoogieIcfgContainer [2023-12-23 02:26:28,707 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 02:26:28,708 INFO L158 Benchmark]: Toolchain (without parser) took 872849.26ms. Allocated memory was 307.2MB in the beginning and 854.6MB in the end (delta: 547.4MB). Free memory was 251.3MB in the beginning and 215.8MB in the end (delta: 35.5MB). Peak memory consumption was 584.4MB. Max. memory is 8.0GB. [2023-12-23 02:26:28,711 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 202.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 02:26:28,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.44ms. Allocated memory is still 307.2MB. Free memory was 250.7MB in the beginning and 227.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-23 02:26:28,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.89ms. Allocated memory is still 307.2MB. Free memory was 227.7MB in the beginning and 223.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-23 02:26:28,712 INFO L158 Benchmark]: Boogie Preprocessor took 92.95ms. Allocated memory is still 307.2MB. Free memory was 223.5MB in the beginning and 217.7MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-23 02:26:28,712 INFO L158 Benchmark]: RCFGBuilder took 4835.24ms. Allocated memory is still 307.2MB. Free memory was 217.7MB in the beginning and 166.9MB in the end (delta: 50.9MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2023-12-23 02:26:28,713 INFO L158 Benchmark]: TraceAbstraction took 867518.23ms. Allocated memory was 307.2MB in the beginning and 854.6MB in the end (delta: 547.4MB). Free memory was 166.3MB in the beginning and 215.8MB in the end (delta: -49.5MB). Peak memory consumption was 499.5MB. Max. memory is 8.0GB. [2023-12-23 02:26:28,715 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.16ms. Allocated memory is still 202.4MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.44ms. Allocated memory is still 307.2MB. Free memory was 250.7MB in the beginning and 227.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.89ms. Allocated memory is still 307.2MB. Free memory was 227.7MB in the beginning and 223.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 92.95ms. Allocated memory is still 307.2MB. Free memory was 223.5MB in the beginning and 217.7MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 4835.24ms. Allocated memory is still 307.2MB. Free memory was 217.7MB in the beginning and 166.9MB in the end (delta: 50.9MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. * TraceAbstraction took 867518.23ms. Allocated memory was 307.2MB in the beginning and 854.6MB in the end (delta: 547.4MB). Free memory was 166.3MB in the beginning and 215.8MB in the end (delta: -49.5MB). Peak memory consumption was 499.5MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 466 with TraceHistMax 76,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 189 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 867.5s, OverallIterations: 8, TraceHistogramMax: 76, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4379 SdHoareTripleChecker+Valid, 33.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4377 mSDsluCounter, 6352 SdHoareTripleChecker+Invalid, 31.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3479 mSDsCounter, 1522 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2415 IncrementalHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1522 mSolverCounterUnsat, 2873 mSDtfsCounter, 2415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6439 GetRequests, 6354 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 208.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14754occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 15452 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 11.2s SatisfiabilityAnalysisTime, 371.9s InterpolantComputationTime, 4634 NumberOfCodeBlocks, 4634 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 6012 ConstructedInterpolants, 37 QuantifiedInterpolants, 39782 SizeOfPredicates, 38 NumberOfNonLiveVariables, 7339 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 147213/148200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown