./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-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 dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:10:59,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:10:59,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 23:10:59,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:10:59,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:10:59,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:10:59,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:10:59,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:10:59,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:10:59,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:10:59,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:10:59,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:10:59,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:10:59,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:10:59,470 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:10:59,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:10:59,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:10:59,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:10:59,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 23:10:59,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:10:59,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:10:59,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:10:59,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:10:59,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:10:59,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:10:59,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:10:59,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:10:59,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:10:59,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:10:59,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:10:59,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:10:59,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:10:59,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:10:59,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:10:59,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:10:59,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:10:59,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 23:10:59,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 23:10:59,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:10:59,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:10:59,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:10:59,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:10:59,481 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 -> dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 [2024-11-21 23:10:59,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:10:59,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:10:59,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:10:59,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:10:59,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:10:59,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-21 23:11:01,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:11:01,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:11:01,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-21 23:11:01,381 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f8535ab/6da72fe76c1a47e08353e565759d3058/FLAG54e077f54 [2024-11-21 23:11:01,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3f8535ab/6da72fe76c1a47e08353e565759d3058 [2024-11-21 23:11:01,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:11:01,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:11:01,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:11:01,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:11:01,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:11:01,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f81c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01, skipping insertion in model container [2024-11-21 23:11:01,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:11:01,656 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.v+nlh-reducer.c[1545,1558] [2024-11-21 23:11:01,672 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.v+nlh-reducer.c[2749,2762] [2024-11-21 23:11:01,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:11:01,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:11:01,721 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.v+nlh-reducer.c[1545,1558] [2024-11-21 23:11:01,725 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.v+nlh-reducer.c[2749,2762] [2024-11-21 23:11:01,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:11:01,754 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:11:01,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01 WrapperNode [2024-11-21 23:11:01,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:11:01,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:11:01,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:11:01,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:11:01,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,794 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 173 [2024-11-21 23:11:01,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:11:01,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:11:01,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:11:01,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:11:01,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,823 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-21 23:11:01,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:11:01,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:11:01,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:11:01,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:11:01,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (1/1) ... [2024-11-21 23:11:01,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:11:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:11:01,869 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-21 23:11:01,870 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-21 23:11:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:11:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 23:11:01,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:11:01,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:11:01,965 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:11:01,967 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:11:02,174 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-21 23:11:02,174 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:11:02,185 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:11:02,186 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-21 23:11:02,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:11:02 BoogieIcfgContainer [2024-11-21 23:11:02,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:11:02,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:11:02,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:11:02,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:11:02,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:11:01" (1/3) ... [2024-11-21 23:11:02,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188f35c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:11:02, skipping insertion in model container [2024-11-21 23:11:02,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:01" (2/3) ... [2024-11-21 23:11:02,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188f35c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:11:02, skipping insertion in model container [2024-11-21 23:11:02,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:11:02" (3/3) ... [2024-11-21 23:11:02,211 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+nlh-reducer.c [2024-11-21 23:11:02,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:11:02,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-21 23:11:02,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:11:02,289 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;@143d2b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:11:02,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 23:11:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 43 states have internal predecessors, (67), 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-21 23:11:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:11:02,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:11:02,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:11:02,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:11:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:11:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 350471322, now seen corresponding path program 1 times [2024-11-21 23:11:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:11:02,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840864920] [2024-11-21 23:11:02,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:11:02,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:11:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:11:02,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:11:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:11:02,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 23:11:02,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:11:02,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-21 23:11:02,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-21 23:11:02,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 23:11:02,466 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-21 23:11:02,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:11:02,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:11:02 BoogieIcfgContainer [2024-11-21 23:11:02,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:11:02,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:11:02,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:11:02,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:11:02,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:11:02" (3/4) ... [2024-11-21 23:11:02,503 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 23:11:02,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:11:02,505 INFO L158 Benchmark]: Toolchain (without parser) took 1102.76ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 96.8MB in the beginning and 153.9MB in the end (delta: -57.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:11:02,506 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:11:02,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.50ms. Allocated memory is still 153.1MB. Free memory was 96.8MB in the beginning and 81.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 23:11:02,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.39ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 80.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:11:02,508 INFO L158 Benchmark]: Boogie Preprocessor took 39.45ms. Allocated memory is still 153.1MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:11:02,509 INFO L158 Benchmark]: RCFGBuilder took 351.00ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 63.6MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 23:11:02,510 INFO L158 Benchmark]: TraceAbstraction took 296.67ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 122.1MB in the beginning and 154.9MB in the end (delta: -32.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-21 23:11:02,510 INFO L158 Benchmark]: Witness Printer took 4.55ms. Allocated memory is still 199.2MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:11:02,514 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.21ms. Allocated memory is still 153.1MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.50ms. Allocated memory is still 153.1MB. Free memory was 96.8MB in the beginning and 81.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.39ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 80.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.45ms. Allocated memory is still 153.1MB. Free memory was 80.0MB in the beginning and 77.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.00ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 63.6MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 296.67ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 122.1MB in the beginning and 154.9MB in the end (delta: -32.8MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 4.55ms. Allocated memory is still 199.2MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 70]: 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 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of to_real at line 27, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L1] int __return_main; [L12] int __tmp_160_0; [L13] int __tmp_160_1; [L14] int __tmp_160_2; [L15] int __tmp_142_0; [L16] int __tmp_142_1; [L17] int __tmp_136_0; [L18] int __return_165; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0] [L21] float main__X; [L22] float main__Y; [L23] float main__S; [L24] float main__R; [L25] float main__D; [L26] int main__i; [L27] main__Y = 0 [L28] main__i = 0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L29] COND TRUE main__i < 100000 [L31] main__X = __VERIFIER_nondet_float() [L32] main__D = __VERIFIER_nondet_float() [L33] int main____CPAchecker_TMP_0; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L34] COND TRUE main__X >= -128.0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L36] COND TRUE main__X <= 128.0 [L38] main____CPAchecker_TMP_0 = 1 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L39] COND TRUE main____CPAchecker_TMP_0 != 0 [L41] int main____CPAchecker_TMP_1; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L42] COND TRUE main__D >= 0.0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L44] COND TRUE main__D <= 16.0 [L46] main____CPAchecker_TMP_1 = 1 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L47] COND TRUE main____CPAchecker_TMP_1 != 0 [L49] main__S = main__Y [L50] main__Y = main__X [L51] main__R = main__X - main__S VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__Y=54, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L52] COND TRUE main__R <= (-main__D) [L54] main__Y = main__S - main__D VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L56] int main____CPAchecker_TMP_2; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L57] COND FALSE !(main__Y >= -129.0) VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L216] main____CPAchecker_TMP_2 = 0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L64] int __tmp_1; [L65] __tmp_1 = main____CPAchecker_TMP_2 [L66] int __VERIFIER_assert__cond; [L67] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L68] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L70] reach_error() VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 126]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-21 23:11:02,535 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-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 dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:11:04,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:11:04,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 23:11:04,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:11:04,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:11:04,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:11:04,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:11:04,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:11:04,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:11:04,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:11:04,832 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:11:04,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:11:04,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:11:04,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:11:04,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:11:04,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:11:04,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:11:04,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:11:04,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:11:04,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:11:04,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:11:04,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:11:04,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:11:04,841 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 23:11:04,841 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 23:11:04,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:11:04,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 23:11:04,842 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:11:04,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:11:04,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:11:04,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:11:04,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:11:04,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:11:04,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:11:04,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:11:04,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:11:04,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:11:04,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:11:04,845 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 23:11:04,845 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 23:11:04,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:11:04,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:11:04,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:11:04,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:11:04,847 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 -> dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 [2024-11-21 23:11:05,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:11:05,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:11:05,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:11:05,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:11:05,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:11:05,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-21 23:11:06,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:11:06,848 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:11:06,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-21 23:11:06,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d6f0f20/ee026dd352b14913bdd2c13ec3bf1ced/FLAG27f1ac02c [2024-11-21 23:11:06,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d6f0f20/ee026dd352b14913bdd2c13ec3bf1ced [2024-11-21 23:11:06,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:11:06,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:11:06,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:11:06,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:11:06,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:11:06,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:11:06" (1/1) ... [2024-11-21 23:11:06,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4f5b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:06, skipping insertion in model container [2024-11-21 23:11:06,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:11:06" (1/1) ... [2024-11-21 23:11:06,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:11:07,122 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.v+nlh-reducer.c[1545,1558] [2024-11-21 23:11:07,136 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.v+nlh-reducer.c[2749,2762] [2024-11-21 23:11:07,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:11:07,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:11:07,186 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.v+nlh-reducer.c[1545,1558] [2024-11-21 23:11:07,195 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.v+nlh-reducer.c[2749,2762] [2024-11-21 23:11:07,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:11:07,228 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:11:07,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07 WrapperNode [2024-11-21 23:11:07,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:11:07,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:11:07,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:11:07,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:11:07,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,278 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 174 [2024-11-21 23:11:07,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:11:07,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:11:07,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:11:07,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:11:07,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,320 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-21 23:11:07,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,338 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:11:07,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:11:07,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:11:07,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:11:07,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (1/1) ... [2024-11-21 23:11:07,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:11:07,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:11:07,407 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-21 23:11:07,417 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-21 23:11:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:11:07,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 23:11:07,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:11:07,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:11:07,517 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:11:07,520 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:11:09,077 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-21 23:11:09,078 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:11:09,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:11:09,101 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-21 23:11:09,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:11:09 BoogieIcfgContainer [2024-11-21 23:11:09,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:11:09,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:11:09,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:11:09,107 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:11:09,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:11:06" (1/3) ... [2024-11-21 23:11:09,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b671dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:11:09, skipping insertion in model container [2024-11-21 23:11:09,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:11:07" (2/3) ... [2024-11-21 23:11:09,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b671dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:11:09, skipping insertion in model container [2024-11-21 23:11:09,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:11:09" (3/3) ... [2024-11-21 23:11:09,110 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+nlh-reducer.c [2024-11-21 23:11:09,126 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:11:09,127 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-21 23:11:09,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:11:09,184 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;@79d7a68a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:11:09,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-21 23:11:09,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 43 states have internal predecessors, (67), 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-21 23:11:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:11:09,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:11:09,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:11:09,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:11:09,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:11:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash 350471322, now seen corresponding path program 1 times [2024-11-21 23:11:09,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:11:09,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200298074] [2024-11-21 23:11:09,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:11:09,217 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-21 23:11:09,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:11:09,221 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-21 23:11:09,222 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-21 23:11:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:11:09,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 23:11:09,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:11:12,751 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-21 23:11:12,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:11:12,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:11:12,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200298074] [2024-11-21 23:11:12,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200298074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:11:12,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:11:12,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:11:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869694802] [2024-11-21 23:11:12,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:11:12,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 23:11:12,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:11:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 23:11:12,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-21 23:11:12,784 INFO L87 Difference]: Start difference. First operand has 44 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 43 states have internal predecessors, (67), 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 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-21 23:11:18,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:21,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:23,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:26,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:30,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:36,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:42,832 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-21 23:11:44,691 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-21 23:11:49,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:52,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:11:58,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:12:02,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-21 23:12:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:12:02,170 INFO L93 Difference]: Finished difference Result 99 states and 144 transitions. [2024-11-21 23:12:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:12:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2024-11-21 23:12:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:12:02,187 INFO L225 Difference]: With dead ends: 99 [2024-11-21 23:12:02,187 INFO L226 Difference]: Without dead ends: 57 [2024-11-21 23:12:02,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-21 23:12:02,192 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 96 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.3s IncrementalHoareTripleChecker+Time [2024-11-21 23:12:02,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 120 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 49.3s Time] [2024-11-21 23:12:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-21 23:12:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2024-11-21 23:12:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 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-21 23:12:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-21 23:12:02,216 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16 [2024-11-21 23:12:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:12:02,216 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-21 23:12:02,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-21 23:12:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-21 23:12:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:12:02,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:12:02,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:12:02,225 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-21 23:12:02,418 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-21 23:12:02,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:12:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:12:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 257195701, now seen corresponding path program 1 times [2024-11-21 23:12:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:12:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201289421] [2024-11-21 23:12:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:12:02,420 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-21 23:12:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:12:02,421 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-21 23:12:02,423 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-21 23:12:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:12:02,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 23:12:02,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:12:02,543 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-21 23:12:02,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:12:02,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:12:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201289421] [2024-11-21 23:12:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201289421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:12:02,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:12:02,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:12:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316581794] [2024-11-21 23:12:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:12:02,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:12:02,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:12:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:12:02,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:12:02,549 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-21 23:12:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:12:02,592 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2024-11-21 23:12:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:12:02,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-21 23:12:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:12:02,593 INFO L225 Difference]: With dead ends: 45 [2024-11-21 23:12:02,594 INFO L226 Difference]: Without dead ends: 43 [2024-11-21 23:12:02,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-21 23:12:02,595 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:12:02,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:12:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-21 23:12:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-21 23:12:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-21 23:12:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-21 23:12:02,607 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2024-11-21 23:12:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:12:02,608 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-21 23:12:02,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-21 23:12:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-21 23:12:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:12:02,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:12:02,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:12:02,617 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-21 23:12:02,810 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-21 23:12:02,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:12:02,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:12:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1580255705, now seen corresponding path program 1 times [2024-11-21 23:12:02,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:12:02,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721401264] [2024-11-21 23:12:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:12:02,812 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-21 23:12:02,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:12:02,815 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-21 23:12:02,816 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-21 23:12:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:12:02,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 23:12:02,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:12:05,669 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-21 23:12:05,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:12:05,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:12:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721401264] [2024-11-21 23:12:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721401264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:12:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:12:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:12:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932295295] [2024-11-21 23:12:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:12:05,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-21 23:12:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:12:05,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-21 23:12:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-21 23:12:05,673 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-21 23:12:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:12:14,580 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2024-11-21 23:12:14,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:12:14,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2024-11-21 23:12:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:12:14,585 INFO L225 Difference]: With dead ends: 88 [2024-11-21 23:12:14,586 INFO L226 Difference]: Without dead ends: 63 [2024-11-21 23:12:14,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-21 23:12:14,587 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-21 23:12:14,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 110 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-21 23:12:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-21 23:12:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2024-11-21 23:12:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-21 23:12:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-21 23:12:14,593 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 17 [2024-11-21 23:12:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:12:14,594 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-21 23:12:14,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-21 23:12:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-21 23:12:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:12:14,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:12:14,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:12:14,602 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 (4)] Ended with exit code 0 [2024-11-21 23:12:14,795 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-21 23:12:14,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:12:14,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:12:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash -939704229, now seen corresponding path program 1 times [2024-11-21 23:12:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:12:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857038925] [2024-11-21 23:12:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:12:14,798 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-21 23:12:14,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:12:14,801 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-21 23:12:14,802 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-21 23:12:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:12:14,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 23:12:14,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:12:17,294 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-21 23:12:17,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:12:17,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:12:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857038925] [2024-11-21 23:12:17,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857038925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:12:17,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:12:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 23:12:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873797103] [2024-11-21 23:12:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:12:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 23:12:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:12:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 23:12:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 23:12:17,297 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-21 23:12:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:12:35,902 INFO L93 Difference]: Finished difference Result 112 states and 149 transitions. [2024-11-21 23:12:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:12:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-21 23:12:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:12:35,911 INFO L225 Difference]: With dead ends: 112 [2024-11-21 23:12:35,912 INFO L226 Difference]: Without dead ends: 87 [2024-11-21 23:12:35,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-21 23:12:35,913 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 52 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-21 23:12:35,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2024-11-21 23:12:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-21 23:12:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 54. [2024-11-21 23:12:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 53 states have internal predecessors, (69), 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-21 23:12:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-11-21 23:12:35,923 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 17 [2024-11-21 23:12:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:12:35,924 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-11-21 23:12:35,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-21 23:12:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-11-21 23:12:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:12:35,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:12:35,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:12:35,933 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-21 23:12:36,125 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-21 23:12:36,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:12:36,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:12:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -530119343, now seen corresponding path program 1 times [2024-11-21 23:12:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:12:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915826206] [2024-11-21 23:12:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:12:36,127 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-21 23:12:36,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:12:36,128 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-21 23:12:36,129 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-21 23:12:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:12:36,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-21 23:12:36,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:12:41,051 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-21 23:12:41,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:12:41,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:12:41,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915826206] [2024-11-21 23:12:41,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915826206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:12:41,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:12:41,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-21 23:12:41,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680420454] [2024-11-21 23:12:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:12:41,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 23:12:41,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:12:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 23:12:41,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-21 23:12:41,054 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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)