./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-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.graphml --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 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 15:02:37,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 15:02:37,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 15:02:37,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 15:02:37,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 15:02:37,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 15:02:37,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 15:02:37,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 15:02:37,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 15:02:37,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 15:02:37,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 15:02:37,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 15:02:37,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 15:02:37,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 15:02:37,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 15:02:37,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 15:02:37,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 15:02:37,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 15:02:37,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 15:02:37,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 15:02:37,463 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 15:02:37,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 15:02:37,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 15:02:37,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 15:02:37,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 15:02:37,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 15:02:37,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 15:02:37,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 15:02:37,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 15:02:37,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 15:02:37,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 15:02:37,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 15:02:37,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 15:02:37,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 15:02:37,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 15:02:37,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 15:02:37,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 15:02:37,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 15:02:37,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 15:02:37,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 15:02:37,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 15:02:37,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 15:02:37,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 15:02:37,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 15:02:37,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 15:02:37,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 15:02:37,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 15:02:37,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 15:02:37,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 15:02:37,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 15:02:37,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 15:02:37,515 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 15:02:37,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 15:02:37,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 15:02:37,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 15:02:37,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 15:02:37,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 15:02:37,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 15:02:37,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 15:02:37,518 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 15:02:37,518 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 15:02:37,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 15:02:37,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 15:02:37,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 15:02:37,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 15:02:37,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 15:02:37,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 15:02:37,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:02:37,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 15:02:37,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 15:02:37,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 15:02:37,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 15:02:37,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 15:02:37,522 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 15:02:37,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 15:02:37,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 15:02:37,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 [2022-07-19 15:02:37,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 15:02:37,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 15:02:37,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 15:02:37,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 15:02:37,767 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 15:02:37,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-07-19 15:02:37,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b27db6a/e0df961c63e548edba975a7928976739/FLAG011699601 [2022-07-19 15:02:38,257 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 15:02:38,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2022-07-19 15:02:38,265 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b27db6a/e0df961c63e548edba975a7928976739/FLAG011699601 [2022-07-19 15:02:38,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b27db6a/e0df961c63e548edba975a7928976739 [2022-07-19 15:02:38,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 15:02:38,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 15:02:38,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 15:02:38,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 15:02:38,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 15:02:38,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279cebf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38, skipping insertion in model container [2022-07-19 15:02:38,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 15:02:38,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 15:02:38,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-07-19 15:02:38,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:02:38,892 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 15:02:38,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2022-07-19 15:02:38,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 15:02:38,942 INFO L208 MainTranslator]: Completed translation [2022-07-19 15:02:38,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38 WrapperNode [2022-07-19 15:02:38,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 15:02:38,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 15:02:38,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 15:02:38,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 15:02:38,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,983 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2022-07-19 15:02:38,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 15:02:38,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 15:02:38,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 15:02:38,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 15:02:38,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:38,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:39,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:39,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 15:02:39,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 15:02:39,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 15:02:39,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 15:02:39,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (1/1) ... [2022-07-19 15:02:39,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 15:02:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 15:02:39,046 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) [2022-07-19 15:02:39,055 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 [2022-07-19 15:02:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 15:02:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 15:02:39,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 15:02:39,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 15:02:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 15:02:39,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 15:02:39,122 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 15:02:39,123 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 15:02:39,261 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 15:02:39,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 15:02:39,280 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 15:02:39,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:02:39 BoogieIcfgContainer [2022-07-19 15:02:39,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 15:02:39,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 15:02:39,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 15:02:39,294 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 15:02:39,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 03:02:38" (1/3) ... [2022-07-19 15:02:39,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69eec2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:02:39, skipping insertion in model container [2022-07-19 15:02:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 03:02:38" (2/3) ... [2022-07-19 15:02:39,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69eec2d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 03:02:39, skipping insertion in model container [2022-07-19 15:02:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:02:39" (3/3) ... [2022-07-19 15:02:39,297 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-07-19 15:02:39,307 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 15:02:39,323 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 15:02:39,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 15:02:39,375 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27707944, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69417769 [2022-07-19 15:02:39,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 15:02:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 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) [2022-07-19 15:02:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 15:02:39,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:39,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:39,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:02:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 92647790, now seen corresponding path program 1 times [2022-07-19 15:02:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:39,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983072672] [2022-07-19 15:02:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:39,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983072672] [2022-07-19 15:02:39,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983072672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:39,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:39,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 15:02:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470659327] [2022-07-19 15:02:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:39,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 15:02:39,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:39,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 15:02:39,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 15:02:39,588 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 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 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-07-19 15:02:39,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:39,725 INFO L93 Difference]: Finished difference Result 107 states and 201 transitions. [2022-07-19 15:02:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 15:02:39,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-07-19 15:02:39,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:39,733 INFO L225 Difference]: With dead ends: 107 [2022-07-19 15:02:39,734 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 15:02:39,737 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 [2022-07-19 15:02:39,740 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:39,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 237 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 15:02:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2022-07-19 15:02:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 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) [2022-07-19 15:02:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2022-07-19 15:02:39,782 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 13 [2022-07-19 15:02:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:39,783 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2022-07-19 15:02:39,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2022-07-19 15:02:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2022-07-19 15:02:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 15:02:39,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:39,785 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 15:02:39,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 15:02:39,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:02:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816530, now seen corresponding path program 1 times [2022-07-19 15:02:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:39,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221890332] [2022-07-19 15:02:39,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:02:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 15:02:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:39,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221890332] [2022-07-19 15:02:39,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221890332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:39,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:39,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:02:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885296921] [2022-07-19 15:02:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:39,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:39,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:39,865 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-19 15:02:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:40,055 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-07-19 15:02:40,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2022-07-19 15:02:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:40,058 INFO L225 Difference]: With dead ends: 59 [2022-07-19 15:02:40,058 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 15:02:40,059 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 [2022-07-19 15:02:40,060 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:40,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 15:02:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-19 15:02:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 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) [2022-07-19 15:02:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2022-07-19 15:02:40,075 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2022-07-19 15:02:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:40,076 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2022-07-19 15:02:40,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-19 15:02:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2022-07-19 15:02:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 15:02:40,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:40,078 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] [2022-07-19 15:02:40,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 15:02:40,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:02:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 323306105, now seen corresponding path program 1 times [2022-07-19 15:02:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:40,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117326654] [2022-07-19 15:02:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:02:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 15:02:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 15:02:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 15:02:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 15:02:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 15:02:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:02:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117326654] [2022-07-19 15:02:40,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117326654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:40,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:40,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 15:02:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36088361] [2022-07-19 15:02:40,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:40,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 15:02:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:40,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 15:02:40,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 15:02:40,238 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-07-19 15:02:40,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:40,289 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2022-07-19 15:02:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 15:02:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 47 [2022-07-19 15:02:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:40,291 INFO L225 Difference]: With dead ends: 86 [2022-07-19 15:02:40,291 INFO L226 Difference]: Without dead ends: 57 [2022-07-19 15:02:40,292 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 [2022-07-19 15:02:40,296 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:40,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-19 15:02:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-19 15:02:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 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) [2022-07-19 15:02:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2022-07-19 15:02:40,323 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 47 [2022-07-19 15:02:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:40,323 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2022-07-19 15:02:40,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2022-07-19 15:02:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2022-07-19 15:02:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 15:02:40,325 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:40,325 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, 1] [2022-07-19 15:02:40,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 15:02:40,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:02:40,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:40,326 INFO L85 PathProgramCache]: Analyzing trace with hash -353292279, now seen corresponding path program 1 times [2022-07-19 15:02:40,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:40,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929038169] [2022-07-19 15:02:40,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:40,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:02:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 15:02:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 15:02:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 15:02:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 15:02:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 15:02:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 15:02:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:40,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929038169] [2022-07-19 15:02:40,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929038169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:40,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:40,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:02:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658217697] [2022-07-19 15:02:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:40,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:40,440 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-19 15:02:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:40,567 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-07-19 15:02:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 48 [2022-07-19 15:02:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:40,570 INFO L225 Difference]: With dead ends: 64 [2022-07-19 15:02:40,570 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 15:02:40,571 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 [2022-07-19 15:02:40,579 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:40,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 121 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 15:02:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-07-19 15:02:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 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) [2022-07-19 15:02:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-07-19 15:02:40,636 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 48 [2022-07-19 15:02:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:40,637 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-07-19 15:02:40,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-19 15:02:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-07-19 15:02:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-19 15:02:40,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:40,643 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, 1] [2022-07-19 15:02:40,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 15:02:40,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:02:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 89962133, now seen corresponding path program 1 times [2022-07-19 15:02:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:40,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967542402] [2022-07-19 15:02:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:02:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 15:02:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 15:02:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 15:02:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 15:02:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 15:02:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 15:02:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 15:02:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 15:02:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 15:02:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 15:02:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 15:02:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-07-19 15:02:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:40,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967542402] [2022-07-19 15:02:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967542402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:40,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:02:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918983465] [2022-07-19 15:02:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:40,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:40,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:40,815 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-19 15:02:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:40,880 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2022-07-19 15:02:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:40,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 83 [2022-07-19 15:02:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:40,886 INFO L225 Difference]: With dead ends: 70 [2022-07-19 15:02:40,886 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 15:02:40,887 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 [2022-07-19 15:02:40,887 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:40,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 259 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 15:02:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 15:02:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-19 15:02:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 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) [2022-07-19 15:02:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2022-07-19 15:02:40,911 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 83 [2022-07-19 15:02:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:40,912 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2022-07-19 15:02:40,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-19 15:02:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-07-19 15:02:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 15:02:40,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 15:02:40,914 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, 1] [2022-07-19 15:02:40,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 15:02:40,915 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 15:02:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 15:02:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1632378009, now seen corresponding path program 1 times [2022-07-19 15:02:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 15:02:40,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815532712] [2022-07-19 15:02:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 15:02:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 15:02:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 15:02:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 15:02:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 15:02:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 15:02:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 15:02:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 15:02:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 15:02:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 15:02:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 15:02:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 15:02:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 15:02:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 15:02:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 15:02:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 15:02:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-07-19 15:02:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 15:02:41,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815532712] [2022-07-19 15:02:41,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815532712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 15:02:41,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 15:02:41,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 15:02:41,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054881561] [2022-07-19 15:02:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 15:02:41,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 15:02:41,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 15:02:41,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 15:02:41,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 15:02:41,048 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-19 15:02:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 15:02:41,122 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-07-19 15:02:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 15:02:41,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 88 [2022-07-19 15:02:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 15:02:41,124 INFO L225 Difference]: With dead ends: 71 [2022-07-19 15:02:41,124 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 15:02:41,124 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 [2022-07-19 15:02:41,125 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 15:02:41,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 275 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 15:02:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 15:02:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 15:02:41,126 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) [2022-07-19 15:02:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 15:02:41,126 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-07-19 15:02:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 15:02:41,127 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 15:02:41,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) [2022-07-19 15:02:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 15:02:41,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 15:02:41,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 15:02:41,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 15:02:41,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-07-19 15:02:41,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 15:02:41,416 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,416 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| 1))) [2022-07-19 15:02:41,416 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| 1))) [2022-07-19 15:02:41,416 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-07-19 15:02:41,416 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-07-19 15:02:41,416 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |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|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,416 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |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|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,417 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,417 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (= |ULTIMATE.start_main_~c~0#1| 0) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,417 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 46 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| 1))) [2022-07-19 15:02:41,417 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| 1))) [2022-07-19 15:02:41,417 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |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|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,417 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,417 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,417 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-07-19 15:02:41,417 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-07-19 15:02:41,418 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |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|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,418 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-07-19 15:02:41,418 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2))) [2022-07-19 15:02:41,418 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 15:02:41,418 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-07-19 15:02:41,418 INFO L902 garLoopResultBuilder]: At program point L82(lines 24 83) the Hoare annotation is: true [2022-07-19 15:02:41,418 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|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) [2022-07-19 15:02:41,418 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1))) [2022-07-19 15:02:41,418 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-07-19 15:02:41,418 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 15:02:41,418 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-19 15:02:41,419 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| 1))) [2022-07-19 15:02:41,419 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| 1))) [2022-07-19 15:02:41,419 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse3 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse4 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~cp~0#1| |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|)) (.cse3 (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|))) (.cse4 (< 0 (+ |ULTIMATE.start_main_~scheme~0#1| 1)))) (or (and .cse0 (= |ULTIMATE.start_main_~c~0#1| 0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 .cse3 .cse4))) [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-07-19 15:02:41,419 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-19 15:02:41,420 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-19 15:02:41,420 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-19 15:02:41,422 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-19 15:02:41,424 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 15:02:41,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 03:02:41 BoogieIcfgContainer [2022-07-19 15:02:41,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 15:02:41,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 15:02:41,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 15:02:41,438 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 15:02:41,438 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 03:02:39" (3/4) ... [2022-07-19 15:02:41,441 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 15:02:41,446 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 15:02:41,449 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-19 15:02:41,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-19 15:02:41,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 15:02:41,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 15:02:41,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 15:02:41,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 15:02:41,493 INFO L158 Benchmark]: Toolchain (without parser) took 2807.23ms. Allocated memory was 113.2MB in the beginning and 174.1MB in the end (delta: 60.8MB). Free memory was 85.7MB in the beginning and 82.2MB in the end (delta: 3.5MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-07-19 15:02:41,494 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory was 69.7MB in the beginning and 69.7MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:02:41,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.03ms. Allocated memory is still 113.2MB. Free memory was 85.5MB in the beginning and 86.8MB in the end (delta: -1.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-19 15:02:41,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 85.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:02:41,495 INFO L158 Benchmark]: Boogie Preprocessor took 17.29ms. Allocated memory is still 113.2MB. Free memory was 85.1MB in the beginning and 84.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 15:02:41,495 INFO L158 Benchmark]: RCFGBuilder took 281.16ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 72.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 15:02:41,495 INFO L158 Benchmark]: TraceAbstraction took 2152.93ms. Allocated memory was 113.2MB in the beginning and 174.1MB in the end (delta: 60.8MB). Free memory was 71.6MB in the beginning and 85.4MB in the end (delta: -13.8MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2022-07-19 15:02:41,496 INFO L158 Benchmark]: Witness Printer took 55.07ms. Allocated memory is still 174.1MB. Free memory was 85.4MB in the beginning and 82.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 15:02:41,499 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 113.2MB. Free memory was 69.7MB in the beginning and 69.7MB in the end (delta: 49.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.03ms. Allocated memory is still 113.2MB. Free memory was 85.5MB in the beginning and 86.8MB in the end (delta: -1.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 85.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.29ms. Allocated memory is still 113.2MB. Free memory was 85.1MB in the beginning and 84.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 281.16ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 72.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2152.93ms. Allocated memory was 113.2MB in the beginning and 174.1MB in the end (delta: 60.8MB). Free memory was 71.6MB in the beginning and 85.4MB in the end (delta: -13.8MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 55.07ms. Allocated memory is still 174.1MB. Free memory was 85.4MB in the beginning and 82.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 1135 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 763 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 460 IncrementalHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 372 mSDtfsCounter, 460 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=65occurred 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, 23 LocationsWithAnnotation, 73 PreInvPairs, 104 NumberOfFragments, 456 HoareAnnotationTreeSize, 73 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 283 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 451 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: 46]: Loop Invariant Derived loop invariant: (cp + 1 <= urilen && 1 <= cp) && 0 < scheme + 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((cp < urilen && c == 0) && 1 <= cp) && 0 < scheme + 1) || (((cp < urilen && 1 <= c) && 1 <= cp) && 0 < scheme + 1) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 15:02:41,546 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