./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.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 b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 22:48:16,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 22:48:16,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 22:48:16,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 22:48:16,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 22:48:16,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 22:48:16,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 22:48:16,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 22:48:16,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 22:48:16,574 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 22:48:16,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 22:48:16,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 22:48:16,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 22:48:16,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 22:48:16,575 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 22:48:16,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 22:48:16,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 22:48:16,576 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 22:48:16,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 22:48:16,577 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 22:48:16,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 22:48:16,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 22:48:16,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 22:48:16,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 22:48:16,578 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 22:48:16,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 22:48:16,579 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 22:48:16,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 22:48:16,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 22:48:16,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 22:48:16,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 22:48:16,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:48:16,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 22:48:16,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 22:48:16,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 22:48:16,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 22:48:16,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 22:48:16,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 22:48:16,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 22:48:16,582 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 22:48:16,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 22:48:16,583 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 22:48:16,583 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 22:48:16,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 22:48:16,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 22:48:16,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 22:48:16,812 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 22:48:16,812 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 22:48:16,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2023-11-22 22:48:17,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 22:48:18,107 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 22:48:18,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2023-11-22 22:48:18,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5b52df9/8ba0ed4e516c47419a1072d74bfde27c/FLAGc84cd1d7b [2023-11-22 22:48:18,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5b52df9/8ba0ed4e516c47419a1072d74bfde27c [2023-11-22 22:48:18,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 22:48:18,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 22:48:18,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 22:48:18,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 22:48:18,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 22:48:18,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ab6e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18, skipping insertion in model container [2023-11-22 22:48:18,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,147 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 22:48:18,237 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2023-11-22 22:48:18,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:48:18,257 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 22:48:18,266 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2023-11-22 22:48:18,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 22:48:18,288 INFO L206 MainTranslator]: Completed translation [2023-11-22 22:48:18,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18 WrapperNode [2023-11-22 22:48:18,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 22:48:18,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 22:48:18,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 22:48:18,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 22:48:18,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,312 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2023-11-22 22:48:18,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 22:48:18,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 22:48:18,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 22:48:18,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 22:48:18,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,322 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,333 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 22:48:18,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 22:48:18,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 22:48:18,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 22:48:18,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 22:48:18,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (1/1) ... [2023-11-22 22:48:18,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 22:48:18,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 22:48:18,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 22:48:18,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 22:48:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 22:48:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 22:48:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 22:48:18,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 22:48:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 22:48:18,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 22:48:18,485 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 22:48:18,486 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 22:48:18,628 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 22:48:18,652 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 22:48:18,652 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 22:48:18,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:48:18 BoogieIcfgContainer [2023-11-22 22:48:18,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 22:48:18,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 22:48:18,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 22:48:18,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 22:48:18,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:48:18" (1/3) ... [2023-11-22 22:48:18,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644424ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:48:18, skipping insertion in model container [2023-11-22 22:48:18,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:48:18" (2/3) ... [2023-11-22 22:48:18,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644424ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:48:18, skipping insertion in model container [2023-11-22 22:48:18,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:48:18" (3/3) ... [2023-11-22 22:48:18,659 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-11-22 22:48:18,671 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 22:48:18,671 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 22:48:18,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 22:48:18,708 INFO L357 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, mHoare=true, 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;@67051ef8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 22:48:18,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 22:48:18,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-22 22:48:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 22:48:18,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:48:18,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:48:18,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:48:18,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:48:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 644946439, now seen corresponding path program 1 times [2023-11-22 22:48:18,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:48:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398788610] [2023-11-22 22:48:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:48:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:48:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:48:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:48:19,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398788610] [2023-11-22 22:48:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398788610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:48:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:48:19,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 22:48:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204618209] [2023-11-22 22:48:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:48:19,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 22:48:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:48:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 22:48:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 22:48:19,047 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 30 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-11-22 22:48:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:48:19,218 INFO L93 Difference]: Finished difference Result 102 states and 197 transitions. [2023-11-22 22:48:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 22:48:19,221 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), 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 12 [2023-11-22 22:48:19,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:48:19,283 INFO L225 Difference]: With dead ends: 102 [2023-11-22 22:48:19,283 INFO L226 Difference]: Without dead ends: 59 [2023-11-22 22:48:19,286 INFO L412 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 [2023-11-22 22:48:19,293 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:48:19,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 224 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:48:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-22 22:48:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2023-11-22 22:48:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 33 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 22:48:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2023-11-22 22:48:19,381 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 12 [2023-11-22 22:48:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:48:19,382 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2023-11-22 22:48:19,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-11-22 22:48:19,383 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2023-11-22 22:48:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-22 22:48:19,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:48:19,385 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:48:19,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 22:48:19,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:48:19,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:48:19,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1160344907, now seen corresponding path program 1 times [2023-11-22 22:48:19,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:48:19,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774549696] [2023-11-22 22:48:19,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:48:19,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:48:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 22:48:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 22:48:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:48:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774549696] [2023-11-22 22:48:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774549696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:48:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:48:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:48:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374417816] [2023-11-22 22:48:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:48:19,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:48:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:48:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:48:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:48:19,499 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 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) [2023-11-22 22:48:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:48:19,623 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2023-11-22 22:48:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:48:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 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 17 [2023-11-22 22:48:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:48:19,625 INFO L225 Difference]: With dead ends: 58 [2023-11-22 22:48:19,625 INFO L226 Difference]: Without dead ends: 56 [2023-11-22 22:48:19,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 22:48:19,627 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:48:19,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 177 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:48:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-22 22:48:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-22 22:48:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.1875) internal successors, (38), 36 states have internal predecessors, (38), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 22:48:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2023-11-22 22:48:19,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 17 [2023-11-22 22:48:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:48:19,636 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2023-11-22 22:48:19,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 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) [2023-11-22 22:48:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2023-11-22 22:48:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-22 22:48:19,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:48:19,637 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:48:19,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 22:48:19,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:48:19,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:48:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1092533038, now seen corresponding path program 1 times [2023-11-22 22:48:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:48:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786177591] [2023-11-22 22:48:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:48:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:48:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 22:48:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:48:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 22:48:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 22:48:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-22 22:48:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 22:48:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-22 22:48:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:48:19,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786177591] [2023-11-22 22:48:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786177591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:48:19,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:48:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 22:48:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450410746] [2023-11-22 22:48:19,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:48:19,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 22:48:19,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:48:19,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 22:48:19,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 22:48:19,701 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 22:48:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:48:19,717 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2023-11-22 22:48:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 22:48:19,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2023-11-22 22:48:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:48:19,719 INFO L225 Difference]: With dead ends: 85 [2023-11-22 22:48:19,719 INFO L226 Difference]: Without dead ends: 56 [2023-11-22 22:48:19,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 22:48:19,720 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:48:19,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:48:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-22 22:48:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-11-22 22:48:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 22:48:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2023-11-22 22:48:19,728 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 46 [2023-11-22 22:48:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:48:19,729 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2023-11-22 22:48:19,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 22:48:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2023-11-22 22:48:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-22 22:48:19,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:48:19,730 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:48:19,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 22:48:19,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:48:19,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:48:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1294632752, now seen corresponding path program 1 times [2023-11-22 22:48:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:48:19,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435005281] [2023-11-22 22:48:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:48:19,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:48:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 22:48:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:48:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 22:48:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 22:48:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 22:48:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:48:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-22 22:48:19,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:48:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435005281] [2023-11-22 22:48:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435005281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:48:19,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:48:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:48:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177709029] [2023-11-22 22:48:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:48:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:48:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:48:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:48:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:48:19,849 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 22:48:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:48:19,935 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2023-11-22 22:48:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:48:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2023-11-22 22:48:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:48:19,936 INFO L225 Difference]: With dead ends: 63 [2023-11-22 22:48:19,937 INFO L226 Difference]: Without dead ends: 61 [2023-11-22 22:48:19,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 22:48:19,938 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 22:48:19,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 171 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 22:48:19,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-22 22:48:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-22 22:48:19,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 39 states have internal predecessors, (39), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 22:48:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2023-11-22 22:48:19,947 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 47 [2023-11-22 22:48:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:48:19,947 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2023-11-22 22:48:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 22:48:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2023-11-22 22:48:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-22 22:48:19,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:48:19,950 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:48:19,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 22:48:19,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:48:19,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:48:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash 939016302, now seen corresponding path program 1 times [2023-11-22 22:48:19,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:48:19,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838319043] [2023-11-22 22:48:19,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:48:19,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:48:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 22:48:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:48:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 22:48:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 22:48:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 22:48:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:48:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:48:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 22:48:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-22 22:48:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 22:48:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:48:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 22:48:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-22 22:48:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:48:20,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838319043] [2023-11-22 22:48:20,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838319043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:48:20,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:48:20,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:48:20,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315181597] [2023-11-22 22:48:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:48:20,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:48:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:48:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:48:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:48:20,123 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-22 22:48:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:48:20,187 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2023-11-22 22:48:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:48:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2023-11-22 22:48:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:48:20,189 INFO L225 Difference]: With dead ends: 69 [2023-11-22 22:48:20,190 INFO L226 Difference]: Without dead ends: 67 [2023-11-22 22:48:20,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 22:48:20,190 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 9 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:48:20,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:48:20,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-22 22:48:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2023-11-22 22:48:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.105263157894737) internal successors, (42), 42 states have internal predecessors, (42), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 22:48:20,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2023-11-22 22:48:20,212 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 82 [2023-11-22 22:48:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:48:20,213 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2023-11-22 22:48:20,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-22 22:48:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2023-11-22 22:48:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-22 22:48:20,219 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 22:48:20,219 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 22:48:20,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 22:48:20,219 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 22:48:20,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 22:48:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash 254908718, now seen corresponding path program 1 times [2023-11-22 22:48:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 22:48:20,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401608328] [2023-11-22 22:48:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 22:48:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 22:48:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 22:48:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 22:48:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 22:48:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-22 22:48:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 22:48:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 22:48:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-22 22:48:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 22:48:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-22 22:48:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-22 22:48:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-22 22:48:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 22:48:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 22:48:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 22:48:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-22 22:48:20,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 22:48:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401608328] [2023-11-22 22:48:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401608328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 22:48:20,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 22:48:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 22:48:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148950603] [2023-11-22 22:48:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 22:48:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 22:48:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 22:48:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 22:48:20,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 22:48:20,351 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-22 22:48:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 22:48:20,416 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2023-11-22 22:48:20,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 22:48:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 87 [2023-11-22 22:48:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 22:48:20,419 INFO L225 Difference]: With dead ends: 70 [2023-11-22 22:48:20,419 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 22:48:20,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 22:48:20,423 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 22:48:20,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 273 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 22:48:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 22:48:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 22:48:20,426 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) [2023-11-22 22:48:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 22:48:20,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2023-11-22 22:48:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 22:48:20,427 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 22:48:20,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-22 22:48:20,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 22:48:20,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 22:48:20,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 22:48:20,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 22:48:20,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 22:48:20,677 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-11-22 22:48:20,678 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-11-22 22:48:20,678 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-11-22 22:48:20,678 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-11-22 22:48:20,678 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-11-22 22:48:20,678 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-11-22 22:48:20,679 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,679 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,679 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,679 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2023-11-22 22:48:20,679 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2023-11-22 22:48:20,679 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 22:48:20,680 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,680 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,680 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,680 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,680 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 47 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,681 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,681 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,681 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,681 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,681 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-11-22 22:48:20,681 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-22 22:48:20,682 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,682 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-22 22:48:20,682 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 65 77) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2))) [2023-11-22 22:48:20,682 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2023-11-22 22:48:20,682 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,682 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-22 22:48:20,683 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-22 22:48:20,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 22:48:20,683 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-22 22:48:20,683 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,683 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-22 22:48:20,683 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= .cse4 |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (not (= .cse4 |ULTIMATE.start_main_~urilen~0#1|)))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (<= 2 |ULTIMATE.start_main_~tokenlen~0#1|) .cse1 .cse2 .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|) .cse3)))) [2023-11-22 22:48:20,684 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-22 22:48:20,684 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= .cse4 |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (not (= .cse4 |ULTIMATE.start_main_~urilen~0#1|)))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (<= 2 |ULTIMATE.start_main_~tokenlen~0#1|) .cse1 .cse2 .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|) .cse3)))) [2023-11-22 22:48:20,700 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-22 22:48:20,700 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-22 22:48:20,700 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-11-22 22:48:20,700 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-11-22 22:48:20,700 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-11-22 22:48:20,701 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-22 22:48:20,701 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-22 22:48:20,701 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-22 22:48:20,701 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-22 22:48:20,701 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-11-22 22:48:20,704 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-22 22:48:20,705 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 22:48:20,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:48:20 BoogieIcfgContainer [2023-11-22 22:48:20,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 22:48:20,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 22:48:20,713 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 22:48:20,714 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 22:48:20,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:48:18" (3/4) ... [2023-11-22 22:48:20,715 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 22:48:20,718 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-22 22:48:20,721 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-22 22:48:20,721 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-22 22:48:20,721 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 22:48:20,721 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 22:48:20,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 22:48:20,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 22:48:20,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 22:48:20,781 INFO L158 Benchmark]: Toolchain (without parser) took 2654.92ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 87.7MB in the beginning and 93.0MB in the end (delta: -5.2MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,781 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 161.5MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 22:48:20,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.13ms. Allocated memory is still 161.5MB. Free memory was 87.6MB in the beginning and 76.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.98ms. Allocated memory is still 161.5MB. Free memory was 76.3MB in the beginning and 74.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,782 INFO L158 Benchmark]: Boogie Preprocessor took 49.36ms. Allocated memory is still 161.5MB. Free memory was 74.6MB in the beginning and 131.8MB in the end (delta: -57.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,782 INFO L158 Benchmark]: RCFGBuilder took 289.98ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 131.7MB in the beginning and 161.1MB in the end (delta: -29.4MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,782 INFO L158 Benchmark]: TraceAbstraction took 2058.77ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 98.2MB in the end (delta: 61.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,782 INFO L158 Benchmark]: Witness Printer took 67.21ms. Allocated memory is still 201.3MB. Free memory was 98.2MB in the beginning and 93.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-22 22:48:20,783 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.10ms. Allocated memory is still 161.5MB. Free memory is still 112.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.13ms. Allocated memory is still 161.5MB. Free memory was 87.6MB in the beginning and 76.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.98ms. Allocated memory is still 161.5MB. Free memory was 76.3MB in the beginning and 74.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.36ms. Allocated memory is still 161.5MB. Free memory was 74.6MB in the beginning and 131.8MB in the end (delta: -57.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * RCFGBuilder took 289.98ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 131.7MB in the beginning and 161.1MB in the end (delta: -29.4MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2058.77ms. Allocated memory is still 201.3MB. Free memory was 160.1MB in the beginning and 98.2MB in the end (delta: 61.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 67.21ms. Allocated memory is still 201.3MB. Free memory was 98.2MB in the beginning and 93.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 19]: 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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1169 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 822 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 347 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 71 PreInvPairs, 96 NumberOfFragments, 436 HoareAnnotationTreeSize, 71 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 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: 47]: Loop Invariant Derived loop invariant: ((((cp + 1) <= urilen) && (1 <= cp)) && (0 <= scheme)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((c == 0) && ((cp + 1) <= urilen)) && (1 <= cp)) && (0 <= scheme)) || (((((cp + 1) <= urilen) && (1 <= c)) && (1 <= cp)) && (0 <= scheme))) RESULT: Ultimate proved your program to be correct! [2023-11-22 22:48:20,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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