./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/loop-lit/mine2017-ex4.10.i -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 55b5907667de8828dab419c82ab626d27191191343b82d619fed89d8923b6a77 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:08:12,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:08:12,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:08:12,158 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:08:12,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:08:12,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:08:12,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:08:12,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:08:12,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:08:12,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:08:12,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:08:12,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:08:12,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:08:12,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:08:12,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:08:12,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:08:12,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:08:12,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:08:12,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:08:12,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:08:12,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:08:12,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:08:12,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:08:12,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:08:12,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:08:12,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:08:12,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:08:12,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:08:12,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:08:12,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:08:12,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:08:12,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:08:12,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:08:12,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:08:12,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:08:12,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:08:12,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:08:12,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:08:12,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:08:12,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:08:12,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:08:12,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:08:12,217 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 -> 55b5907667de8828dab419c82ab626d27191191343b82d619fed89d8923b6a77 [2024-11-08 14:08:12,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:08:12,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:08:12,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:08:12,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:08:12,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:08:12,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mine2017-ex4.10.i [2024-11-08 14:08:13,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:08:13,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:08:13,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.10.i [2024-11-08 14:08:13,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3fe651c/0e3b0134cc4e4bdf9700792ef7617a41/FLAG368388238 [2024-11-08 14:08:13,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3fe651c/0e3b0134cc4e4bdf9700792ef7617a41 [2024-11-08 14:08:13,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:08:13,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:08:13,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:08:13,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:08:13,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:08:13,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:08:13" (1/1) ... [2024-11-08 14:08:13,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704bad5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:13, skipping insertion in model container [2024-11-08 14:08:13,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:08:13" (1/1) ... [2024-11-08 14:08:13,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:08:14,083 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/loop-lit/mine2017-ex4.10.i[813,826] [2024-11-08 14:08:14,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:08:14,099 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:08:14,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mine2017-ex4.10.i[813,826] [2024-11-08 14:08:14,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:08:14,126 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:08:14,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14 WrapperNode [2024-11-08 14:08:14,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:08:14,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:08:14,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:08:14,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:08:14,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,150 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-08 14:08:14,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:08:14,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:08:14,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:08:14,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:08:14,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,170 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-08 14:08:14,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:08:14,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:08:14,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:08:14,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:08:14,181 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (1/1) ... [2024-11-08 14:08:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:08:14,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:08:14,213 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:08:14,218 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-08 14:08:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:08:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:08:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:08:14,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:08:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:08:14,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:08:14,316 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:08:14,317 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:08:14,437 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-08 14:08:14,438 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:08:14,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:08:14,452 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:08:14,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:08:14 BoogieIcfgContainer [2024-11-08 14:08:14,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:08:14,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:08:14,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:08:14,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:08:14,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:08:13" (1/3) ... [2024-11-08 14:08:14,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105fd8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:08:14, skipping insertion in model container [2024-11-08 14:08:14,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:08:14" (2/3) ... [2024-11-08 14:08:14,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105fd8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:08:14, skipping insertion in model container [2024-11-08 14:08:14,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:08:14" (3/3) ... [2024-11-08 14:08:14,477 INFO L112 eAbstractionObserver]: Analyzing ICFG mine2017-ex4.10.i [2024-11-08 14:08:14,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:08:14,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:08:14,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:08:14,545 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;@4ff06958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:08:14,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:08:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 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-08 14:08:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 14:08:14,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:14,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:14,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:14,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1816030752, now seen corresponding path program 1 times [2024-11-08 14:08:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:14,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814872947] [2024-11-08 14:08:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:14,679 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-08 14:08:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814872947] [2024-11-08 14:08:14,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814872947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:14,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:08:14,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203520860] [2024-11-08 14:08:14,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:14,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:08:14,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:08:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:08:14,707 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:14,723 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2024-11-08 14:08:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:08:14,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 14:08:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:14,729 INFO L225 Difference]: With dead ends: 34 [2024-11-08 14:08:14,729 INFO L226 Difference]: Without dead ends: 14 [2024-11-08 14:08:14,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:08:14,735 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:14,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-11-08 14:08:14,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-11-08 14:08:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:08:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2024-11-08 14:08:14,761 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2024-11-08 14:08:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:14,762 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2024-11-08 14:08:14,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2024-11-08 14:08:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 14:08:14,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:14,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:14,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:08:14,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:14,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1809566105, now seen corresponding path program 1 times [2024-11-08 14:08:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124452727] [2024-11-08 14:08:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:14,853 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-08 14:08:14,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124452727] [2024-11-08 14:08:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124452727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:14,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:08:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048487974] [2024-11-08 14:08:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:08:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:14,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:08:14,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:08:14,857 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:14,871 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-11-08 14:08:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:08:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 14:08:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:14,872 INFO L225 Difference]: With dead ends: 25 [2024-11-08 14:08:14,872 INFO L226 Difference]: Without dead ends: 17 [2024-11-08 14:08:14,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 14:08:14,874 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:14,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-08 14:08:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-11-08 14:08:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:08:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2024-11-08 14:08:14,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2024-11-08 14:08:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:14,882 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2024-11-08 14:08:14,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2024-11-08 14:08:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-08 14:08:14,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:14,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:08:14,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1811293983, now seen corresponding path program 1 times [2024-11-08 14:08:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452630618] [2024-11-08 14:08:14,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:14,989 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-08 14:08:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452630618] [2024-11-08 14:08:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452630618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:08:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661344376] [2024-11-08 14:08:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:14,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:08:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:08:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:08:14,991 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:15,036 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-08 14:08:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:08:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-08 14:08:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:15,037 INFO L225 Difference]: With dead ends: 21 [2024-11-08 14:08:15,037 INFO L226 Difference]: Without dead ends: 19 [2024-11-08 14:08:15,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:15,038 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:15,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-08 14:08:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-08 14:08:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 14:08:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-08 14:08:15,045 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2024-11-08 14:08:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:15,046 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-08 14:08:15,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-08 14:08:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 14:08:15,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:15,046 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:15,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:08:15,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:15,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash -461769827, now seen corresponding path program 1 times [2024-11-08 14:08:15,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841757569] [2024-11-08 14:08:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:08:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:08:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:15,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841757569] [2024-11-08 14:08:15,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841757569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:15,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:15,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:08:15,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167390325] [2024-11-08 14:08:15,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:15,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:08:15,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:08:15,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:15,147 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:08:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:15,206 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-08 14:08:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:15,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-08 14:08:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:15,207 INFO L225 Difference]: With dead ends: 41 [2024-11-08 14:08:15,207 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 14:08:15,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:15,208 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:15,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 14:08:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-08 14:08:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 14:08:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-08 14:08:15,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 13 [2024-11-08 14:08:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:15,215 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-08 14:08:15,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:08:15,215 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-08 14:08:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 14:08:15,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:15,215 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-08 14:08:15,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:08:15,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:15,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash -973345769, now seen corresponding path program 1 times [2024-11-08 14:08:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:15,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4550521] [2024-11-08 14:08:15,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:08:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:08:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 14:08:15,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:15,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4550521] [2024-11-08 14:08:15,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4550521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:15,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:15,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:08:15,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221125475] [2024-11-08 14:08:15,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:15,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:08:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:08:15,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:15,292 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:08:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:15,333 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-11-08 14:08:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:08:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-08 14:08:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:15,334 INFO L225 Difference]: With dead ends: 37 [2024-11-08 14:08:15,334 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 14:08:15,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:08:15,335 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:15,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 14:08:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-08 14:08:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:08:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-11-08 14:08:15,342 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 25 [2024-11-08 14:08:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:15,342 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2024-11-08 14:08:15,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:08:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-11-08 14:08:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 14:08:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:08:15,344 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 14:08:15,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:08:15,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:08:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:08:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1851284109, now seen corresponding path program 1 times [2024-11-08 14:08:15,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:08:15,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051815454] [2024-11-08 14:08:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:08:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:08:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:08:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:08:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 14:08:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 14:08:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:08:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 14:08:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:08:15,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051815454] [2024-11-08 14:08:15,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051815454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:08:15,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:08:15,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:08:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822959470] [2024-11-08 14:08:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:08:15,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:08:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:08:15,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:08:15,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:08:15,420 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 14:08:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:08:15,435 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2024-11-08 14:08:15,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:08:15,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-08 14:08:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:08:15,437 INFO L225 Difference]: With dead ends: 32 [2024-11-08 14:08:15,437 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 14:08:15,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:08:15,439 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:08:15,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:08:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 14:08:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 14:08:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 14:08:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 14:08:15,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2024-11-08 14:08:15,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:08:15,442 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 14:08:15,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 14:08:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 14:08:15,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 14:08:15,445 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:08:15,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:08:15,448 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 14:08:15,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 14:08:15,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:08:15,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:08:15 BoogieIcfgContainer [2024-11-08 14:08:15,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:08:15,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:08:15,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:08:15,579 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:08:15,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:08:14" (3/4) ... [2024-11-08 14:08:15,581 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 14:08:15,585 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-08 14:08:15,587 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-08 14:08:15,587 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 14:08:15,587 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 14:08:15,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 14:08:15,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:08:15,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 14:08:15,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:08:15,661 INFO L158 Benchmark]: Toolchain (without parser) took 1732.65ms. Allocated memory is still 199.2MB. Free memory was 131.1MB in the beginning and 166.0MB in the end (delta: -34.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:08:15,661 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:08:15,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.34ms. Allocated memory is still 199.2MB. Free memory was 130.9MB in the beginning and 118.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 14:08:15,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.49ms. Allocated memory is still 199.2MB. Free memory was 118.7MB in the beginning and 117.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:08:15,662 INFO L158 Benchmark]: Boogie Preprocessor took 27.42ms. Allocated memory is still 199.2MB. Free memory was 117.3MB in the beginning and 115.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:08:15,662 INFO L158 Benchmark]: RCFGBuilder took 272.81ms. Allocated memory is still 199.2MB. Free memory was 115.8MB in the beginning and 169.7MB in the end (delta: -53.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-08 14:08:15,662 INFO L158 Benchmark]: TraceAbstraction took 1124.01ms. Allocated memory is still 199.2MB. Free memory was 168.9MB in the beginning and 170.1MB in the end (delta: -1.2MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2024-11-08 14:08:15,663 INFO L158 Benchmark]: Witness Printer took 81.52ms. Allocated memory is still 199.2MB. Free memory was 170.1MB in the beginning and 166.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:08:15,664 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.09ms. Allocated memory is still 104.9MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.34ms. Allocated memory is still 199.2MB. Free memory was 130.9MB in the beginning and 118.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.49ms. Allocated memory is still 199.2MB. Free memory was 118.7MB in the beginning and 117.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.42ms. Allocated memory is still 199.2MB. Free memory was 117.3MB in the beginning and 115.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 272.81ms. Allocated memory is still 199.2MB. Free memory was 115.8MB in the beginning and 169.7MB in the end (delta: -53.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1124.01ms. Allocated memory is still 199.2MB. Free memory was 168.9MB in the beginning and 170.1MB in the end (delta: -1.2MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 81.52ms. Allocated memory is still 199.2MB. Free memory was 170.1MB in the beginning and 166.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 85 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 62/62 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((v <= 52) && (1 <= v)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-08 14:08:15,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE