java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:15:14,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:14,208 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:14,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:14,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:14,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:14,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:14,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:14,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:14,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:14,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:14,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:14,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:14,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:14,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:14,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:14,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:14,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:14,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:14,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:14,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:14,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:14,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:14,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:14,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:14,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:14,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:14,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:14,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:14,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:14,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:14,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:14,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:14,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:14,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:14,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:14,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:14,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:14,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:14,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:14,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:14,284 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 [2019-10-14 23:15:14,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:14,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:14,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:14,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:14,316 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:14,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:14,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:14,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:14,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:14,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:14,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:14,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:14,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:14,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:14,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:14,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:14,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:14,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:14,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:14,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:14,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:14,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:14,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:14,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:14,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:14,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:14,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:14,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:14,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:14,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:14,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:14,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:14,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:14,605 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:14,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-14 23:15:14,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9b89d32/f9ab7493909a4ecaa7c7804412799885/FLAGd8c537b5a [2019-10-14 23:15:15,175 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:15,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-10-14 23:15:15,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9b89d32/f9ab7493909a4ecaa7c7804412799885/FLAGd8c537b5a [2019-10-14 23:15:15,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9b89d32/f9ab7493909a4ecaa7c7804412799885 [2019-10-14 23:15:15,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:15,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:15,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:15,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:15,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:15,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:15" (1/1) ... [2019-10-14 23:15:15,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fef2b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:15, skipping insertion in model container [2019-10-14 23:15:15,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:15" (1/1) ... [2019-10-14 23:15:15,526 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:15,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:15,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:15,916 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:16,083 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:16,103 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:16,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16 WrapperNode [2019-10-14 23:15:16,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:16,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:16,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:16,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:16,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (1/1) ... [2019-10-14 23:15:16,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:16,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:16,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:16,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:16,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (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 [2019-10-14 23:15:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:16,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:16,877 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:16,877 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:15:16,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:16 BoogieIcfgContainer [2019-10-14 23:15:16,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:16,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:16,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:16,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:16,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:15" (1/3) ... [2019-10-14 23:15:16,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381cf8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:16, skipping insertion in model container [2019-10-14 23:15:16,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:16" (2/3) ... [2019-10-14 23:15:16,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381cf8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:16, skipping insertion in model container [2019-10-14 23:15:16,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:16" (3/3) ... [2019-10-14 23:15:16,887 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-10-14 23:15:16,897 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:16,905 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-14 23:15:16,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-14 23:15:16,947 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:16,947 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:16,947 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:16,947 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:16,957 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:16,957 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:16,958 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:16,958 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-10-14 23:15:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-14 23:15:17,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:17,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:17,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1915845654, now seen corresponding path program 1 times [2019-10-14 23:15:17,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:17,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494126103] [2019-10-14 23:15:17,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:17,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494126103] [2019-10-14 23:15:17,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:17,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:17,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556220613] [2019-10-14 23:15:17,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:17,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:17,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:17,276 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 5 states. [2019-10-14 23:15:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:17,868 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2019-10-14 23:15:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:17,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-14 23:15:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:17,887 INFO L225 Difference]: With dead ends: 143 [2019-10-14 23:15:17,888 INFO L226 Difference]: Without dead ends: 123 [2019-10-14 23:15:17,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-14 23:15:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-10-14 23:15:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-14 23:15:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-10-14 23:15:17,962 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2019-10-14 23:15:17,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:17,963 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-10-14 23:15:17,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-10-14 23:15:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-14 23:15:17,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:17,967 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:17,969 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:17,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 738329931, now seen corresponding path program 1 times [2019-10-14 23:15:17,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:17,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16662503] [2019-10-14 23:15:17,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:17,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:18,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16662503] [2019-10-14 23:15:18,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:18,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:18,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69846751] [2019-10-14 23:15:18,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:18,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:18,066 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 5 states. [2019-10-14 23:15:18,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:18,398 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2019-10-14 23:15:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:18,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-14 23:15:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:18,401 INFO L225 Difference]: With dead ends: 121 [2019-10-14 23:15:18,401 INFO L226 Difference]: Without dead ends: 113 [2019-10-14 23:15:18,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-14 23:15:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-14 23:15:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-14 23:15:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-10-14 23:15:18,414 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2019-10-14 23:15:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:18,414 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-10-14 23:15:18,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-10-14 23:15:18,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:15:18,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:18,416 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:18,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:18,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:18,417 INFO L82 PathProgramCache]: Analyzing trace with hash -108000398, now seen corresponding path program 1 times [2019-10-14 23:15:18,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:18,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831835726] [2019-10-14 23:15:18,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:18,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831835726] [2019-10-14 23:15:18,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:18,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:18,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687332425] [2019-10-14 23:15:18,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:18,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:18,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:18,496 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 6 states. [2019-10-14 23:15:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:18,815 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-10-14 23:15:18,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:18,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-14 23:15:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:18,819 INFO L225 Difference]: With dead ends: 113 [2019-10-14 23:15:18,819 INFO L226 Difference]: Without dead ends: 111 [2019-10-14 23:15:18,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-14 23:15:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-10-14 23:15:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-14 23:15:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-10-14 23:15:18,829 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2019-10-14 23:15:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:18,830 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-10-14 23:15:18,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:18,830 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-10-14 23:15:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:15:18,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:18,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:18,831 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 946958050, now seen corresponding path program 1 times [2019-10-14 23:15:18,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:18,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596678061] [2019-10-14 23:15:18,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:18,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:18,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596678061] [2019-10-14 23:15:18,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:18,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:18,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364921123] [2019-10-14 23:15:18,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:18,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:18,908 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 5 states. [2019-10-14 23:15:19,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:19,175 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-14 23:15:19,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:19,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:15:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:19,177 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:15:19,177 INFO L226 Difference]: Without dead ends: 107 [2019-10-14 23:15:19,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-14 23:15:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-10-14 23:15:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-14 23:15:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-10-14 23:15:19,186 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2019-10-14 23:15:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:19,187 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-10-14 23:15:19,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-10-14 23:15:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:15:19,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:19,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:19,189 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -695803485, now seen corresponding path program 1 times [2019-10-14 23:15:19,189 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:19,189 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451536554] [2019-10-14 23:15:19,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:19,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451536554] [2019-10-14 23:15:19,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:19,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:19,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851340594] [2019-10-14 23:15:19,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:19,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:19,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:19,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:19,312 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 6 states. [2019-10-14 23:15:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:19,646 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-10-14 23:15:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:19,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:15:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:19,649 INFO L225 Difference]: With dead ends: 125 [2019-10-14 23:15:19,649 INFO L226 Difference]: Without dead ends: 123 [2019-10-14 23:15:19,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-14 23:15:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2019-10-14 23:15:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-14 23:15:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2019-10-14 23:15:19,658 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2019-10-14 23:15:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:19,658 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2019-10-14 23:15:19,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2019-10-14 23:15:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:15:19,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:19,659 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:19,660 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash -694264285, now seen corresponding path program 1 times [2019-10-14 23:15:19,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:19,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021542831] [2019-10-14 23:15:19,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:19,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:19,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021542831] [2019-10-14 23:15:19,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:19,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:19,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473785619] [2019-10-14 23:15:19,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:19,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:19,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:19,728 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2019-10-14 23:15:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,003 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2019-10-14 23:15:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:20,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:15:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,005 INFO L225 Difference]: With dead ends: 105 [2019-10-14 23:15:20,005 INFO L226 Difference]: Without dead ends: 103 [2019-10-14 23:15:20,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-10-14 23:15:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-10-14 23:15:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-14 23:15:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-10-14 23:15:20,011 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2019-10-14 23:15:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,012 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-10-14 23:15:20,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-10-14 23:15:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:20,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:20,014 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash -95068443, now seen corresponding path program 1 times [2019-10-14 23:15:20,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430915553] [2019-10-14 23:15:20,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:20,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430915553] [2019-10-14 23:15:20,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:20,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307973236] [2019-10-14 23:15:20,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:20,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:20,088 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 6 states. [2019-10-14 23:15:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,401 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-10-14 23:15:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:20,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 23:15:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,403 INFO L225 Difference]: With dead ends: 120 [2019-10-14 23:15:20,403 INFO L226 Difference]: Without dead ends: 118 [2019-10-14 23:15:20,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:15:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-14 23:15:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2019-10-14 23:15:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-14 23:15:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-10-14 23:15:20,410 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2019-10-14 23:15:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,410 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-10-14 23:15:20,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-10-14 23:15:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:20,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,411 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:20,412 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash -93703023, now seen corresponding path program 1 times [2019-10-14 23:15:20,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78654653] [2019-10-14 23:15:20,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:20,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78654653] [2019-10-14 23:15:20,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:20,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712023072] [2019-10-14 23:15:20,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:20,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:20,463 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-10-14 23:15:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:20,784 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-10-14 23:15:20,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:20,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 23:15:20,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:20,786 INFO L225 Difference]: With dead ends: 120 [2019-10-14 23:15:20,786 INFO L226 Difference]: Without dead ends: 118 [2019-10-14 23:15:20,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-14 23:15:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2019-10-14 23:15:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-14 23:15:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-10-14 23:15:20,793 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2019-10-14 23:15:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:20,793 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-10-14 23:15:20,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-10-14 23:15:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:20,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:20,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -47353193, now seen corresponding path program 1 times [2019-10-14 23:15:20,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916871532] [2019-10-14 23:15:20,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:20,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916871532] [2019-10-14 23:15:20,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:20,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823135672] [2019-10-14 23:15:20,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:20,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:20,871 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 6 states. [2019-10-14 23:15:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,157 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2019-10-14 23:15:21,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:21,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 23:15:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,158 INFO L225 Difference]: With dead ends: 99 [2019-10-14 23:15:21,159 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 23:15:21,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 23:15:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-14 23:15:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-14 23:15:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-10-14 23:15:21,164 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 18 [2019-10-14 23:15:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,164 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-10-14 23:15:21,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-10-14 23:15:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:21,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,165 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,166 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1390176726, now seen corresponding path program 1 times [2019-10-14 23:15:21,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027008515] [2019-10-14 23:15:21,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027008515] [2019-10-14 23:15:21,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:21,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364797570] [2019-10-14 23:15:21,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:21,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:21,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,268 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2019-10-14 23:15:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,557 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2019-10-14 23:15:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:21,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-14 23:15:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,558 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:15:21,559 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 23:15:21,559 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:15:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 23:15:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-10-14 23:15:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-14 23:15:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2019-10-14 23:15:21,565 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 19 [2019-10-14 23:15:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,565 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2019-10-14 23:15:21,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2019-10-14 23:15:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:15:21,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,567 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1166363704, now seen corresponding path program 1 times [2019-10-14 23:15:21,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687335856] [2019-10-14 23:15:21,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687335856] [2019-10-14 23:15:21,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:21,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239632308] [2019-10-14 23:15:21,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:21,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:21,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:21,655 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states. [2019-10-14 23:15:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,941 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2019-10-14 23:15:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:21,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 23:15:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,942 INFO L225 Difference]: With dead ends: 103 [2019-10-14 23:15:21,943 INFO L226 Difference]: Without dead ends: 101 [2019-10-14 23:15:21,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:15:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-14 23:15:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2019-10-14 23:15:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-14 23:15:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-10-14 23:15:21,948 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 20 [2019-10-14 23:15:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,948 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-10-14 23:15:21,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-10-14 23:15:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:15:21,951 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,951 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,953 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1797533329, now seen corresponding path program 1 times [2019-10-14 23:15:21,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39822223] [2019-10-14 23:15:21,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39822223] [2019-10-14 23:15:21,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:21,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488060498] [2019-10-14 23:15:21,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:21,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:21,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:21,995 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2019-10-14 23:15:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,242 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-10-14 23:15:22,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:22,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-14 23:15:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,243 INFO L225 Difference]: With dead ends: 91 [2019-10-14 23:15:22,244 INFO L226 Difference]: Without dead ends: 58 [2019-10-14 23:15:22,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-14 23:15:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-14 23:15:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:15:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-10-14 23:15:22,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 21 [2019-10-14 23:15:22,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,247 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-10-14 23:15:22,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-10-14 23:15:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 23:15:22,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,249 INFO L380 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, 1, 1, 1] [2019-10-14 23:15:22,249 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1203360725, now seen corresponding path program 1 times [2019-10-14 23:15:22,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633449997] [2019-10-14 23:15:22,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633449997] [2019-10-14 23:15:22,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-14 23:15:22,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494655430] [2019-10-14 23:15:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:15:22,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:15:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:22,443 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 14 states. [2019-10-14 23:15:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,783 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-10-14 23:15:22,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:15:22,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-10-14 23:15:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,784 INFO L225 Difference]: With dead ends: 67 [2019-10-14 23:15:22,785 INFO L226 Difference]: Without dead ends: 65 [2019-10-14 23:15:22,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:15:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-14 23:15:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2019-10-14 23:15:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-14 23:15:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-10-14 23:15:22,788 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2019-10-14 23:15:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,788 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-10-14 23:15:22,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:15:22,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-10-14 23:15:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 23:15:22,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,789 INFO L380 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, 1, 1, 1] [2019-10-14 23:15:22,790 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1203346823, now seen corresponding path program 1 times [2019-10-14 23:15:22,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910178868] [2019-10-14 23:15:22,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910178868] [2019-10-14 23:15:22,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-14 23:15:22,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409620536] [2019-10-14 23:15:22,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:15:22,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:15:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:22,973 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 14 states. [2019-10-14 23:15:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,317 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-10-14 23:15:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:15:23,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2019-10-14 23:15:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,319 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:15:23,319 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 23:15:23,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:15:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 23:15:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-10-14 23:15:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 23:15:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-10-14 23:15:23,322 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2019-10-14 23:15:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,323 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-10-14 23:15:23,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:15:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-10-14 23:15:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:15:23,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,324 INFO L380 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, 1, 1, 1, 1] [2019-10-14 23:15:23,324 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1350519771, now seen corresponding path program 1 times [2019-10-14 23:15:23,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678213303] [2019-10-14 23:15:23,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678213303] [2019-10-14 23:15:23,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856004946] [2019-10-14 23:15:23,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,519 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 6 states. [2019-10-14 23:15:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,666 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-10-14 23:15:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:23,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-14 23:15:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,667 INFO L225 Difference]: With dead ends: 62 [2019-10-14 23:15:23,667 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:15:23,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 26 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:15:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:15:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-14 23:15:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 23:15:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-10-14 23:15:23,670 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-10-14 23:15:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,671 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-10-14 23:15:23,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-10-14 23:15:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:15:23,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,672 INFO L380 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, 1, 1, 1, 1] [2019-10-14 23:15:23,672 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1350950747, now seen corresponding path program 1 times [2019-10-14 23:15:23,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408461261] [2019-10-14 23:15:23,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408461261] [2019-10-14 23:15:23,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,832 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,832 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529615107] [2019-10-14 23:15:23,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,833 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 6 states. [2019-10-14 23:15:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,028 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-10-14 23:15:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:24,028 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-14 23:15:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,029 INFO L225 Difference]: With dead ends: 52 [2019-10-14 23:15:24,029 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:24,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 26 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:24,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:24,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2019-10-14 23:15:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,031 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:24,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:24,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:24,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:24,212 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,212 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2019-10-14 23:15:24,212 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,212 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,212 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:15:24,213 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:15:24,213 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:24,213 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-10-14 23:15:24,213 INFO L443 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-10-14 23:15:24,233 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-10-14 23:15:24,233 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 12 1001) no Hoare annotation was computed. [2019-10-14 23:15:24,233 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-10-14 23:15:24,233 INFO L443 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-10-14 23:15:24,234 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-10-14 23:15:24,235 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-10-14 23:15:24,235 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-14 23:15:24,235 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-10-14 23:15:24,235 INFO L439 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-14 23:15:24,235 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-10-14 23:15:24,235 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-10-14 23:15:24,235 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 12 1001) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-10-14 23:15:24,236 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-14 23:15:24,237 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-10-14 23:15:24,237 INFO L443 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-10-14 23:15:24,237 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-10-14 23:15:24,237 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-10-14 23:15:24,237 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-10-14 23:15:24,237 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-10-14 23:15:24,238 INFO L439 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-14 23:15:24,238 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-10-14 23:15:24,238 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-10-14 23:15:24,238 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-14 23:15:24,238 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-10-14 23:15:24,238 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-10-14 23:15:24,238 INFO L439 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: (or (and (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) (<= 0 main_~main__t~0)) [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-10-14 23:15:24,239 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-10-14 23:15:24,240 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-10-14 23:15:24,240 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-10-14 23:15:24,240 INFO L443 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-10-14 23:15:24,240 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-14 23:15:24,240 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-10-14 23:15:24,240 INFO L439 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2019-10-14 23:15:24,240 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-10-14 23:15:24,241 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-10-14 23:15:24,242 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-10-14 23:15:24,243 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-10-14 23:15:24,243 INFO L443 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-10-14 23:15:24,243 INFO L443 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-10-14 23:15:24,243 INFO L439 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-10-14 23:15:24,243 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-10-14 23:15:24,243 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-14 23:15:24,243 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 12 1001) the Hoare annotation is: (and (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-10-14 23:15:24,244 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-10-14 23:15:24,245 INFO L443 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-10-14 23:15:24,246 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-10-14 23:15:24,247 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-10-14 23:15:24,248 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-10-14 23:15:24,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:24 BoogieIcfgContainer [2019-10-14 23:15:24,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:15:24,269 INFO L168 Benchmark]: Toolchain (without parser) took 8759.75 ms. Allocated memory was 140.0 MB in the beginning and 325.1 MB in the end (delta: 185.1 MB). Free memory was 104.0 MB in the beginning and 288.9 MB in the end (delta: -184.9 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,270 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.68 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 103.8 MB in the beginning and 178.1 MB in the end (delta: -74.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,272 INFO L168 Benchmark]: Boogie Preprocessor took 50.80 ms. Allocated memory is still 203.9 MB. Free memory was 178.1 MB in the beginning and 175.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,272 INFO L168 Benchmark]: RCFGBuilder took 723.14 ms. Allocated memory is still 203.9 MB. Free memory was 175.4 MB in the beginning and 127.0 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,273 INFO L168 Benchmark]: TraceAbstraction took 7386.81 ms. Allocated memory was 203.9 MB in the beginning and 325.1 MB in the end (delta: 121.1 MB). Free memory was 126.3 MB in the beginning and 288.9 MB in the end (delta: -162.5 MB). Peak memory consumption was 124.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:24,277 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 594.68 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 103.8 MB in the beginning and 178.1 MB in the end (delta: -74.3 MB). Peak memory consumption was 28.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.80 ms. Allocated memory is still 203.9 MB. Free memory was 178.1 MB in the beginning and 175.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 723.14 ms. Allocated memory is still 203.9 MB. Free memory was 175.4 MB in the beginning and 127.0 MB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7386.81 ms. Allocated memory was 203.9 MB in the beginning and 325.1 MB in the end (delta: 121.1 MB). Free memory was 126.3 MB in the beginning and 288.9 MB in the end (delta: -162.5 MB). Peak memory consumption was 124.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((__tmp_2624_1 == \old(__tmp_2624_1) && __return_2598 == \old(__return_2598)) && __tmp_3137_1 == \old(__tmp_3137_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && __tmp_2624_0 == \old(__tmp_2624_0)) || 0 <= main__t - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. Result: SAFE, OverallTime: 7.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 730 SDtfs, 2646 SDslu, 669 SDs, 0 SdLazy, 3510 SolverSat, 551 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 58 SyntacticMatches, 57 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 102 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 89 HoareAnnotationTreeSize, 9 FomulaSimplifications, 1247 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 109 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 51812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...