/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.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:45:52,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:45:52,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:45:53,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:45:53,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:45:53,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:45:53,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:45:53,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:45:53,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:45:53,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:45:53,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:45:53,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:45:53,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:45:53,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:45:53,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:45:53,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:45:53,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:45:53,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:45:53,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:45:53,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:45:53,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:45:53,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:45:53,084 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:45:53,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:45:53,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:45:53,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:45:53,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:45:53,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:45:53,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:45:53,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:45:53,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:45:53,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:45:53,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:45:53,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:45:53,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:45:53,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:45:53,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:45:53,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:45:53,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:45:53,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:45:53,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:45:53,125 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:53,181 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:45:53,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:45:53,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:45:53,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:45:53,187 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:45:53,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:45:53,188 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:45:53,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:45:53,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:45:53,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:45:53,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:45:53,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:45:53,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:45:53,191 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:45:53,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:45:53,191 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:45:53,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:45:53,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:45:53,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:45:53,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:45:53,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:45:53,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:45:53,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:45:53,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:45:53,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:45:53,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:45:53,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:45:53,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:45:53,194 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:45:53,194 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:53,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:45:53,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:45:53,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:45:53,655 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:45:53,655 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:45:53,656 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.v+cfa-reducer.c [2020-11-06 22:45:53,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a969779ba/a7f0cc78a9b444919e27c82a129c1615/FLAG01ebafeac [2020-11-06 22:45:54,411 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:45:54,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-11-06 22:45:54,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a969779ba/a7f0cc78a9b444919e27c82a129c1615/FLAG01ebafeac [2020-11-06 22:45:54,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a969779ba/a7f0cc78a9b444919e27c82a129c1615 [2020-11-06 22:45:54,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:45:54,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:45:54,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:54,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:45:54,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:45:54,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:54" (1/1) ... [2020-11-06 22:45:54,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88d1a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:54, skipping insertion in model container [2020-11-06 22:45:54,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:45:54" (1/1) ... [2020-11-06 22:45:54,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:45:54,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:45:55,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:55,046 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:45:55,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:45:55,113 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:45:55,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55 WrapperNode [2020-11-06 22:45:55,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:45:55,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:45:55,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:45:55,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:45:55,130 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:55" (1/1) ... [2020-11-06 22:45:55,130 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:55" (1/1) ... [2020-11-06 22:45:55,139 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:55" (1/1) ... [2020-11-06 22:45:55,140 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:55" (1/1) ... [2020-11-06 22:45:55,149 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:55" (1/1) ... [2020-11-06 22:45:55,154 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:55" (1/1) ... [2020-11-06 22:45:55,157 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:55" (1/1) ... [2020-11-06 22:45:55,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:45:55,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:45:55,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:45:55,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:45:55,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (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:55,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:45:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:45:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:45:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-06 22:45:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:45:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:45:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:45:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:45:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:45:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-06 22:45:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:45:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:45:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:45:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:45:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:45:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:45:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:45:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:45:55,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:45:56,076 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:45:56,076 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:45:56,079 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,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:45:56,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:45:56,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:45:56,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:45:56,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:45:54" (1/3) ... [2020-11-06 22:45:56,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db2458d 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,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:45:55" (2/3) ... [2020-11-06 22:45:56,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db2458d 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,090 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,092 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-11-06 22:45:56,109 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:45:56,113 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:45:56,124 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:45:56,153 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:45:56,153 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:45:56,153 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:45:56,153 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:45:56,153 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:45:56,154 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:45:56,154 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:45:56,154 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:45:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2020-11-06 22:45:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-06 22:45:56,182 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:56,183 INFO L422 BasicCegarLoop]: trace histogram [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:56,183 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:56,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash 759277978, now seen corresponding path program 1 times [2020-11-06 22:45:56,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:56,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922117484] [2020-11-06 22:45:56,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:56,538 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:56,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922117484] [2020-11-06 22:45:56,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:56,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:45:56,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175564027] [2020-11-06 22:45:56,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:45:56,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:45:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:45:56,576 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states. [2020-11-06 22:45:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:56,827 INFO L93 Difference]: Finished difference Result 99 states and 152 transitions. [2020-11-06 22:45:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-06 22:45:56,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-06 22:45:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:56,840 INFO L225 Difference]: With dead ends: 99 [2020-11-06 22:45:56,841 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:45:56,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:56,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:45:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-06 22:45:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-06 22:45:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2020-11-06 22:45:56,917 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 20 [2020-11-06 22:45:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:56,918 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2020-11-06 22:45:56,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:45:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-11-06 22:45:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-06 22:45:56,919 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:56,920 INFO L422 BasicCegarLoop]: trace histogram [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:56,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:45:56,921 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2062719644, now seen corresponding path program 1 times [2020-11-06 22:45:56,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:56,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466865889] [2020-11-06 22:45:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,222 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,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466865889] [2020-11-06 22:45:57,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:57,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:45:57,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392215335] [2020-11-06 22:45:57,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:45:57,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:45:57,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:45:57,227 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand 7 states. [2020-11-06 22:45:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:57,596 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2020-11-06 22:45:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:45:57,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-06 22:45:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:57,599 INFO L225 Difference]: With dead ends: 67 [2020-11-06 22:45:57,599 INFO L226 Difference]: Without dead ends: 64 [2020-11-06 22:45:57,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:45:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-06 22:45:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-06 22:45:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-06 22:45:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2020-11-06 22:45:57,617 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 21 [2020-11-06 22:45:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:57,617 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2020-11-06 22:45:57,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:45:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2020-11-06 22:45:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:45:57,618 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:57,618 INFO L422 BasicCegarLoop]: trace histogram [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:57,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:45:57,619 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:57,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2003234496, now seen corresponding path program 1 times [2020-11-06 22:45:57,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:57,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776486329] [2020-11-06 22:45:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:57,758 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,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776486329] [2020-11-06 22:45:57,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:57,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:45:57,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616875840] [2020-11-06 22:45:57,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:45:57,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:57,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:45:57,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:45:57,762 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand 5 states. [2020-11-06 22:45:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:58,089 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-11-06 22:45:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:45:58,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-11-06 22:45:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:58,091 INFO L225 Difference]: With dead ends: 83 [2020-11-06 22:45:58,091 INFO L226 Difference]: Without dead ends: 80 [2020-11-06 22:45:58,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:45:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-06 22:45:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2020-11-06 22:45:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-06 22:45:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2020-11-06 22:45:58,107 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 23 [2020-11-06 22:45:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,108 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2020-11-06 22:45:58,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:45:58,108 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2020-11-06 22:45:58,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:45:58,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,109 INFO L422 BasicCegarLoop]: trace histogram [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,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:45:58,110 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1970777731, now seen corresponding path program 1 times [2020-11-06 22:45:58,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665350148] [2020-11-06 22:45:58,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,298 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:58,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665350148] [2020-11-06 22:45:58,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:58,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:58,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199573324] [2020-11-06 22:45:58,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:58,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:58,301 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 6 states. [2020-11-06 22:45:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:58,617 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-11-06 22:45:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:45:58,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-11-06 22:45:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:58,618 INFO L225 Difference]: With dead ends: 65 [2020-11-06 22:45:58,619 INFO L226 Difference]: Without dead ends: 62 [2020-11-06 22:45:58,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:45:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-06 22:45:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-06 22:45:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-06 22:45:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2020-11-06 22:45:58,633 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 24 [2020-11-06 22:45:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:58,634 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2020-11-06 22:45:58,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:45:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2020-11-06 22:45:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:45:58,635 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:58,635 INFO L422 BasicCegarLoop]: trace histogram [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,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:45:58,636 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash 718858190, now seen corresponding path program 1 times [2020-11-06 22:45:58,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:58,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966007519] [2020-11-06 22:45:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:58,746 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:58,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966007519] [2020-11-06 22:45:58,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:58,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:58,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045283896] [2020-11-06 22:45:58,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:58,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:58,749 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 6 states. [2020-11-06 22:45:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:45:59,514 INFO L93 Difference]: Finished difference Result 113 states and 149 transitions. [2020-11-06 22:45:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:45:59,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-06 22:45:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:45:59,516 INFO L225 Difference]: With dead ends: 113 [2020-11-06 22:45:59,517 INFO L226 Difference]: Without dead ends: 110 [2020-11-06 22:45:59,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:45:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-06 22:45:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 65. [2020-11-06 22:45:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-06 22:45:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2020-11-06 22:45:59,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 27 [2020-11-06 22:45:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:45:59,538 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2020-11-06 22:45:59,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:45:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2020-11-06 22:45:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:45:59,539 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:45:59,539 INFO L422 BasicCegarLoop]: trace histogram [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,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:45:59,539 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:45:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:45:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash 834608935, now seen corresponding path program 1 times [2020-11-06 22:45:59,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:45:59,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385232000] [2020-11-06 22:45:59,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:45:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:45:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:45:59,640 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:59,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385232000] [2020-11-06 22:45:59,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:45:59,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:45:59,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735504600] [2020-11-06 22:45:59,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:45:59,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:45:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:45:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:45:59,643 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 6 states. [2020-11-06 22:46:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:00,326 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2020-11-06 22:46:00,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:00,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-06 22:46:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:00,331 INFO L225 Difference]: With dead ends: 90 [2020-11-06 22:46:00,331 INFO L226 Difference]: Without dead ends: 87 [2020-11-06 22:46:00,332 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-06 22:46:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2020-11-06 22:46:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-06 22:46:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2020-11-06 22:46:00,349 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 27 [2020-11-06 22:46:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:00,349 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2020-11-06 22:46:00,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2020-11-06 22:46:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:46:00,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:00,350 INFO L422 BasicCegarLoop]: trace histogram [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,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:46:00,351 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:00,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 809816762, now seen corresponding path program 1 times [2020-11-06 22:46:00,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:00,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253709581] [2020-11-06 22:46:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:00,474 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:46:00,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253709581] [2020-11-06 22:46:00,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:00,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:00,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881276715] [2020-11-06 22:46:00,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:00,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:00,477 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand 6 states. [2020-11-06 22:46:00,817 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-11-06 22:46:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:01,030 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2020-11-06 22:46:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:01,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-06 22:46:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:01,032 INFO L225 Difference]: With dead ends: 100 [2020-11-06 22:46:01,032 INFO L226 Difference]: Without dead ends: 97 [2020-11-06 22:46:01,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-06 22:46:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2020-11-06 22:46:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-06 22:46:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-11-06 22:46:01,069 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 28 [2020-11-06 22:46:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:01,069 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-11-06 22:46:01,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-11-06 22:46:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:46:01,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:01,076 INFO L422 BasicCegarLoop]: trace histogram [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:01,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:46:01,077 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:01,078 INFO L82 PathProgramCache]: Analyzing trace with hash 103039171, now seen corresponding path program 1 times [2020-11-06 22:46:01,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:01,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9526504] [2020-11-06 22:46:01,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,232 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:46:01,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9526504] [2020-11-06 22:46:01,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:01,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:01,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526062948] [2020-11-06 22:46:01,234 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:01,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:01,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:01,240 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-11-06 22:46:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:01,609 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-11-06 22:46:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:01,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-11-06 22:46:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:01,612 INFO L225 Difference]: With dead ends: 68 [2020-11-06 22:46:01,613 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:46:01,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:46:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-06 22:46:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-06 22:46:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2020-11-06 22:46:01,639 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 28 [2020-11-06 22:46:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:01,639 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2020-11-06 22:46:01,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2020-11-06 22:46:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:46:01,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:01,644 INFO L422 BasicCegarLoop]: trace histogram [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:01,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:46:01,644 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:01,647 INFO L82 PathProgramCache]: Analyzing trace with hash 235435143, now seen corresponding path program 1 times [2020-11-06 22:46:01,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:01,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050993470] [2020-11-06 22:46:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:01,720 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:46:01,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050993470] [2020-11-06 22:46:01,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:01,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:46:01,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283382180] [2020-11-06 22:46:01,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:46:01,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:01,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:46:01,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:46:01,723 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand 4 states. [2020-11-06 22:46:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:01,929 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2020-11-06 22:46:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:46:01,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:46:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:01,931 INFO L225 Difference]: With dead ends: 97 [2020-11-06 22:46:01,931 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:46:01,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:46:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:46:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-06 22:46:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-06 22:46:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2020-11-06 22:46:01,948 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 30 [2020-11-06 22:46:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:01,949 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2020-11-06 22:46:01,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:46:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-11-06 22:46:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:46:01,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:01,954 INFO L422 BasicCegarLoop]: trace histogram [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:01,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:46:01,955 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash -456282646, now seen corresponding path program 1 times [2020-11-06 22:46:01,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:01,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937896970] [2020-11-06 22:46:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:02,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:02,074 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:46:02,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937896970] [2020-11-06 22:46:02,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:02,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:02,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210030813] [2020-11-06 22:46:02,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:02,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:02,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:02,076 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand 6 states. [2020-11-06 22:46:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:02,425 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2020-11-06 22:46:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:02,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-11-06 22:46:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:02,426 INFO L225 Difference]: With dead ends: 68 [2020-11-06 22:46:02,426 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:46:02,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:46:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:46:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-11-06 22:46:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-06 22:46:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2020-11-06 22:46:02,438 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 31 [2020-11-06 22:46:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:02,438 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2020-11-06 22:46:02,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2020-11-06 22:46:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:46:02,439 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:02,439 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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:02,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:46:02,440 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:02,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash 349302613, now seen corresponding path program 1 times [2020-11-06 22:46:02,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:02,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064561931] [2020-11-06 22:46:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:02,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:46:02,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064561931] [2020-11-06 22:46:02,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056649875] [2020-11-06 22:46:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:02,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:46:02,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:02,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:02,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:46:02,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:02,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-11-06 22:46:02,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682653916] [2020-11-06 22:46:02,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:02,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:02,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:02,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:02,812 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand 7 states. [2020-11-06 22:46:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:03,273 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2020-11-06 22:46:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:03,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-11-06 22:46:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:03,275 INFO L225 Difference]: With dead ends: 95 [2020-11-06 22:46:03,275 INFO L226 Difference]: Without dead ends: 92 [2020-11-06 22:46:03,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-06 22:46:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2020-11-06 22:46:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-06 22:46:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2020-11-06 22:46:03,289 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 31 [2020-11-06 22:46:03,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:03,289 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2020-11-06 22:46:03,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2020-11-06 22:46:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:46:03,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:03,290 INFO L422 BasicCegarLoop]: trace histogram [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:03,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-06 22:46:03,505 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1259880598, now seen corresponding path program 1 times [2020-11-06 22:46:03,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:03,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126542598] [2020-11-06 22:46:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:03,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:03,599 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:46:03,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126542598] [2020-11-06 22:46:03,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:03,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:03,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334391647] [2020-11-06 22:46:03,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:03,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:03,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:03,602 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 6 states. [2020-11-06 22:46:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:03,862 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2020-11-06 22:46:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:03,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-11-06 22:46:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:03,866 INFO L225 Difference]: With dead ends: 64 [2020-11-06 22:46:03,866 INFO L226 Difference]: Without dead ends: 61 [2020-11-06 22:46:03,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-06 22:46:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-11-06 22:46:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-06 22:46:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-11-06 22:46:03,885 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 32 [2020-11-06 22:46:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:03,886 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-11-06 22:46:03,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-11-06 22:46:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:46:03,888 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:03,888 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:46:03,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:46:03,889 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2131493373, now seen corresponding path program 1 times [2020-11-06 22:46:03,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:03,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050737557] [2020-11-06 22:46:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:04,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:46:04,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050737557] [2020-11-06 22:46:04,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563167245] [2020-11-06 22:46:04,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:04,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:46:04,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:04,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:04,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:46:04,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:04,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-11-06 22:46:04,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53277077] [2020-11-06 22:46:04,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:04,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:04,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:04,159 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 7 states. [2020-11-06 22:46:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:04,481 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2020-11-06 22:46:04,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:04,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-11-06 22:46:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:04,482 INFO L225 Difference]: With dead ends: 64 [2020-11-06 22:46:04,483 INFO L226 Difference]: Without dead ends: 61 [2020-11-06 22:46:04,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-11-06 22:46:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2020-11-06 22:46:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-06 22:46:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2020-11-06 22:46:04,493 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 32 [2020-11-06 22:46:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:04,494 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2020-11-06 22:46:04,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2020-11-06 22:46:04,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-06 22:46:04,496 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:04,496 INFO L422 BasicCegarLoop]: trace histogram [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:04,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-11-06 22:46:04,709 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 598948849, now seen corresponding path program 1 times [2020-11-06 22:46:04,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:04,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684259017] [2020-11-06 22:46:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:04,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:04,841 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:46:04,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684259017] [2020-11-06 22:46:04,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:04,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:04,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991537843] [2020-11-06 22:46:04,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:04,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:04,846 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2020-11-06 22:46:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:05,164 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2020-11-06 22:46:05,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:05,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-06 22:46:05,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:05,165 INFO L225 Difference]: With dead ends: 59 [2020-11-06 22:46:05,165 INFO L226 Difference]: Without dead ends: 56 [2020-11-06 22:46:05,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:46:05,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-06 22:46:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2020-11-06 22:46:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-06 22:46:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2020-11-06 22:46:05,177 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 35 [2020-11-06 22:46:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:05,177 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2020-11-06 22:46:05,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2020-11-06 22:46:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-06 22:46:05,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:05,182 INFO L422 BasicCegarLoop]: trace histogram [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:05,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:46:05,182 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1387540175, now seen corresponding path program 1 times [2020-11-06 22:46:05,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:05,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995088439] [2020-11-06 22:46:05,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:05,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:05,316 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:46:05,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995088439] [2020-11-06 22:46:05,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:05,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:46:05,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355064014] [2020-11-06 22:46:05,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:05,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:05,319 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 7 states. [2020-11-06 22:46:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:05,690 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-11-06 22:46:05,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:05,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-06 22:46:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:05,691 INFO L225 Difference]: With dead ends: 68 [2020-11-06 22:46:05,692 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:46:05,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:46:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2020-11-06 22:46:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-06 22:46:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2020-11-06 22:46:05,699 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 36 [2020-11-06 22:46:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:05,699 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2020-11-06 22:46:05,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:05,699 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2020-11-06 22:46:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-06 22:46:05,700 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:05,700 INFO L422 BasicCegarLoop]: trace histogram [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:05,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:46:05,700 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:05,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1441178071, now seen corresponding path program 1 times [2020-11-06 22:46:05,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:05,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183746490] [2020-11-06 22:46:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:05,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:05,806 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:46:05,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183746490] [2020-11-06 22:46:05,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:05,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:05,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291319582] [2020-11-06 22:46:05,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:05,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:05,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:05,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:05,808 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 6 states. [2020-11-06 22:46:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:06,322 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2020-11-06 22:46:06,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:06,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-11-06 22:46:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:06,324 INFO L225 Difference]: With dead ends: 83 [2020-11-06 22:46:06,324 INFO L226 Difference]: Without dead ends: 80 [2020-11-06 22:46:06,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-11-06 22:46:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 57. [2020-11-06 22:46:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-06 22:46:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2020-11-06 22:46:06,334 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 39 [2020-11-06 22:46:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:06,334 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2020-11-06 22:46:06,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-11-06 22:46:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-06 22:46:06,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:06,335 INFO L422 BasicCegarLoop]: trace histogram [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:06,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:46:06,335 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:06,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1726856820, now seen corresponding path program 1 times [2020-11-06 22:46:06,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:06,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911139064] [2020-11-06 22:46:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:06,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:06,412 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:46:06,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911139064] [2020-11-06 22:46:06,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:06,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:06,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095673813] [2020-11-06 22:46:06,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:06,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:06,414 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2020-11-06 22:46:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:06,804 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-11-06 22:46:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:06,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2020-11-06 22:46:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:06,806 INFO L225 Difference]: With dead ends: 59 [2020-11-06 22:46:06,806 INFO L226 Difference]: Without dead ends: 56 [2020-11-06 22:46:06,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-06 22:46:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-06 22:46:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-06 22:46:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-11-06 22:46:06,820 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 40 [2020-11-06 22:46:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:06,821 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-11-06 22:46:06,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-11-06 22:46:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-06 22:46:06,823 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:06,823 INFO L422 BasicCegarLoop]: trace histogram [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:06,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:46:06,823 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1652370872, now seen corresponding path program 1 times [2020-11-06 22:46:06,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:06,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319447681] [2020-11-06 22:46:06,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:06,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:06,918 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:46:06,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319447681] [2020-11-06 22:46:06,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:06,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:46:06,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116740857] [2020-11-06 22:46:06,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:46:06,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:06,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:46:06,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:46:06,924 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 5 states. [2020-11-06 22:46:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:07,173 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2020-11-06 22:46:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:07,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2020-11-06 22:46:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:07,174 INFO L225 Difference]: With dead ends: 68 [2020-11-06 22:46:07,174 INFO L226 Difference]: Without dead ends: 65 [2020-11-06 22:46:07,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:46:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-06 22:46:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-11-06 22:46:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-06 22:46:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2020-11-06 22:46:07,185 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 42 [2020-11-06 22:46:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:07,185 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2020-11-06 22:46:07,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:46:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2020-11-06 22:46:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-06 22:46:07,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:07,186 INFO L422 BasicCegarLoop]: trace histogram [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:07,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:46:07,186 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -316090246, now seen corresponding path program 1 times [2020-11-06 22:46:07,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:07,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207024043] [2020-11-06 22:46:07,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:07,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:07,292 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:46:07,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207024043] [2020-11-06 22:46:07,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:07,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:07,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478423566] [2020-11-06 22:46:07,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:07,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:07,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:07,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:07,295 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 6 states. [2020-11-06 22:46:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:07,596 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2020-11-06 22:46:07,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:07,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-06 22:46:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:07,597 INFO L225 Difference]: With dead ends: 65 [2020-11-06 22:46:07,597 INFO L226 Difference]: Without dead ends: 62 [2020-11-06 22:46:07,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-06 22:46:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2020-11-06 22:46:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-06 22:46:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-11-06 22:46:07,611 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 43 [2020-11-06 22:46:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:07,611 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-11-06 22:46:07,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:07,611 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-11-06 22:46:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-06 22:46:07,612 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:07,612 INFO L422 BasicCegarLoop]: trace histogram [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:07,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:46:07,612 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1208838854, now seen corresponding path program 1 times [2020-11-06 22:46:07,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:07,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362042464] [2020-11-06 22:46:07,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:07,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:07,702 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:46:07,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362042464] [2020-11-06 22:46:07,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:07,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:07,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042200746] [2020-11-06 22:46:07,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:07,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:07,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:07,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:07,706 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2020-11-06 22:46:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:08,267 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2020-11-06 22:46:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:46:08,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-11-06 22:46:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:08,269 INFO L225 Difference]: With dead ends: 86 [2020-11-06 22:46:08,269 INFO L226 Difference]: Without dead ends: 83 [2020-11-06 22:46:08,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-06 22:46:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2020-11-06 22:46:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-06 22:46:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2020-11-06 22:46:08,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 44 [2020-11-06 22:46:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:08,279 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2020-11-06 22:46:08,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2020-11-06 22:46:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:46:08,279 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:08,279 INFO L422 BasicCegarLoop]: trace histogram [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:08,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:46:08,280 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1180729276, now seen corresponding path program 1 times [2020-11-06 22:46:08,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:08,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934935045] [2020-11-06 22:46:08,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:08,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:08,377 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:46:08,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934935045] [2020-11-06 22:46:08,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:08,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:08,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287150918] [2020-11-06 22:46:08,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:08,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:08,379 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 6 states. [2020-11-06 22:46:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:08,748 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2020-11-06 22:46:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:46:08,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2020-11-06 22:46:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:08,750 INFO L225 Difference]: With dead ends: 72 [2020-11-06 22:46:08,750 INFO L226 Difference]: Without dead ends: 69 [2020-11-06 22:46:08,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:46:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-06 22:46:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2020-11-06 22:46:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-06 22:46:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2020-11-06 22:46:08,758 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 45 [2020-11-06 22:46:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:08,759 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2020-11-06 22:46:08,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2020-11-06 22:46:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:46:08,759 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:08,759 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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:08,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:46:08,760 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:08,760 INFO L82 PathProgramCache]: Analyzing trace with hash 804890832, now seen corresponding path program 1 times [2020-11-06 22:46:08,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:08,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52211841] [2020-11-06 22:46:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:08,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:08,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52211841] [2020-11-06 22:46:08,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517538703] [2020-11-06 22:46:08,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:46:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:08,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-06 22:46:08,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:46:09,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:46:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:46:09,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:46:09,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-11-06 22:46:09,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980913425] [2020-11-06 22:46:09,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:46:09,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:09,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:46:09,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:46:09,039 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 7 states. [2020-11-06 22:46:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:09,337 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-11-06 22:46:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-06 22:46:09,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2020-11-06 22:46:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:09,341 INFO L225 Difference]: With dead ends: 60 [2020-11-06 22:46:09,341 INFO L226 Difference]: Without dead ends: 57 [2020-11-06 22:46:09,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:46:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-06 22:46:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-06 22:46:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-06 22:46:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-11-06 22:46:09,357 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2020-11-06 22:46:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:09,357 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-11-06 22:46:09,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:46:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-11-06 22:46:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-06 22:46:09,358 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:46:09,358 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:09,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-11-06 22:46:09,572 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:46:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:46:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash 398066145, now seen corresponding path program 1 times [2020-11-06 22:46:09,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:46:09,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685370481] [2020-11-06 22:46:09,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:46:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:09,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:46:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:46:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-06 22:46:09,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685370481] [2020-11-06 22:46:09,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:46:09,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:46:09,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039456150] [2020-11-06 22:46:09,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:46:09,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:46:09,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:46:09,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:46:09,672 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 6 states. [2020-11-06 22:46:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:46:10,241 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2020-11-06 22:46:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:46:10,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-11-06 22:46:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:46:10,242 INFO L225 Difference]: With dead ends: 76 [2020-11-06 22:46:10,242 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:46:10,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:46:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:46:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:46:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:46:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:46:10,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2020-11-06 22:46:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:46:10,244 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:46:10,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:46:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:46:10,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:46:10,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-06 22:46:10,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:46:10,575 WARN L194 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 147 [2020-11-06 22:46:10,859 WARN L194 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 152 [2020-11-06 22:46:11,010 WARN L194 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2020-11-06 22:46:11,671 WARN L194 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 71 [2020-11-06 22:46:12,291 WARN L194 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 72 [2020-11-06 22:46:12,592 WARN L194 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 30 [2020-11-06 22:46:12,833 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2020-11-06 22:46:12,840 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2020-11-06 22:46:12,840 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-06 22:46:12,841 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2020-11-06 22:46:12,841 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-11-06 22:46:12,841 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:12,841 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= ~__return_375~0 |old(~__return_375~0)|)) [2020-11-06 22:46:12,841 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:12,841 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:46:12,841 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:46:12,841 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L262 CegarLoopResult]: At program point L374(line 374) the Hoare annotation is: false [2020-11-06 22:46:12,842 INFO L262 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: false [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point L374-1(line 374) no Hoare annotation was computed. [2020-11-06 22:46:12,842 INFO L266 CegarLoopResult]: For program point L85-1(line 85) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L262 CegarLoopResult]: At program point L308(line 308) the Hoare annotation is: false [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L308-1(line 308) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L143(lines 143 362) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L234(lines 234 338) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L135(lines 135 397) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L262 CegarLoopResult]: At program point L226(line 226) the Hoare annotation is: false [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L226-1(line 226) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L61(lines 61 427) no Hoare annotation was computed. [2020-11-06 22:46:12,843 INFO L262 CegarLoopResult]: At program point L284(line 284) the Hoare annotation is: false [2020-11-06 22:46:12,843 INFO L266 CegarLoopResult]: For program point L284-1(line 284) no Hoare annotation was computed. [2020-11-06 22:46:12,844 INFO L266 CegarLoopResult]: For program point L53(lines 53 433) no Hoare annotation was computed. [2020-11-06 22:46:12,844 INFO L262 CegarLoopResult]: At program point L243(line 243) the Hoare annotation is: false [2020-11-06 22:46:12,844 INFO L266 CegarLoopResult]: For program point L243-1(line 243) no Hoare annotation was computed. [2020-11-06 22:46:12,844 INFO L262 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: false [2020-11-06 22:46:12,844 INFO L266 CegarLoopResult]: For program point L177-1(line 177) no Hoare annotation was computed. [2020-11-06 22:46:12,844 INFO L266 CegarLoopResult]: For program point L111(lines 111 405) no Hoare annotation was computed. [2020-11-06 22:46:12,844 INFO L262 CegarLoopResult]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (= main_~__VERIFIER_assert__cond~3 1)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse3 .cse4 (<= 1 main_~__VERIFIER_assert__cond~16)))) (= |old(~__return_375~0)| ~__return_375~0) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2020-11-06 22:46:12,845 INFO L266 CegarLoopResult]: For program point L194(lines 194 354) no Hoare annotation was computed. [2020-11-06 22:46:12,845 INFO L266 CegarLoopResult]: For program point L384(lines 384 393) no Hoare annotation was computed. [2020-11-06 22:46:12,845 INFO L266 CegarLoopResult]: For program point L95(lines 95 412) no Hoare annotation was computed. [2020-11-06 22:46:12,845 INFO L266 CegarLoopResult]: For program point L29(lines 29 437) no Hoare annotation was computed. [2020-11-06 22:46:12,845 INFO L262 CegarLoopResult]: At program point L145(line 145) the Hoare annotation is: false [2020-11-06 22:46:12,845 INFO L262 CegarLoopResult]: At program point L401(lines 131 402) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (= |old(~__return_375~0)| ~__return_375~0)) [2020-11-06 22:46:12,845 INFO L266 CegarLoopResult]: For program point L145-1(line 145) no Hoare annotation was computed. [2020-11-06 22:46:12,845 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2020-11-06 22:46:12,846 INFO L266 CegarLoopResult]: For program point L104(lines 104 411) no Hoare annotation was computed. [2020-11-06 22:46:12,846 INFO L266 CegarLoopResult]: For program point L71(lines 71 416) no Hoare annotation was computed. [2020-11-06 22:46:12,846 INFO L262 CegarLoopResult]: At program point L327(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (= |old(~__return_375~0)| ~__return_375~0) (let ((.cse0 (let ((.cse17 (+ main_~main__cp~0 1))) (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (not (= main_~main__urilen~0 .cse17))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse10 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse11 (<= .cse17 main_~main__urilen~0)) (.cse12 (= main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse1 .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse16)))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0)))) [2020-11-06 22:46:12,846 INFO L266 CegarLoopResult]: For program point L294(lines 294 318) no Hoare annotation was computed. [2020-11-06 22:46:12,846 INFO L266 CegarLoopResult]: For program point L162(lines 162 359) no Hoare annotation was computed. [2020-11-06 22:46:12,846 INFO L266 CegarLoopResult]: For program point L63(lines 63 422) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L253(lines 253 329) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L187(lines 187 355) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L262 CegarLoopResult]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L212(lines 212 346) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L262 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: false [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L113-1(line 113) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L47(lines 47 434) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L270(lines 270 322) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L204(lines 204 353) no Hoare annotation was computed. [2020-11-06 22:46:12,847 INFO L266 CegarLoopResult]: For program point L262(lines 262 328) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L262 CegarLoopResult]: At program point L386(line 386) the Hoare annotation is: false [2020-11-06 22:46:12,848 INFO L262 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: false [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L386-1(line 386) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L97-1(line 97) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L155(lines 155 360) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L23(lines 23 438) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L262 CegarLoopResult]: At program point L296(line 296) the Hoare annotation is: false [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L296-1(line 296) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L65(lines 65 417) no Hoare annotation was computed. [2020-11-06 22:46:12,848 INFO L262 CegarLoopResult]: At program point L255(line 255) the Hoare annotation is: false [2020-11-06 22:46:12,848 INFO L266 CegarLoopResult]: For program point L255-1(line 255) no Hoare annotation was computed. [2020-11-06 22:46:12,849 INFO L262 CegarLoopResult]: At program point L189(line 189) the Hoare annotation is: false [2020-11-06 22:46:12,849 INFO L266 CegarLoopResult]: For program point L189-1(line 189) no Hoare annotation was computed. [2020-11-06 22:46:12,849 INFO L266 CegarLoopResult]: For program point L123(lines 123 403) no Hoare annotation was computed. [2020-11-06 22:46:12,849 INFO L262 CegarLoopResult]: At program point L214(line 214) the Hoare annotation is: false [2020-11-06 22:46:12,849 INFO L266 CegarLoopResult]: For program point L214-1(line 214) no Hoare annotation was computed. [2020-11-06 22:46:12,849 INFO L262 CegarLoopResult]: At program point L272(line 272) the Hoare annotation is: false [2020-11-06 22:46:12,849 INFO L266 CegarLoopResult]: For program point L272-1(line 272) no Hoare annotation was computed. [2020-11-06 22:46:12,849 INFO L266 CegarLoopResult]: For program point L41(lines 41 435) no Hoare annotation was computed. [2020-11-06 22:46:12,849 INFO L262 CegarLoopResult]: At program point L157(line 157) the Hoare annotation is: false [2020-11-06 22:46:12,849 INFO L266 CegarLoopResult]: For program point L157-1(line 157) no Hoare annotation was computed. [2020-11-06 22:46:12,850 INFO L266 CegarLoopResult]: For program point L372(lines 372 395) no Hoare annotation was computed. [2020-11-06 22:46:12,850 INFO L266 CegarLoopResult]: For program point L83(lines 83 414) no Hoare annotation was computed. [2020-11-06 22:46:12,850 INFO L266 CegarLoopResult]: For program point L306(lines 306 316) no Hoare annotation was computed. [2020-11-06 22:46:12,850 INFO L266 CegarLoopResult]: For program point L224(lines 224 344) no Hoare annotation was computed. [2020-11-06 22:46:12,850 INFO L262 CegarLoopResult]: At program point L125(line 125) the Hoare annotation is: false [2020-11-06 22:46:12,850 INFO L266 CegarLoopResult]: For program point L125-1(line 125) no Hoare annotation was computed. [2020-11-06 22:46:12,850 INFO L266 CegarLoopResult]: For program point L59(lines 59 432) no Hoare annotation was computed. [2020-11-06 22:46:12,851 INFO L262 CegarLoopResult]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse17 (+ main_~main__cp~0 1))) (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse3 (< 0 main_~main__scheme~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (= main_~main__c~0 0)) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse10 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse11 (<= .cse17 main_~main__urilen~0)) (.cse12 (= main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and (let ((.cse0 (let ((.cse6 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse16) (and .cse2 .cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse0 .cse1))) (<= 1 main_~__VERIFIER_assert__cond~10)) (and (< .cse17 main_~main__urilen~0) .cse2 .cse3 .cse4 .cse5 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= main_~__VERIFIER_assert__cond~8 1) .cse16)))) [2020-11-06 22:46:12,851 INFO L266 CegarLoopResult]: For program point L282(lines 282 320) no Hoare annotation was computed. [2020-11-06 22:46:12,851 INFO L266 CegarLoopResult]: For program point L241(lines 241 331) no Hoare annotation was computed. [2020-11-06 22:46:12,851 INFO L266 CegarLoopResult]: For program point L175(lines 175 357) no Hoare annotation was computed. [2020-11-06 22:46:12,851 INFO L266 CegarLoopResult]: For program point L35(lines 35 436) no Hoare annotation was computed. [2020-11-06 22:46:12,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:46:12 BoogieIcfgContainer [2020-11-06 22:46:12,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:46:12,912 INFO L168 Benchmark]: Toolchain (without parser) took 18168.63 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 125.4 MB in the beginning and 143.2 MB in the end (delta: -17.9 MB). Peak memory consumption was 184.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:12,913 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:46:12,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.70 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 112.4 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:12,914 INFO L168 Benchmark]: Boogie Preprocessor took 45.74 ms. Allocated memory is still 151.0 MB. Free memory was 112.4 MB in the beginning and 110.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:12,915 INFO L168 Benchmark]: RCFGBuilder took 917.50 ms. Allocated memory is still 151.0 MB. Free memory was 110.7 MB in the beginning and 117.1 MB in the end (delta: -6.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:12,915 INFO L168 Benchmark]: TraceAbstraction took 16828.53 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 116.6 MB in the beginning and 143.2 MB in the end (delta: -26.6 MB). Peak memory consumption was 175.2 MB. Max. memory is 8.0 GB. [2020-11-06 22:46:12,921 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.16 ms. Allocated memory is still 151.0 MB. Free memory is still 124.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 360.70 ms. Allocated memory is still 151.0 MB. Free memory was 124.7 MB in the beginning and 112.4 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.74 ms. Allocated memory is still 151.0 MB. Free memory was 112.4 MB in the beginning and 110.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 917.50 ms. Allocated memory is still 151.0 MB. Free memory was 110.7 MB in the beginning and 117.1 MB in the end (delta: -6.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16828.53 ms. Allocated memory was 151.0 MB in the beginning and 320.9 MB in the end (delta: 169.9 MB). Free memory was 116.6 MB in the beginning and 143.2 MB in the end (delta: -26.6 MB). Peak memory consumption was 175.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) || (((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) && 1 <= __VERIFIER_assert__cond) || ((((((((((((((((main__cp + 1 < main__urilen && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__c == 0) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && __VERIFIER_assert__cond == 1) && ((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)))) && \old(__return_375) == __return_375 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && \old(__return_375) == __return_375) && ((main__c == 0 && (((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond)) && \old(__return_375) == __return_375) && main__cp + 1 <= main__urilen - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.0s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1326 SDtfs, 3065 SDslu, 888 SDs, 0 SdLazy, 2471 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 359 GetRequests, 177 SyntacticMatches, 8 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 237 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 59 PreInvPairs, 67 NumberOfFragments, 798 HoareAnnotationTreeSize, 59 FomulaSimplifications, 818209 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 28 FomulaSimplificationsInter, 229624 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 881 NumberOfCodeBlocks, 881 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 855 ConstructedInterpolants, 0 QuantifiedInterpolants, 89860 SizeOfPredicates, 15 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 9/21 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...