/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:45:54,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:45:54,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:45:54,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:45:54,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:45:54,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:45:54,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:45:54,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:45:54,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:45:54,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:45:54,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:45:54,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:45:54,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:45:54,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:45:54,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:45:54,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:45:54,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:45:54,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:45:54,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:45:54,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:45:54,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:45:54,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:45:54,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:45:54,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:45:54,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:45:54,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:45:54,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:45:54,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:45:54,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:45:54,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:45:54,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:45:54,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:45:54,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:45:54,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:45:54,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:45:54,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:45:54,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:45:54,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:45:54,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:45:54,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:45:54,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:45:54,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:45:54,147 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:45:54,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:45:54,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:45:54,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:45:54,149 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:45:54,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:45:54,150 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:45:54,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:45:54,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:45:54,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:45:54,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:45:54,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:45:54,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:45:54,152 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:45:54,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:45:54,152 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:45:54,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:45:54,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:45:54,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:45:54,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:45:54,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:45:54,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:54,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:45:54,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:45:54,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:45:54,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:45:54,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:45:54,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:45:54,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:45:54,156 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 [2020-11-06 22:45:54,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:45:54,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:45:54,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:45:54,601 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:45:54,601 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:45:54,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-11-06 22:45:54,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b1f0cc5/3e18e57c18554487a9db4c85f2bb2e02/FLAGaaa394a9e [2020-11-06 22:45:55,325 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:45:55,326 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-11-06 22:45:55,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b1f0cc5/3e18e57c18554487a9db4c85f2bb2e02/FLAGaaa394a9e [2020-11-06 22:45:55,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6b1f0cc5/3e18e57c18554487a9db4c85f2bb2e02 [2020-11-06 22:45:55,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:45:55,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:45:55,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:55,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:45:55,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:45:55,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:55" (1/1) ... [2020-11-06 22:45:55,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685e4fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55, skipping insertion in model container [2020-11-06 22:45:55,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:55" (1/1) ... [2020-11-06 22:45:55,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:45:55,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:45:56,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:56,060 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:45:56,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:56,128 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:45:56,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56 WrapperNode [2020-11-06 22:45:56,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:56,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:45:56,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:45:56,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:45:56,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... [2020-11-06 22:45:56,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:45:56,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:45:56,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:45:56,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:45:56,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:56,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:45:56,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:45:56,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:45:56,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:45:56,271 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:45:56,271 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:45:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:45:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:45:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:45:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:45:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:45:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:45:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:45:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:45:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:45:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:45:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:45:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:45:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:45:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:45:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:45:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:45:56,773 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:45:56,774 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-06 22:45:56,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:56 BoogieIcfgContainer [2020-11-06 22:45:56,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:45:56,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:45:56,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:45:56,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:45:56,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:55" (1/3) ... [2020-11-06 22:45:56,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336c4bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:56, skipping insertion in model container [2020-11-06 22:45:56,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:56" (2/3) ... [2020-11-06 22:45:56,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336c4bb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:45:56, skipping insertion in model container [2020-11-06 22:45:56,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:45:56" (3/3) ... [2020-11-06 22:45:56,790 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-11-06 22:45:56,806 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:45:56,810 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:45:56,823 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:45:56,864 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:45:56,864 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:45:56,865 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:45:56,865 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:45:56,865 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:45:56,865 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:45:56,865 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:45:56,865 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:45:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2020-11-06 22:45:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-06 22:45:56,897 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:56,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:56,898 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:56,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1050654410, now seen corresponding path program 1 times [2020-11-06 22:45:56,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:56,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3464024] [2020-11-06 22:45:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:57,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3464024] [2020-11-06 22:45:57,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:57,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:57,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269182669] [2020-11-06 22:45:57,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:57,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:57,360 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2020-11-06 22:45:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:58,221 INFO L93 Difference]: Finished difference Result 119 states and 217 transitions. [2020-11-06 22:45:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:45:58,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-06 22:45:58,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:58,234 INFO L225 Difference]: With dead ends: 119 [2020-11-06 22:45:58,235 INFO L226 Difference]: Without dead ends: 66 [2020-11-06 22:45:58,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:45:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-06 22:45:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2020-11-06 22:45:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-06 22:45:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2020-11-06 22:45:58,307 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 19 [2020-11-06 22:45:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,308 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2020-11-06 22:45:58,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:45:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2020-11-06 22:45:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:45:58,310 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,310 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:58,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:45:58,311 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1998447475, now seen corresponding path program 1 times [2020-11-06 22:45:58,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630374919] [2020-11-06 22:45:58,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:45:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:45:58,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630374919] [2020-11-06 22:45:58,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:58,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:45:58,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278291690] [2020-11-06 22:45:58,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:45:58,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:45:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:58,440 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 7 states. [2020-11-06 22:45:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:58,867 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2020-11-06 22:45:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:45:58,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-06 22:45:58,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:58,871 INFO L225 Difference]: With dead ends: 67 [2020-11-06 22:45:58,871 INFO L226 Difference]: Without dead ends: 63 [2020-11-06 22:45:58,873 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:45:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-06 22:45:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-06 22:45:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-06 22:45:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2020-11-06 22:45:58,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 24 [2020-11-06 22:45:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,891 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2020-11-06 22:45:58,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:45:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2020-11-06 22:45:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-06 22:45:58,896 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,897 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2020-11-06 22:45:58,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:45:58,897 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,899 INFO L82 PathProgramCache]: Analyzing trace with hash 578608289, now seen corresponding path program 1 times [2020-11-06 22:45:58,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299892831] [2020-11-06 22:45:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:45:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:45:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:45:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:45:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-11-06 22:45:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:45:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-06 22:45:59,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299892831] [2020-11-06 22:45:59,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:59,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:45:59,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989192747] [2020-11-06 22:45:59,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:45:59,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:59,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:45:59,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:45:59,132 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand 4 states. [2020-11-06 22:45:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:59,386 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2020-11-06 22:45:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:45:59,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-06 22:45:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:59,389 INFO L225 Difference]: With dead ends: 94 [2020-11-06 22:45:59,389 INFO L226 Difference]: Without dead ends: 63 [2020-11-06 22:45:59,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-06 22:45:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-06 22:45:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-06 22:45:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2020-11-06 22:45:59,405 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 53 [2020-11-06 22:45:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:59,406 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2020-11-06 22:45:59,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:45:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2020-11-06 22:45:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-06 22:45:59,408 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:59,408 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:59,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:45:59,409 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash -489118293, now seen corresponding path program 1 times [2020-11-06 22:45:59,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:59,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128852269] [2020-11-06 22:45:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:45:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:45:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:45:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:45:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:45:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:45:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-06 22:45:59,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128852269] [2020-11-06 22:45:59,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:59,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:45:59,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58013449] [2020-11-06 22:45:59,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:45:59,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:59,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:45:59,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:59,560 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 7 states. [2020-11-06 22:45:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:59,973 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-11-06 22:45:59,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:45:59,974 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-11-06 22:45:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:59,976 INFO L225 Difference]: With dead ends: 72 [2020-11-06 22:45:59,976 INFO L226 Difference]: Without dead ends: 68 [2020-11-06 22:45:59,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:45:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-06 22:45:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2020-11-06 22:45:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-06 22:45:59,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2020-11-06 22:45:59,991 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 54 [2020-11-06 22:45:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:59,992 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2020-11-06 22:45:59,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:45:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2020-11-06 22:45:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-06 22:45:59,995 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:59,995 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2020-11-06 22:45:59,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:45:59,996 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1672325661, now seen corresponding path program 1 times [2020-11-06 22:45:59,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:59,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235341225] [2020-11-06 22:45:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:46:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:46:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:46:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:46:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-06 22:46:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:46:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-06 22:46:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:46:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-06 22:46:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-11-06 22:46:00,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235341225] [2020-11-06 22:46:00,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:00,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:00,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427704608] [2020-11-06 22:46:00,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:00,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:00,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:00,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:00,148 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 7 states. [2020-11-06 22:46:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:00,619 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2020-11-06 22:46:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:00,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2020-11-06 22:46:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:00,623 INFO L225 Difference]: With dead ends: 78 [2020-11-06 22:46:00,623 INFO L226 Difference]: Without dead ends: 74 [2020-11-06 22:46:00,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:46:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-06 22:46:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2020-11-06 22:46:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-06 22:46:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2020-11-06 22:46:00,640 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 89 [2020-11-06 22:46:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:00,641 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2020-11-06 22:46:00,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2020-11-06 22:46:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-06 22:46:00,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:00,657 INFO L422 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:00,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:46:00,657 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1856886932, now seen corresponding path program 1 times [2020-11-06 22:46:00,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:00,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291078270] [2020-11-06 22:46:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-06 22:46:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-11-06 22:46:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2020-11-06 22:46:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:46:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:46:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:46:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2020-11-06 22:46:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2020-11-06 22:46:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:46:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-06 22:46:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:46:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-06 22:46:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2020-11-06 22:46:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,805 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-11-06 22:46:00,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291078270] [2020-11-06 22:46:00,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:00,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:00,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409947981] [2020-11-06 22:46:00,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:00,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:00,808 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 7 states. [2020-11-06 22:46:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:01,192 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2020-11-06 22:46:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:01,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2020-11-06 22:46:01,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:01,195 INFO L225 Difference]: With dead ends: 77 [2020-11-06 22:46:01,195 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:46:01,197 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:46:01,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:46:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:46:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:46:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:46:01,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2020-11-06 22:46:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:01,199 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:46:01,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:46:01,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:46:01,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:46:01,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:46:01,572 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2020-11-06 22:46:01,784 WARN L194 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2020-11-06 22:46:02,326 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2020-11-06 22:46:02,327 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-06 22:46:02,327 INFO L266 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-11-06 22:46:02,327 INFO L266 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-06 22:46:02,327 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-06 22:46:02,327 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:02,328 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-06 22:46:02,328 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:02,328 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:02,328 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:46:02,328 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:46:02,328 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:02,328 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-06 22:46:02,329 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-06 22:46:02,329 INFO L266 CegarLoopResult]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2020-11-06 22:46:02,329 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-06 22:46:02,331 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2020-11-06 22:46:02,331 INFO L266 CegarLoopResult]: For program point L44(lines 44 80) no Hoare annotation was computed. [2020-11-06 22:46:02,331 INFO L266 CegarLoopResult]: For program point L69(lines 69 75) no Hoare annotation was computed. [2020-11-06 22:46:02,332 INFO L266 CegarLoopResult]: For program point L36(lines 25 83) no Hoare annotation was computed. [2020-11-06 22:46:02,332 INFO L266 CegarLoopResult]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2020-11-06 22:46:02,332 INFO L266 CegarLoopResult]: For program point L61(lines 61 79) no Hoare annotation was computed. [2020-11-06 22:46:02,332 INFO L262 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,332 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,332 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,333 INFO L266 CegarLoopResult]: For program point L37(lines 25 83) no Hoare annotation was computed. [2020-11-06 22:46:02,333 INFO L266 CegarLoopResult]: For program point L54(lines 44 80) no Hoare annotation was computed. [2020-11-06 22:46:02,333 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2020-11-06 22:46:02,336 INFO L262 CegarLoopResult]: At program point L71(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,336 INFO L262 CegarLoopResult]: At program point L71-1(line 71) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,337 INFO L262 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,337 INFO L262 CegarLoopResult]: At program point L63-1(line 63) the Hoare annotation is: (and (= main_~c~0 0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,344 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2020-11-06 22:46:02,344 INFO L262 CegarLoopResult]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,344 INFO L262 CegarLoopResult]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,344 INFO L262 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,345 INFO L262 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,345 INFO L262 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,345 INFO L269 CegarLoopResult]: At program point L81(lines 25 83) the Hoare annotation is: true [2020-11-06 22:46:02,345 INFO L266 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2020-11-06 22:46:02,345 INFO L262 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (and (<= 1 main_~c~0) (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,345 INFO L266 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-11-06 22:46:02,346 INFO L262 CegarLoopResult]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2) (and (= main_~c~0 0) .cse0 .cse1 .cse2))) [2020-11-06 22:46:02,346 INFO L266 CegarLoopResult]: For program point L57(lines 44 80) no Hoare annotation was computed. [2020-11-06 22:46:02,347 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,348 INFO L262 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,348 INFO L266 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-11-06 22:46:02,348 INFO L266 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-11-06 22:46:02,348 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,348 INFO L262 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-11-06 22:46:02,349 INFO L262 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-11-06 22:46:02,349 INFO L266 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2020-11-06 22:46:02,349 INFO L262 CegarLoopResult]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse3 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse4 (< main_~cp~0 main_~urilen~0))) (or (and (<= 1 main_~c~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4))) [2020-11-06 22:46:02,352 INFO L266 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-11-06 22:46:02,352 INFO L266 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-11-06 22:46:02,352 INFO L266 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-11-06 22:46:02,352 INFO L266 CegarLoopResult]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2020-11-06 22:46:02,352 INFO L266 CegarLoopResult]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2020-11-06 22:46:02,352 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-06 22:46:02,352 INFO L266 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2020-11-06 22:46:02,352 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-06 22:46:02,353 INFO L266 CegarLoopResult]: For program point L18(lines 18 20) no Hoare annotation was computed. [2020-11-06 22:46:02,353 INFO L266 CegarLoopResult]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-11-06 22:46:02,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:02 BoogieIcfgContainer [2020-11-06 22:46:02,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:46:02,382 INFO L168 Benchmark]: Toolchain (without parser) took 6683.66 ms. Allocated memory was 151.0 MB in the beginning and 229.6 MB in the end (delta: 78.6 MB). Free memory was 126.4 MB in the beginning and 177.8 MB in the end (delta: -51.4 MB). Peak memory consumption was 126.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:02,383 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:46:02,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.68 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 115.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:02,393 INFO L168 Benchmark]: Boogie Preprocessor took 42.78 ms. Allocated memory is still 151.0 MB. Free memory was 115.7 MB in the beginning and 114.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:02,395 INFO L168 Benchmark]: RCFGBuilder took 603.53 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 130.2 MB in the end (delta: -16.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:02,396 INFO L168 Benchmark]: TraceAbstraction took 5595.39 ms. Allocated memory was 151.0 MB in the beginning and 229.6 MB in the end (delta: 78.6 MB). Free memory was 129.7 MB in the beginning and 177.8 MB in the end (delta: -48.1 MB). Peak memory consumption was 128.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:02,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 424.68 ms. Allocated memory is still 151.0 MB. Free memory was 125.8 MB in the beginning and 115.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.78 ms. Allocated memory is still 151.0 MB. Free memory was 115.7 MB in the beginning and 114.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 603.53 ms. Allocated memory is still 151.0 MB. Free memory was 113.8 MB in the beginning and 130.2 MB in the end (delta: -16.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5595.39 ms. Allocated memory was 151.0 MB in the beginning and 229.6 MB in the end (delta: 78.6 MB). Free memory was 129.7 MB in the beginning and 177.8 MB in the end (delta: -48.1 MB). Peak memory consumption was 128.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && 1 <= cp) && cp < urilen - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((1 <= c && 0 < scheme + 1) && 1 <= cp) && cp < urilen) || (((c == 0 && 0 < scheme + 1) && 1 <= cp) && cp < urilen) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 14, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 304 SDtfs, 280 SDslu, 371 SDs, 0 SdLazy, 1084 SolverSat, 324 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=5, 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, 28 LocationsWithAnnotation, 133 PreInvPairs, 162 NumberOfFragments, 473 HoareAnnotationTreeSize, 133 FomulaSimplifications, 1072 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 28 FomulaSimplificationsInter, 747 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 39698 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...