./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 3289d67d 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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:25:32,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:25:32,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:25:32,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:25:32,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:25:32,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:25:32,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:25:32,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:25:32,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:25:32,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:25:32,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:25:32,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:25:32,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:25:32,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:25:32,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:25:32,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:25:32,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:25:32,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:25:32,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:25:32,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:25:32,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:25:32,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:25:32,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:25:32,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:25:32,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:25:32,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:25:32,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:25:32,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:25:32,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:25:32,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:25:32,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:25:32,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:25:32,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:25:32,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:25:32,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:25:32,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:25:32,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:25:32,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:25:32,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:25:32,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:25:32,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:25:32,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:25:32,181 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-16 06:25:32,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:25:32,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:25:32,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:25:32,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:25:32,442 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:25:32,443 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-16 06:25:33,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:25:34,089 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:25:34,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-16 06:25:34,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3269c9ea5/ca6bc728fd67411d9b509b66bad86901/FLAG11d3d3182 [2024-11-16 06:25:34,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3269c9ea5/ca6bc728fd67411d9b509b66bad86901 [2024-11-16 06:25:34,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:25:34,117 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:25:34,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:25:34,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:25:34,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:25:34,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7094fffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34, skipping insertion in model container [2024-11-16 06:25:34,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:25:34,293 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-16 06:25:34,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:25:34,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:25:34,328 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-16 06:25:34,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:25:34,349 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:25:34,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34 WrapperNode [2024-11-16 06:25:34,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:25:34,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:25:34,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:25:34,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:25:34,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,378 INFO L138 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2024-11-16 06:25:34,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:25:34,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:25:34,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:25:34,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:25:34,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,402 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-16 06:25:34,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:25:34,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:25:34,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:25:34,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:25:34,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (1/1) ... [2024-11-16 06:25:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:25:34,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:25:34,441 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-16 06:25:34,448 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-16 06:25:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:25:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:25:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-16 06:25:34,483 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-16 06:25:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:25:34,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:25:34,542 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:25:34,544 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:25:34,714 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-16 06:25:34,714 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:25:34,726 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:25:34,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:25:34,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:25:34 BoogieIcfgContainer [2024-11-16 06:25:34,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:25:34,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:25:34,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:25:34,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:25:34,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:25:34" (1/3) ... [2024-11-16 06:25:34,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b094532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:25:34, skipping insertion in model container [2024-11-16 06:25:34,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:34" (2/3) ... [2024-11-16 06:25:34,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b094532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:25:34, skipping insertion in model container [2024-11-16 06:25:34,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:25:34" (3/3) ... [2024-11-16 06:25:34,739 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-16 06:25:34,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:25:34,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:25:34,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:25:34,818 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;@28872bca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:25:34,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:25:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-16 06:25:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:25:34,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:34,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:25:34,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:34,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash -846291075, now seen corresponding path program 1 times [2024-11-16 06:25:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:25:34,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439661079] [2024-11-16 06:25:34,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:25:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:25:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,229 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-16 06:25:35,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:25:35,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439661079] [2024-11-16 06:25:35,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439661079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:25:35,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:25:35,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:25:35,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846455753] [2024-11-16 06:25:35,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:25:35,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:25:35,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:25:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:25:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:25:35,255 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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.2) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:25:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:25:35,300 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-11-16 06:25:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:25:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-16 06:25:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:25:35,309 INFO L225 Difference]: With dead ends: 56 [2024-11-16 06:25:35,309 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:25:35,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-16 06:25:35,315 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 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-16 06:25:35,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:25:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:25:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:25:35,344 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-16 06:25:35,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-16 06:25:35,347 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 18 [2024-11-16 06:25:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:25:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-16 06:25:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:25:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-16 06:25:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:25:35,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:35,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:25:35,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:25:35,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:35,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1857408325, now seen corresponding path program 1 times [2024-11-16 06:25:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:25:35,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815956897] [2024-11-16 06:25:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:25:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:25:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,433 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-16 06:25:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:25:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815956897] [2024-11-16 06:25:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815956897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:25:35,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:25:35,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:25:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818091962] [2024-11-16 06:25:35,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:25:35,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:25:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:25:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:25:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:25:35,438 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 06:25:35,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:25:35,462 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-11-16 06:25:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:25:35,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 18 [2024-11-16 06:25:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:25:35,464 INFO L225 Difference]: With dead ends: 35 [2024-11-16 06:25:35,465 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 06:25:35,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-16 06:25:35,468 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 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-16 06:25:35,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:25:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 06:25:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-16 06:25:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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-16 06:25:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2024-11-16 06:25:35,476 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 18 [2024-11-16 06:25:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:25:35,477 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2024-11-16 06:25:35,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-16 06:25:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2024-11-16 06:25:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:25:35,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:35,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:25:35,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:25:35,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:35,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1855561283, now seen corresponding path program 1 times [2024-11-16 06:25:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:25:35,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141004589] [2024-11-16 06:25:35,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:25:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:25:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,626 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-16 06:25:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:25:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141004589] [2024-11-16 06:25:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141004589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:25:35,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:25:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:25:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648583532] [2024-11-16 06:25:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:25:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:25:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:25:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:25:35,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:25:35,630 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:25:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:25:35,644 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-11-16 06:25:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:25:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-16 06:25:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:25:35,646 INFO L225 Difference]: With dead ends: 35 [2024-11-16 06:25:35,646 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:25:35,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-16 06:25:35,647 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-16 06:25:35,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:25:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:25:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:25:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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-16 06:25:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-16 06:25:35,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 18 [2024-11-16 06:25:35,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:25:35,654 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-16 06:25:35,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:25:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-16 06:25:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 06:25:35,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:35,655 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, 1] [2024-11-16 06:25:35,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 06:25:35,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:35,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash 981137616, now seen corresponding path program 1 times [2024-11-16 06:25:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:25:35,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624254386] [2024-11-16 06:25:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:25:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:25:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 06:25:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,719 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-16 06:25:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:25:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624254386] [2024-11-16 06:25:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624254386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:25:35,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:25:35,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:25:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399051512] [2024-11-16 06:25:35,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:25:35,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:25:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:25:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:25:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:25:35,724 INFO L87 Difference]: Start difference. First operand 29 states and 37 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, (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-16 06:25:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:25:35,751 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-16 06:25:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:25:35,755 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, (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 24 [2024-11-16 06:25:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:25:35,755 INFO L225 Difference]: With dead ends: 45 [2024-11-16 06:25:35,756 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:25:35,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-16 06:25:35,757 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 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-16 06:25:35,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:25:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:25:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:25:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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-16 06:25:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-16 06:25:35,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 24 [2024-11-16 06:25:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:25:35,767 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-16 06:25:35,767 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, (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-16 06:25:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-16 06:25:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 06:25:35,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:35,770 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, 1] [2024-11-16 06:25:35,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 06:25:35,771 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:35,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -570194236, now seen corresponding path program 1 times [2024-11-16 06:25:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:25:35,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476402342] [2024-11-16 06:25:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:25:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:25:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:25:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 06:25:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:35,849 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-16 06:25:35,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:25:35,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476402342] [2024-11-16 06:25:35,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476402342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:25:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:25:35,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:25:35,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981636930] [2024-11-16 06:25:35,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:25:35,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:25:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:25:35,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:25:35,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:25:35,854 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-16 06:25:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:25:35,885 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-16 06:25:35,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:25:35,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 30 [2024-11-16 06:25:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:25:35,886 INFO L225 Difference]: With dead ends: 49 [2024-11-16 06:25:35,886 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:25:35,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-16 06:25:35,888 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-16 06:25:35,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:25:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:25:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-16 06:25:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-16 06:25:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-16 06:25:35,897 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 30 [2024-11-16 06:25:35,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:25:35,897 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-16 06:25:35,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-16 06:25:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-16 06:25:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 06:25:35,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:35,903 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, 1] [2024-11-16 06:25:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 06:25:35,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:35,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 939390681, now seen corresponding path program 1 times [2024-11-16 06:25:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:25:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922588180] [2024-11-16 06:25:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:25:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:25:35,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:25:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:25:36,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:25:36,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:25:36,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:25:36,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 06:25:36,008 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 06:25:36,040 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:25:36,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:25:36 BoogieIcfgContainer [2024-11-16 06:25:36,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:25:36,044 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:25:36,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:25:36,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:25:36,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:25:34" (3/4) ... [2024-11-16 06:25:36,047 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 06:25:36,048 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:25:36,049 INFO L158 Benchmark]: Toolchain (without parser) took 1932.21ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 116.3MB in the beginning and 147.3MB in the end (delta: -31.0MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-16 06:25:36,051 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 169.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:25:36,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.63ms. Allocated memory is still 169.9MB. Free memory was 116.3MB in the beginning and 103.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 06:25:36,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.17ms. Allocated memory is still 169.9MB. Free memory was 103.7MB in the beginning and 102.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:25:36,052 INFO L158 Benchmark]: Boogie Preprocessor took 31.40ms. Allocated memory is still 169.9MB. Free memory was 102.2MB in the beginning and 100.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:25:36,052 INFO L158 Benchmark]: IcfgBuilder took 315.40ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 87.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 06:25:36,052 INFO L158 Benchmark]: TraceAbstraction took 1311.91ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 86.5MB in the beginning and 147.3MB in the end (delta: -60.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-16 06:25:36,052 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 239.1MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:25:36,055 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.22ms. Allocated memory is still 169.9MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.63ms. Allocated memory is still 169.9MB. Free memory was 116.3MB in the beginning and 103.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.17ms. Allocated memory is still 169.9MB. Free memory was 103.7MB in the beginning and 102.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.40ms. Allocated memory is still 169.9MB. Free memory was 102.2MB in the beginning and 100.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 315.40ms. Allocated memory is still 169.9MB. Free memory was 100.5MB in the beginning and 87.0MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1311.91ms. Allocated memory was 169.9MB in the beginning and 239.1MB in the end (delta: 69.2MB). Free memory was 86.5MB in the beginning and 147.3MB in the end (delta: -60.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 239.1MB. Free memory is still 147.3MB. 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=355, item4=356] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=0, item2=0, item3=355, item4=356] [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=355, item4=356] [L30] EXPR check_domain(item1) && check_domain(item2) VAL [item1=0, item2=0, item3=355, item4=356] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=0, item2=0, item3=355, item4=356] [L30] CALL, EXPR check_domain(item3) VAL [\old(x)=355] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=355, \result=1] [L30] RET, EXPR check_domain(item3) VAL [item1=0, item2=0, item3=355, item4=356] [L30] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) VAL [item1=0, item2=0, item3=355, item4=356] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=0, item2=0, item3=355, item4=356] [L31] CALL, EXPR check_domain(item4) VAL [\old(x)=356] [L26] COND TRUE x >= 0 && x <= 711 [L26] return 1; VAL [\old(x)=356, \result=1] [L31] RET, EXPR check_domain(item4) VAL [item1=0, item2=0, item3=355, item4=356] [L30-L31] EXPR check_domain(item1) && check_domain(item2) && check_domain(item3) && check_domain(item4) VAL [item1=0, item2=0, item3=355, item4=356] [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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, 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, 413 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 153 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, 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.5s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 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-16 06:25:36,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:25:38,294 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:25:38,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 06:25:38,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:25:38,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:25:38,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:25:38,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:25:38,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:25:38,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:25:38,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:25:38,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:25:38,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:25:38,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:25:38,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:25:38,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:25:38,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:25:38,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:25:38,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:25:38,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:25:38,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:25:38,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:25:38,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:25:38,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:25:38,435 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 06:25:38,435 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 06:25:38,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:25:38,436 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 06:25:38,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:25:38,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:25:38,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:25:38,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:25:38,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:25:38,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:25:38,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:25:38,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:25:38,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:25:38,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:25:38,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:25:38,441 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 06:25:38,442 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 06:25:38,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:25:38,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:25:38,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:25:38,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:25:38,443 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-16 06:25:38,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:25:38,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:25:38,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:25:38,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:25:38,799 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:25:38,800 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-16 06:25:40,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:25:40,450 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:25:40,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/bound-grocery.c [2024-11-16 06:25:40,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b74eeb4c7/1d5e8af7471c44448d2a7159b2a71dfe/FLAGf3b82bdf1 [2024-11-16 06:25:40,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b74eeb4c7/1d5e8af7471c44448d2a7159b2a71dfe [2024-11-16 06:25:40,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:25:40,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:25:40,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:25:40,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:25:40,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:25:40,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:25:40" (1/1) ... [2024-11-16 06:25:40,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f60db02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:40, skipping insertion in model container [2024-11-16 06:25:40,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:25:40" (1/1) ... [2024-11-16 06:25:40,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:25:41,067 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-16 06:25:41,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:25:41,100 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:25:41,113 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-16 06:25:41,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:25:41,141 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:25:41,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41 WrapperNode [2024-11-16 06:25:41,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:25:41,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:25:41,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:25:41,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:25:41,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,185 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-16 06:25:41,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:25:41,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:25:41,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:25:41,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:25:41,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,199 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,213 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-16 06:25:41,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:25:41,240 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:25:41,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:25:41,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:25:41,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (1/1) ... [2024-11-16 06:25:41,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:25:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:25:41,273 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-16 06:25:41,276 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-16 06:25:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:25:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 06:25:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-16 06:25:41,310 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-16 06:25:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:25:41,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:25:41,389 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:25:41,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:25:50,122 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-16 06:25:50,122 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:25:50,136 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:25:50,136 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:25:50,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:25:50 BoogieIcfgContainer [2024-11-16 06:25:50,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:25:50,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:25:50,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:25:50,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:25:50,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:25:40" (1/3) ... [2024-11-16 06:25:50,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405c2a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:25:50, skipping insertion in model container [2024-11-16 06:25:50,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:25:41" (2/3) ... [2024-11-16 06:25:50,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405c2a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:25:50, skipping insertion in model container [2024-11-16 06:25:50,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:25:50" (3/3) ... [2024-11-16 06:25:50,145 INFO L112 eAbstractionObserver]: Analyzing ICFG bound-grocery.c [2024-11-16 06:25:50,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:25:50,171 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:25:50,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:25:50,223 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;@22481a6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:25:50,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:25:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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-16 06:25:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:25:50,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:25:50,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:25:50,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:25:50,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:25:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash -846291075, now seen corresponding path program 1 times [2024-11-16 06:25:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:25:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906388107] [2024-11-16 06:25:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:25:50,254 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-16 06:25:50,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:25:50,258 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-16 06:25:50,259 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-16 06:25:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:25:50,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 06:25:50,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:25:51,236 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-16 06:25:51,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:25:51,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:25:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906388107] [2024-11-16 06:25:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906388107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:25:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:25:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:25:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51146832] [2024-11-16 06:25:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:25:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:25:51,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:25:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:25:51,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:25:51,269 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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.2) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:25:55,911 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-16 06:25:59,916 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-16 06:26:04,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 06:26:08,389 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-16 06:26:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:26:08,595 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-11-16 06:26:08,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:26:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-16 06:26:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:26:08,603 INFO L225 Difference]: With dead ends: 56 [2024-11-16 06:26:08,603 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:26:08,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-16 06:26:08,607 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 06:26:08,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2024-11-16 06:26:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:26:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:26:08,637 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-16 06:26:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-11-16 06:26:08,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 18 [2024-11-16 06:26:08,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:26:08,641 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-11-16 06:26:08,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:26:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-11-16 06:26:08,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:26:08,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:26:08,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:26:08,660 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-16 06:26:08,844 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-16 06:26:08,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:26:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:26:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1857408325, now seen corresponding path program 1 times [2024-11-16 06:26:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:26:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252126234] [2024-11-16 06:26:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:26:08,847 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-16 06:26:08,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:26:08,849 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-16 06:26:08,850 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-16 06:26:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:26:09,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 06:26:09,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:26:10,376 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-16 06:26:10,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:26:10,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:26:10,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252126234] [2024-11-16 06:26:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252126234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:26:10,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:26:10,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 06:26:10,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601888766] [2024-11-16 06:26:10,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:26:10,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:26:10,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:26:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:26:10,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:26:10,380 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-16 06:26:15,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 06:26:19,413 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-16 06:26:23,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 06:26:27,448 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-16 06:26:31,458 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-16 06:26:35,463 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-16 06:26:40,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 06:26:44,108 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-16 06:26:48,112 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-16 06:26:52,120 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-16 06:26:56,536 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-16 06:27:00,539 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-16 06:27:04,548 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-16 06:27:08,563 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-16 06:27:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:27:08,564 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2024-11-16 06:27:08,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:27:08,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2024-11-16 06:27:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:27:08,685 INFO L225 Difference]: With dead ends: 56 [2024-11-16 06:27:08,685 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 06:27:08,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:27:08,686 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:27:08,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 58.2s Time] [2024-11-16 06:27:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 06:27:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-16 06:27:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-16 06:27:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-16 06:27:08,694 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 18 [2024-11-16 06:27:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:27:08,695 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-16 06:27:08,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-16 06:27:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-16 06:27:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:27:08,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:27:08,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:27:08,714 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-16 06:27:08,897 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-16 06:27:08,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:27:08,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:27:08,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1855561283, now seen corresponding path program 1 times [2024-11-16 06:27:08,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:27:08,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037281179] [2024-11-16 06:27:08,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:27:08,899 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-16 06:27:08,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:27:08,901 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-16 06:27:08,902 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-16 06:27:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:27:09,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:27:09,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:27:09,563 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-16 06:27:09,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:27:09,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:27:09,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037281179] [2024-11-16 06:27:09,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037281179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:27:09,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:27:09,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:27:09,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898828842] [2024-11-16 06:27:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:27:09,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:27:09,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:27:09,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:27:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:27:09,567 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:27:13,922 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-16 06:27:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:27:14,066 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-16 06:27:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:27:14,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-16 06:27:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:27:14,067 INFO L225 Difference]: With dead ends: 39 [2024-11-16 06:27:14,067 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 06:27:14,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-16 06:27:14,069 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-16 06:27:14,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-16 06:27:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 06:27:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 06:27:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 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-16 06:27:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-16 06:27:14,075 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2024-11-16 06:27:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:27:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-16 06:27:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 06:27:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-16 06:27:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 06:27:14,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:27:14,077 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, 1] [2024-11-16 06:27:14,095 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-16 06:27:14,277 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-16 06:27:14,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:27:14,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:27:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 939390681, now seen corresponding path program 1 times [2024-11-16 06:27:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:27:14,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491726096] [2024-11-16 06:27:14,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:27:14,279 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-16 06:27:14,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:27:14,282 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-16 06:27:14,284 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