./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:30:55,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:30:55,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:30:55,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:30:55,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:30:55,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:30:55,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:30:55,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:30:55,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:30:55,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:30:55,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:30:55,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:30:55,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:30:55,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:30:55,259 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:30:55,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:30:55,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:30:55,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:30:55,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:30:55,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:30:55,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:30:55,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:30:55,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:30:55,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:30:55,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:30:55,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:30:55,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:30:55,265 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:30:55,265 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:30:55,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:30:55,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:30:55,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:30:55,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:30:55,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:30:55,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:30:55,266 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:30:55,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:30:55,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:30:55,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:30:55,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:30:55,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:30:55,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:30:55,268 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-09 20:30:55,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:30:55,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:30:55,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:30:55,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:30:55,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:30:55,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-09 20:30:56,730 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:30:56,874 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:30:56,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-09 20:30:56,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46100720/be29a5c5fc144e19893e6addc5bda893/FLAGef0975945 [2024-11-09 20:30:56,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e46100720/be29a5c5fc144e19893e6addc5bda893 [2024-11-09 20:30:56,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:30:56,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:30:56,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:30:56,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:30:56,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:30:56,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:30:56" (1/1) ... [2024-11-09 20:30:56,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19509b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:56, skipping insertion in model container [2024-11-09 20:30:56,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:30:56" (1/1) ... [2024-11-09 20:30:56,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:30:57,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-09 20:30:57,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:30:57,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:30:57,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-09 20:30:57,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:30:57,127 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:30:57,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57 WrapperNode [2024-11-09 20:30:57,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:30:57,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:30:57,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:30:57,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:30:57,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,155 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 85 [2024-11-09 20:30:57,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:30:57,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:30:57,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:30:57,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:30:57,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:30:57,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:30:57,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:30:57,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:30:57,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:30:57,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (1/1) ... [2024-11-09 20:30:57,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:30:57,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:30:57,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 20:30:57,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 20:30:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:30:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:30:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:30:57,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:30:57,319 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:30:57,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:30:57,462 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:30:57,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:30:57,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:30:57,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:30:57,463 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:30:57,472 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 20:30:57,473 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:30:57,487 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:30:57,490 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:30:57,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:30:57 BoogieIcfgContainer [2024-11-09 20:30:57,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:30:57,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:30:57,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:30:57,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:30:57,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:30:56" (1/3) ... [2024-11-09 20:30:57,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7825d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:30:57, skipping insertion in model container [2024-11-09 20:30:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:30:57" (2/3) ... [2024-11-09 20:30:57,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7825d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:30:57, skipping insertion in model container [2024-11-09 20:30:57,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:30:57" (3/3) ... [2024-11-09 20:30:57,504 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-09 20:30:57,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:30:57,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:30:57,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:30:57,588 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a460485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:30:57,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:30:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:30:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 20:30:57,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:30:57,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:30:57,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:30:57,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:30:57,605 INFO L85 PathProgramCache]: Analyzing trace with hash -95797659, now seen corresponding path program 1 times [2024-11-09 20:30:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:30:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850622962] [2024-11-09 20:30:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:30:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:30:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:30:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:30:57,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:30:57,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850622962] [2024-11-09 20:30:57,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850622962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:30:57,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:30:57,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:30:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457405539] [2024-11-09 20:30:57,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:30:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:30:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:30:57,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:30:57,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:30:57,855 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:30:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:30:57,897 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-11-09 20:30:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:30:57,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 20:30:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:30:57,909 INFO L225 Difference]: With dead ends: 37 [2024-11-09 20:30:57,910 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 20:30:57,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:30:57,916 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:30:57,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:30:57,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 20:30:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-09 20:30:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:30:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-11-09 20:30:57,943 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2024-11-09 20:30:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:30:57,944 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-11-09 20:30:57,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:30:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-09 20:30:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 20:30:57,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:30:57,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:30:57,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:30:57,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:30:57,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:30:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -94814556, now seen corresponding path program 1 times [2024-11-09 20:30:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:30:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100045254] [2024-11-09 20:30:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:30:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:30:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:30:57,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 20:30:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:30:57,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 20:30:57,989 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 20:30:57,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 20:30:57,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:30:57,997 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 20:30:58,014 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:30:58,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:30:58 BoogieIcfgContainer [2024-11-09 20:30:58,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:30:58,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:30:58,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:30:58,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:30:58,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:30:57" (3/4) ... [2024-11-09 20:30:58,020 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 20:30:58,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:30:58,021 INFO L158 Benchmark]: Toolchain (without parser) took 1126.85ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 63.4MB in the end (delta: 60.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-09 20:30:58,022 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 178.3MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:30:58,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.42ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 110.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 20:30:58,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.46ms. Allocated memory is still 178.3MB. Free memory was 110.4MB in the beginning and 108.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:30:58,023 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 107.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:30:58,024 INFO L158 Benchmark]: IcfgBuilder took 308.68ms. Allocated memory is still 178.3MB. Free memory was 107.1MB in the beginning and 94.8MB in the end (delta: 12.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:30:58,024 INFO L158 Benchmark]: TraceAbstraction took 521.17ms. Allocated memory is still 178.3MB. Free memory was 94.1MB in the beginning and 63.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 20:30:58,024 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 178.3MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:30:58,026 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.20ms. Allocated memory is still 178.3MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.42ms. Allocated memory is still 178.3MB. Free memory was 123.4MB in the beginning and 110.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.46ms. Allocated memory is still 178.3MB. Free memory was 110.4MB in the beginning and 108.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 107.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 308.68ms. Allocated memory is still 178.3MB. Free memory was 107.1MB in the beginning and 94.8MB in the end (delta: 12.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 521.17ms. Allocated memory is still 178.3MB. Free memory was 94.1MB in the beginning and 63.9MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 178.3MB. Free memory is still 63.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 66]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 20, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] float main__X; [L15] float main__Y; [L16] float main__S; [L17] float main__R; [L18] float main__D; [L19] int main__i; [L20] main__Y = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i < 100000 [L25] main__X = __VERIFIER_nondet_float() [L26] main__D = __VERIFIER_nondet_float() [L27] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L28] COND TRUE main__X >= -128.0 VAL [__return_main=0, main__i=0] [L30] COND TRUE main__X <= 128.0 [L32] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L34] COND TRUE main____CPAchecker_TMP_0 != 0 [L36] int main____CPAchecker_TMP_1; VAL [__return_main=0, main__i=0] [L37] COND TRUE main__D >= 0.0 VAL [__return_main=0, main__i=0] [L39] COND TRUE main__D <= 16.0 [L41] main____CPAchecker_TMP_1 = 1 VAL [__return_main=0, main____CPAchecker_TMP_1=1, main__i=0] [L43] COND TRUE main____CPAchecker_TMP_1 != 0 [L45] main__S = main__Y [L46] main__Y = main__X [L47] main__R = main__X - main__S VAL [__return_main=0, main__Y=54, main__i=0] [L48] COND TRUE main__R <= (-main__D) [L50] main__Y = main__S - main__D VAL [__return_main=0, main__i=0] [L52] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L53] COND FALSE !(main__Y >= -129.0) VAL [__return_main=0, main__i=0] [L79] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L60] int __tmp_1; [L61] __tmp_1 = main____CPAchecker_TMP_2 [L62] int __VERIFIER_assert__cond; [L63] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L64] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L66] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 34 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 28 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 20:30:58,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:30:59,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:30:59,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 20:30:59,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:30:59,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:30:59,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:30:59,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:30:59,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:30:59,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:30:59,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:30:59,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:30:59,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:30:59,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:30:59,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:30:59,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:30:59,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:30:59,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:30:59,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:30:59,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:30:59,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:30:59,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:30:59,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:30:59,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:30:59,991 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 20:30:59,991 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 20:30:59,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:30:59,991 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:30:59,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:30:59,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:30:59,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:30:59,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:30:59,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:30:59,993 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 20:30:59,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 20:30:59,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:30:59,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:30:59,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:30:59,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:30:59,995 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18b0d5e6a0e5bf3511d59ae2b1faedfad3abe1ea74492067ae408dc7e088829e [2024-11-09 20:31:00,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:31:00,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:31:00,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:31:00,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:31:00,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:31:00,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-09 20:31:01,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:31:01,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:31:01,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c [2024-11-09 20:31:01,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db432ae4c/d79fa50fe222413cb59bfb750a9850f3/FLAG017c7bd8d [2024-11-09 20:31:01,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db432ae4c/d79fa50fe222413cb59bfb750a9850f3 [2024-11-09 20:31:01,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:31:01,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:31:01,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:31:01,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:31:01,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:31:01,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:31:01" (1/1) ... [2024-11-09 20:31:01,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2306e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:01, skipping insertion in model container [2024-11-09 20:31:01,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:31:01" (1/1) ... [2024-11-09 20:31:01,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:31:02,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-09 20:31:02,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:31:02,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:31:02,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.p+cfa-reducer.c[1464,1477] [2024-11-09 20:31:02,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:31:02,082 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:31:02,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02 WrapperNode [2024-11-09 20:31:02,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:31:02,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:31:02,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:31:02,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:31:02,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,119 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2024-11-09 20:31:02,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:31:02,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:31:02,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:31:02,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:31:02,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,144 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:31:02,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:31:02,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:31:02,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:31:02,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:31:02,166 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (1/1) ... [2024-11-09 20:31:02,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:31:02,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:31:02,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 20:31:02,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 20:31:02,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:31:02,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 20:31:02,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:31:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:31:02,317 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:31:02,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:31:02,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:31:02,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:31:02,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:02,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:02,992 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:03,003 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 20:31:03,004 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:31:03,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:31:03,015 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:31:03,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:03 BoogieIcfgContainer [2024-11-09 20:31:03,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:31:03,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:31:03,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:31:03,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:31:03,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:31:01" (1/3) ... [2024-11-09 20:31:03,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ac7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:31:03, skipping insertion in model container [2024-11-09 20:31:03,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:02" (2/3) ... [2024-11-09 20:31:03,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ac7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:31:03, skipping insertion in model container [2024-11-09 20:31:03,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:03" (3/3) ... [2024-11-09 20:31:03,022 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.p+cfa-reducer.c [2024-11-09 20:31:03,037 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:31:03,038 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:31:03,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:31:03,111 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39178e01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:31:03,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:31:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:03,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 20:31:03,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:03,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:03,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:03,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash -95797659, now seen corresponding path program 1 times [2024-11-09 20:31:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:31:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920668566] [2024-11-09 20:31:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:31:03,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:31:03,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:31:03,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 20:31:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:31:03,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 20:31:03,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:31:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:31:03,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:31:03,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:31:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920668566] [2024-11-09 20:31:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920668566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:31:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:31:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 20:31:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469039040] [2024-11-09 20:31:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:31:03,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:31:03,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:31:03,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:31:03,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:31:03,357 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:31:03,384 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-09 20:31:03,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:31:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 20:31:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:31:03,394 INFO L225 Difference]: With dead ends: 35 [2024-11-09 20:31:03,395 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 20:31:03,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:31:03,399 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:31:03,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:31:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 20:31:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-09 20:31:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-11-09 20:31:03,423 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 19 [2024-11-09 20:31:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:31:03,424 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-11-09 20:31:03,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-11-09 20:31:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 20:31:03,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:03,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:03,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 20:31:03,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:31:03,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:03,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash -94814556, now seen corresponding path program 1 times [2024-11-09 20:31:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:31:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153843121] [2024-11-09 20:31:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:03,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:31:03,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:31:03,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:31:03,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 20:31:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:31:03,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:31:03,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:31:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:31:09,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:31:09,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:31:09,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153843121] [2024-11-09 20:31:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153843121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:31:09,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:31:09,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:31:09,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849936283] [2024-11-09 20:31:09,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:31:09,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 20:31:09,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:31:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 20:31:09,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:31:09,058 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:13,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:16,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:19,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:23,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:28,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:32,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:36,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:41,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:44,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:48,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:53,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:54,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:58,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:31:59,319 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2024-11-09 20:31:59,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:31:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 20:31:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:31:59,325 INFO L225 Difference]: With dead ends: 88 [2024-11-09 20:31:59,325 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 20:31:59,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:31:59,327 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 85 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:31:59,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 67 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 50.2s Time] [2024-11-09 20:31:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 20:31:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2024-11-09 20:31:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-09 20:31:59,334 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 19 [2024-11-09 20:31:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:31:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-09 20:31:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-09 20:31:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 20:31:59,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:59,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:59,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 20:31:59,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:31:59,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2010174371, now seen corresponding path program 1 times [2024-11-09 20:31:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:31:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452285074] [2024-11-09 20:31:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:59,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:31:59,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:31:59,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:31:59,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 20:31:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:31:59,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:31:59,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:31:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:31:59,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:31:59,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:31:59,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452285074] [2024-11-09 20:31:59,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452285074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:31:59,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:31:59,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:31:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282081703] [2024-11-09 20:31:59,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:31:59,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:31:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:31:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:31:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:31:59,634 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:31:59,775 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2024-11-09 20:31:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:31:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 20:31:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:31:59,780 INFO L225 Difference]: With dead ends: 66 [2024-11-09 20:31:59,781 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 20:31:59,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:31:59,782 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:31:59,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:31:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 20:31:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 20:31:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-11-09 20:31:59,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 19 [2024-11-09 20:31:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:31:59,786 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-09 20:31:59,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-09 20:31:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:31:59,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:59,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:59,792 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 [2024-11-09 20:31:59,987 WARN L453 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 [2024-11-09 20:31:59,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1328100865, now seen corresponding path program 1 times [2024-11-09 20:31:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:31:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085046668] [2024-11-09 20:31:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:59,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:31:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:31:59,991 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) [2024-11-09 20:31:59,992 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 [2024-11-09 20:32:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:00,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 20:32:00,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:32:06,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:06,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:06,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085046668] [2024-11-09 20:32:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085046668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:06,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:06,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 20:32:06,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799240965] [2024-11-09 20:32:06,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:06,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 20:32:06,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 20:32:06,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:32:06,073 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:13,909 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2024-11-09 20:32:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 20:32:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 20:32:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:13,914 INFO L225 Difference]: With dead ends: 77 [2024-11-09 20:32:13,914 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 20:32:13,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:32:13,915 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:13,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 59 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-11-09 20:32:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 20:32:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2024-11-09 20:32:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-09 20:32:13,920 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 20 [2024-11-09 20:32:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:13,920 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-09 20:32:13,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2024-11-09 20:32:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:32:13,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:13,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:13,928 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 [2024-11-09 20:32:14,122 WARN L453 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 [2024-11-09 20:32:14,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:14,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash -90656768, now seen corresponding path program 1 times [2024-11-09 20:32:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:14,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146393999] [2024-11-09 20:32:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:14,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:32:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:14,124 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) [2024-11-09 20:32:14,125 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 [2024-11-09 20:32:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:14,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:32:14,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:32:17,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:17,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:17,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146393999] [2024-11-09 20:32:17,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146393999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:17,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:17,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:32:17,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457617400] [2024-11-09 20:32:17,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 20:32:17,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 20:32:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:32:17,409 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:25,414 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2024-11-09 20:32:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:32:25,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 20:32:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:25,423 INFO L225 Difference]: With dead ends: 85 [2024-11-09 20:32:25,423 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 20:32:25,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:32:25,424 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:25,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 76 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-09 20:32:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 20:32:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2024-11-09 20:32:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-09 20:32:25,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 20 [2024-11-09 20:32:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:25,430 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-09 20:32:25,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2024-11-09 20:32:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:32:25,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:25,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:25,436 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 [2024-11-09 20:32:25,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 [2024-11-09 20:32:25,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1684350594, now seen corresponding path program 1 times [2024-11-09 20:32:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670191714] [2024-11-09 20:32:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:25,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:32:25,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:25,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:32:25,637 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 (7)] Waiting until timeout for monitored process [2024-11-09 20:32:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:25,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 20:32:25,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:32:28,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:28,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670191714] [2024-11-09 20:32:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670191714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:32:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180990571] [2024-11-09 20:32:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:28,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:32:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:32:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:32:28,641 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:41,546 INFO L93 Difference]: Finished difference Result 125 states and 149 transitions. [2024-11-09 20:32:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:32:41,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 20:32:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:41,559 INFO L225 Difference]: With dead ends: 125 [2024-11-09 20:32:41,559 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 20:32:41,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:32:41,560 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:41,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 75 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2024-11-09 20:32:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 20:32:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 59. [2024-11-09 20:32:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-11-09 20:32:41,564 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 20 [2024-11-09 20:32:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:41,565 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-09 20:32:41,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2024-11-09 20:32:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:32:41,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:41,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:41,570 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 (7)] Ended with exit code 0 [2024-11-09 20:32:41,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:32:41,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -106047261, now seen corresponding path program 1 times [2024-11-09 20:32:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443435520] [2024-11-09 20:32:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:32:41,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:41,769 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) [2024-11-09 20:32:41,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 (8)] Waiting until timeout for monitored process [2024-11-09 20:32:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:41,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:32:41,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:32:41,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:41,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443435520] [2024-11-09 20:32:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443435520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:41,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:32:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365162725] [2024-11-09 20:32:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:41,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:32:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:32:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:32:41,829 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:41,917 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-11-09 20:32:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:32:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 20:32:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:41,918 INFO L225 Difference]: With dead ends: 89 [2024-11-09 20:32:41,918 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 20:32:41,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:32:41,919 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:41,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:32:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 20:32:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 20:32:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-09 20:32:41,922 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2024-11-09 20:32:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:41,922 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-09 20:32:41,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-09 20:32:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 20:32:41,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:41,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:41,927 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 (8)] Forceful destruction successful, exit code 0 [2024-11-09 20:32:42,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 [2024-11-09 20:32:42,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:42,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1456992293, now seen corresponding path program 1 times [2024-11-09 20:32:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231533243] [2024-11-09 20:32:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:32:42,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:42,127 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:32:42,128 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 (9)] Waiting until timeout for monitored process [2024-11-09 20:32:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:42,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 20:32:42,201 INFO L278 TraceCheckSpWp]: Computing forward predicates...