./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/bound-grocery.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/bound-grocery.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 c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:57:45,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:57:45,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 12:57:46,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:57:46,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:57:46,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:57:46,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:57:46,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:57:46,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:57:46,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:57:46,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:57:46,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:57:46,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:57:46,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:57:46,052 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:57:46,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:57:46,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:57:46,053 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:57:46,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 12:57:46,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:57:46,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:57:46,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:57:46,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:57:46,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:57:46,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:57:46,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:57:46,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:57:46,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:57:46,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:57:46,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:57:46,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:57:46,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:57:46,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:57:46,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:57:46,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:57:46,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:57:46,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 12:57:46,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 12:57:46,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:57:46,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:57:46,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:57:46,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:57:46,063 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 -> c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 [2024-11-18 12:57:46,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:57:46,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:57:46,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:57:46,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:57:46,367 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:57:46,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-18 12:57:47,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:57:48,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:57:48,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-18 12:57:48,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff563ad4/80098417225c4d31b5eb0ddd831cbf00/FLAG9e4a424db [2024-11-18 12:57:48,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff563ad4/80098417225c4d31b5eb0ddd831cbf00 [2024-11-18 12:57:48,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:57:48,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:57:48,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:57:48,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:57:48,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:57:48,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af80867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48, skipping insertion in model container [2024-11-18 12:57:48,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:57:48,309 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/floats-nonlinear/bound-grocery.c[606,619] [2024-11-18 12:57:48,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:57:48,335 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:57:48,344 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/floats-nonlinear/bound-grocery.c[606,619] [2024-11-18 12:57:48,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:57:48,365 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:57:48,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48 WrapperNode [2024-11-18 12:57:48,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:57:48,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:57:48,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:57:48,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:57:48,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,380 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,401 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-11-18 12:57:48,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:57:48,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:57:48,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:57:48,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:57:48,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,432 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-18 12:57:48,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:57:48,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:57:48,455 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:57:48,455 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:57:48,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (1/1) ... [2024-11-18 12:57:48,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:57:48,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:57:48,493 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-18 12:57:48,497 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-18 12:57:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:57:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 12:57:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-18 12:57:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-18 12:57:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:57:48,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:57:48,599 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:57:48,601 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:57:48,734 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-18 12:57:48,734 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:57:48,745 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:57:48,746 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 12:57:48,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:57:48 BoogieIcfgContainer [2024-11-18 12:57:48,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:57:48,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:57:48,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:57:48,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:57:48,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:57:48" (1/3) ... [2024-11-18 12:57:48,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c87316b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:57:48, skipping insertion in model container [2024-11-18 12:57:48,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:48" (2/3) ... [2024-11-18 12:57:48,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c87316b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:57:48, skipping insertion in model container [2024-11-18 12:57:48,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:57:48" (3/3) ... [2024-11-18 12:57:48,758 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-18 12:57:48,772 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:57:48,772 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:57:48,819 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:57:48,824 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;@2a2ff76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:57:48,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:57:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:57:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 12:57:48,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:57:48,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:57:48,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:57:48,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:57:48,839 INFO L85 PathProgramCache]: Analyzing trace with hash -36567605, now seen corresponding path program 1 times [2024-11-18 12:57:48,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:57:48,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532613007] [2024-11-18 12:57:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:57:48,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:57:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:57:49,187 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-18 12:57:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:57:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532613007] [2024-11-18 12:57:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532613007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:57:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:57:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 12:57:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733797868] [2024-11-18 12:57:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:57:49,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:57:49,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:57:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:57:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:57:49,215 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:57:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:57:49,264 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-18 12:57:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:57:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 12:57:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:57:49,273 INFO L225 Difference]: With dead ends: 53 [2024-11-18 12:57:49,273 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 12:57:49,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:57:49,278 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:57:49,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:57:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 12:57:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-18 12:57:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:57:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-18 12:57:49,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2024-11-18 12:57:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:57:49,308 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-18 12:57:49,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:57:49,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-18 12:57:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 12:57:49,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:57:49,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:57:49,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 12:57:49,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:57:49,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:57:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash -329970612, now seen corresponding path program 1 times [2024-11-18 12:57:49,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:57:49,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102342397] [2024-11-18 12:57:49,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:57:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:57:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:57:49,358 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-18 12:57:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:57:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102342397] [2024-11-18 12:57:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102342397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:57:49,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:57:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:57:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488502546] [2024-11-18 12:57:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:57:49,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:57:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:57:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:57:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:57:49,363 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:57:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:57:49,379 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-11-18 12:57:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:57:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 12:57:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:57:49,381 INFO L225 Difference]: With dead ends: 33 [2024-11-18 12:57:49,381 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 12:57:49,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:57:49,384 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:57:49,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:57:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 12:57:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 12:57:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:57:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-18 12:57:49,393 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 17 [2024-11-18 12:57:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:57:49,394 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-18 12:57:49,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:57:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-18 12:57:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 12:57:49,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:57:49,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:57:49,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 12:57:49,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:57:49,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:57:49,398 INFO L85 PathProgramCache]: Analyzing trace with hash -329911030, now seen corresponding path program 1 times [2024-11-18 12:57:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:57:49,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084495777] [2024-11-18 12:57:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:57:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:57:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:57:49,623 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-18 12:57:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:57:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084495777] [2024-11-18 12:57:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084495777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:57:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:57:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:57:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692384046] [2024-11-18 12:57:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:57:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:57:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:57:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:57:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:57:49,627 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:57:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:57:49,652 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-11-18 12:57:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:57:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 12:57:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:57:49,654 INFO L225 Difference]: With dead ends: 33 [2024-11-18 12:57:49,654 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 12:57:49,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:57:49,656 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:57:49,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:57:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 12:57:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-18 12:57:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:57:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-11-18 12:57:49,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-11-18 12:57:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:57:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-11-18 12:57:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:57:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-11-18 12:57:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 12:57:49,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:57:49,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:57:49,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 12:57:49,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:57:49,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:57:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash -752866454, now seen corresponding path program 1 times [2024-11-18 12:57:49,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:57:49,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137517258] [2024-11-18 12:57:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:57:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:57:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:57:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:57:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:57:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137517258] [2024-11-18 12:57:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137517258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:57:49,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:57:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:57:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847155798] [2024-11-18 12:57:49,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:57:49,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:57:49,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:57:49,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:57:49,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:57:49,751 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 12:57:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:57:49,781 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-18 12:57:49,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:57:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-18 12:57:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:57:49,783 INFO L225 Difference]: With dead ends: 43 [2024-11-18 12:57:49,783 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 12:57:49,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:57:49,788 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:57:49,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:57:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 12:57:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-18 12:57:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:57:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-18 12:57:49,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 23 [2024-11-18 12:57:49,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:57:49,797 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-18 12:57:49,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-18 12:57:49,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-18 12:57:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 12:57:49,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:57:49,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:57:49,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 12:57:49,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:57:49,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:57:49,800 INFO L85 PathProgramCache]: Analyzing trace with hash 475007939, now seen corresponding path program 1 times [2024-11-18 12:57:49,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:57:49,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203581808] [2024-11-18 12:57:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:57:49,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:57:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:57:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 12:57:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:57:49,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203581808] [2024-11-18 12:57:49,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203581808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:57:49,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:57:49,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:57:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127096810] [2024-11-18 12:57:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:57:49,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:57:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:57:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:57:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:57:49,894 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 12:57:49,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:57:49,928 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-18 12:57:49,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:57:49,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2024-11-18 12:57:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:57:49,929 INFO L225 Difference]: With dead ends: 47 [2024-11-18 12:57:49,930 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 12:57:49,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:57:49,932 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:57:49,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:57:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 12:57:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-18 12:57:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:57:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-18 12:57:49,942 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 29 [2024-11-18 12:57:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:57:49,943 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-18 12:57:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 12:57:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-18 12:57:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 12:57:49,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:57:49,945 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:57:49,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 12:57:49,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:57:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:57:49,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1979909910, now seen corresponding path program 1 times [2024-11-18 12:57:49,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:57:49,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610965558] [2024-11-18 12:57:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:57:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:57:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 12:57:49,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 12:57:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 12:57:50,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 12:57:50,049 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 12:57:50,052 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 12:57:50,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 12:57:50,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 12:57:50,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 12:57:50,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:57:50 BoogieIcfgContainer [2024-11-18 12:57:50,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 12:57:50,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 12:57:50,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 12:57:50,093 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 12:57:50,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:57:48" (3/4) ... [2024-11-18 12:57:50,096 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 12:57:50,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 12:57:50,099 INFO L158 Benchmark]: Toolchain (without parser) took 2027.08ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 71.0MB in the beginning and 122.2MB in the end (delta: -51.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:57:50,100 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:57:50,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.28ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 70.7MB in the beginning and 157.2MB in the end (delta: -86.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-18 12:57:50,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.03ms. Allocated memory is still 186.6MB. Free memory was 157.2MB in the beginning and 156.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:57:50,102 INFO L158 Benchmark]: Boogie Preprocessor took 47.89ms. Allocated memory is still 186.6MB. Free memory was 156.1MB in the beginning and 154.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 12:57:50,103 INFO L158 Benchmark]: RCFGBuilder took 294.53ms. Allocated memory is still 186.6MB. Free memory was 154.0MB in the beginning and 140.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 12:57:50,104 INFO L158 Benchmark]: TraceAbstraction took 1340.41ms. Allocated memory is still 186.6MB. Free memory was 140.4MB in the beginning and 122.2MB in the end (delta: 18.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-18 12:57:50,104 INFO L158 Benchmark]: Witness Printer took 6.51ms. Allocated memory is still 186.6MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:57:50,105 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.13ms. Allocated memory is still 140.5MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.28ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 70.7MB in the beginning and 157.2MB in the end (delta: -86.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.03ms. Allocated memory is still 186.6MB. Free memory was 157.2MB in the beginning and 156.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.89ms. Allocated memory is still 186.6MB. Free memory was 156.1MB in the beginning and 154.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.53ms. Allocated memory is still 186.6MB. Free memory was 154.0MB in the beginning and 140.4MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1340.41ms. Allocated memory is still 186.6MB. Free memory was 140.4MB in the beginning and 122.2MB in the end (delta: 18.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 6.51ms. Allocated memory is still 186.6MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: 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 someBinaryDOUBLEComparisonOperation at line 32. Possible FailurePath: [L40] int x, y, z, w; [L41] x = __VERIFIER_nondet_int() [L42] y = __VERIFIER_nondet_int() [L43] z = __VERIFIER_nondet_int() [L44] w = __VERIFIER_nondet_int() [L45] CALL, EXPR solve(x, y, z, w) [L30] CALL, EXPR check_domain(item1) VAL [\old(x)=0] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=0, \result=1] [L30] RET, EXPR check_domain(item1) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=0, item2=0, item3=0, item4=711] [L30] CALL, EXPR check_domain(item2) VAL [\old(x)=0] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=0, \result=1] [L30] RET, EXPR check_domain(item2) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=0, item2=0, item3=0, item4=711] [L30] CALL, EXPR check_domain(item3) VAL [\old(x)=0] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=0, \result=1] [L30] RET, EXPR check_domain(item3) VAL [item1=0, item2=0, item3=0, item4=711] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=0, item2=0, item3=0, item4=711] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=0, item2=0, item3=0, item4=711] [L31] CALL, EXPR check_domain(item4) VAL [\old(x)=711] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=711, \result=1] [L31] RET, EXPR check_domain(item4) VAL [item1=0, item2=0, item3=0, item4=711] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=0, item2=0, item3=0, item4=711] [L30-L33] COND TRUE check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) && item1 + item2 + item3 + item4 == 711 && (item1 + 0.0) * item2 * item3 * item4 == 711.0 * 100 * 100 * 100 && item1 <= item2 && item2 <= item3 && item3 <= item4 [L34] return 1; VAL [\result=1] [L45] RET, EXPR solve(x, y, z, w) [L45] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 148 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=2, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 16/16 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-18 12:57:50,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/bound-grocery.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 c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:57:52,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:57:52,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 12:57:52,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:57:52,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:57:52,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:57:52,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:57:52,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:57:52,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:57:52,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:57:52,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:57:52,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:57:52,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:57:52,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:57:52,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:57:52,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:57:52,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:57:52,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:57:52,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:57:52,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:57:52,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:57:52,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:57:52,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:57:52,659 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 12:57:52,659 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 12:57:52,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:57:52,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 12:57:52,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:57:52,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:57:52,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:57:52,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:57:52,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:57:52,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:57:52,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:57:52,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:57:52,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:57:52,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:57:52,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:57:52,663 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 12:57:52,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 12:57:52,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:57:52,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:57:52,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:57:52,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:57:52,666 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 -> c1c842b4a36d74cf3c9ba6a921e1163d6c11fc4826eddbcec790a19f691a5540 [2024-11-18 12:57:53,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:57:53,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:57:53,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:57:53,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:57:53,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:57:53,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-18 12:57:54,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:57:55,014 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:57:55,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-18 12:57:55,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efa2bac0/8c7984aba79b4af4be718880f9e786c2/FLAG57a4ee931 [2024-11-18 12:57:55,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9efa2bac0/8c7984aba79b4af4be718880f9e786c2 [2024-11-18 12:57:55,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:57:55,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:57:55,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:57:55,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:57:55,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:57:55,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0d109a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55, skipping insertion in model container [2024-11-18 12:57:55,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:57:55,625 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/floats-nonlinear/bound-grocery.c[606,619] [2024-11-18 12:57:55,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:57:55,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:57:55,674 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/floats-nonlinear/bound-grocery.c[606,619] [2024-11-18 12:57:55,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:57:55,703 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:57:55,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55 WrapperNode [2024-11-18 12:57:55,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:57:55,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:57:55,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:57:55,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:57:55,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,744 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-18 12:57:55,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:57:55,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:57:55,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:57:55,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:57:55,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,777 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-18 12:57:55,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,789 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:57:55,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:57:55,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:57:55,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:57:55,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (1/1) ... [2024-11-18 12:57:55,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:57:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:57:55,856 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-18 12:57:55,860 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-18 12:57:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:57:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 12:57:55,909 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-18 12:57:55,909 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-18 12:57:55,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:57:55,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:57:55,994 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:57:55,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:58:04,525 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-18 12:58:04,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:58:04,539 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:58:04,540 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-18 12:58:04,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:04 BoogieIcfgContainer [2024-11-18 12:58:04,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:58:04,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:58:04,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:58:04,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:58:04,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:57:55" (1/3) ... [2024-11-18 12:58:04,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a2d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:58:04, skipping insertion in model container [2024-11-18 12:58:04,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:57:55" (2/3) ... [2024-11-18 12:58:04,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a2d0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:58:04, skipping insertion in model container [2024-11-18 12:58:04,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:58:04" (3/3) ... [2024-11-18 12:58:04,551 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-18 12:58:04,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:58:04,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:58:04,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:58:04,618 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;@204932f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:58:04,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:58:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-18 12:58:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 12:58:04,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:04,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:04,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:04,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash -36567605, now seen corresponding path program 1 times [2024-11-18 12:58:04,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:58:04,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123003255] [2024-11-18 12:58:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:04,646 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-18 12:58:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:58:04,649 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-18 12:58:04,651 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-18 12:58:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:05,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 12:58:05,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:05,698 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-18 12:58:05,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:58:05,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:58:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123003255] [2024-11-18 12:58:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123003255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 12:58:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166875421] [2024-11-18 12:58:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:05,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:58:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:58:05,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:58:05,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:05,729 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:10,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 12:58:14,388 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 [] [2024-11-18 12:58:18,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 12:58:22,819 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 [] [2024-11-18 12:58:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:58:22,995 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2024-11-18 12:58:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:58:22,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 12:58:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:58:23,004 INFO L225 Difference]: With dead ends: 53 [2024-11-18 12:58:23,004 INFO L226 Difference]: Without dead ends: 28 [2024-11-18 12:58:23,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:58:23,009 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2024-11-18 12:58:23,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 17.2s Time] [2024-11-18 12:58:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-18 12:58:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-18 12:58:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:58:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-18 12:58:23,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2024-11-18 12:58:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:58:23,043 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-18 12:58:23,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-18 12:58:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 12:58:23,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:58:23,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:58:23,066 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-18 12:58:23,246 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-18 12:58:23,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:58:23,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:58:23,247 INFO L85 PathProgramCache]: Analyzing trace with hash -329970612, now seen corresponding path program 1 times [2024-11-18 12:58:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:58:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590605630] [2024-11-18 12:58:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:58:23,248 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-18 12:58:23,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:58:23,252 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-18 12:58:23,253 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-18 12:58:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:58:23,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 12:58:23,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:58:24,675 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-18 12:58:24,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:58:24,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:58:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590605630] [2024-11-18 12:58:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590605630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:58:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:58:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 12:58:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689722066] [2024-11-18 12:58:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:58:24,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 12:58:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:58:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 12:58:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 12:58:24,679 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:58:29,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 12:58:33,544 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 [] [2024-11-18 12:58:37,547 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 [] [2024-11-18 12:58:41,557 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 [] [2024-11-18 12:58:45,567 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 [] [2024-11-18 12:58:49,575 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 [] [2024-11-18 12:58:54,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 12:58:58,195 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 [] [2024-11-18 12:59:02,200 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 [] [2024-11-18 12:59:06,214 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 [] [2024-11-18 12:59:10,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 12:59:14,600 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 [] [2024-11-18 12:59:18,604 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 [] [2024-11-18 12:59:22,614 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 [] [2024-11-18 12:59:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:22,615 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-11-18 12:59:22,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 12:59:22,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 12:59:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:22,739 INFO L225 Difference]: With dead ends: 54 [2024-11-18 12:59:22,739 INFO L226 Difference]: Without dead ends: 33 [2024-11-18 12:59:22,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 12:59:22,740 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.9s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:22,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 57.9s Time] [2024-11-18 12:59:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-18 12:59:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-18 12:59:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-18 12:59:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-11-18 12:59:22,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2024-11-18 12:59:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:22,750 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-11-18 12:59:22,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:59:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-11-18 12:59:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 12:59:22,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:22,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:22,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:22,951 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-18 12:59:22,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:22,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -329911030, now seen corresponding path program 1 times [2024-11-18 12:59:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:22,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615633112] [2024-11-18 12:59:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:22,954 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-18 12:59:22,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:22,955 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-18 12:59:22,958 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-18 12:59:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:23,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 12:59:23,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:23,637 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-18 12:59:23,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 12:59:23,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 12:59:23,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615633112] [2024-11-18 12:59:23,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615633112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:23,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 12:59:23,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192414740] [2024-11-18 12:59:23,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:23,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 12:59:23,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 12:59:23,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 12:59:23,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:59:23,640 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:59:27,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-18 12:59:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:28,110 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-11-18 12:59:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 12:59:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-18 12:59:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:28,112 INFO L225 Difference]: With dead ends: 37 [2024-11-18 12:59:28,112 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 12:59:28,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 12:59:28,113 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:28,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-18 12:59:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 12:59:28,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 12:59:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-18 12:59:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-18 12:59:28,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2024-11-18 12:59:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:28,121 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-18 12:59:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 12:59:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-18 12:59:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 12:59:28,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:28,122 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:28,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:28,323 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-18 12:59:28,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1979909910, now seen corresponding path program 1 times [2024-11-18 12:59:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 12:59:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567907954] [2024-11-18 12:59:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:28,324 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-18 12:59:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 12:59:28,329 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-18 12:59:28,330 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