./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash edfcf451b435e6b30ae37c75ee1e2f5c8348550f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:16:32,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:16:32,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:16:32,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:16:32,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:16:32,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:16:32,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:16:32,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:16:32,687 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:16:32,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:16:32,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:16:32,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:16:32,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:16:32,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:16:32,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:16:32,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:16:32,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:16:32,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:16:32,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:16:32,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:16:32,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:16:32,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:16:32,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:16:32,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:16:32,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:16:32,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:16:32,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:16:32,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:16:32,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:16:32,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:16:32,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:16:32,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:16:32,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:16:32,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:16:32,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:16:32,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:16:32,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:16:32,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:16:32,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:16:32,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:16:32,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:16:32,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:16:32,748 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:16:32,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:16:32,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:16:32,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:16:32,750 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:16:32,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:16:32,751 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:16:32,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:16:32,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:16:32,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:16:32,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:16:32,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:16:32,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:16:32,753 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:16:32,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:16:32,753 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:16:32,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:16:32,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:16:32,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:16:32,755 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:16:32,755 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:16:32,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:16:32,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:16:32,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:16:32,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:16:32,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:16:32,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:16:32,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:16:32,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2019-11-19 21:16:33,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:16:33,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:16:33,096 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:16:33,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:16:33,098 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:16:33,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-19 21:16:33,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353103b2d/52d89af795014812b5fcb4824e959bf4/FLAG802524819 [2019-11-19 21:16:33,649 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:16:33,652 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-19 21:16:33,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353103b2d/52d89af795014812b5fcb4824e959bf4/FLAG802524819 [2019-11-19 21:16:34,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353103b2d/52d89af795014812b5fcb4824e959bf4 [2019-11-19 21:16:34,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:16:34,030 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:16:34,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:16:34,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:16:34,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:16:34,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d7d0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34, skipping insertion in model container [2019-11-19 21:16:34,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,047 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:16:34,077 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:16:34,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:16:34,331 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:16:34,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:16:34,436 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:16:34,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34 WrapperNode [2019-11-19 21:16:34,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:16:34,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:16:34,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:16:34,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:16:34,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:16:34,492 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:16:34,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:16:34,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:16:34,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (1/1) ... [2019-11-19 21:16:34,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:16:34,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:16:34,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:16:34,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:16:34,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (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-11-19 21:16:34,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:16:34,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:16:35,040 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:16:35,040 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 21:16:35,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:35 BoogieIcfgContainer [2019-11-19 21:16:35,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:16:35,043 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:16:35,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:16:35,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:16:35,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:16:34" (1/3) ... [2019-11-19 21:16:35,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18123f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:35, skipping insertion in model container [2019-11-19 21:16:35,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:16:34" (2/3) ... [2019-11-19 21:16:35,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18123f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:16:35, skipping insertion in model container [2019-11-19 21:16:35,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:35" (3/3) ... [2019-11-19 21:16:35,049 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-19 21:16:35,057 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:16:35,065 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-19 21:16:35,077 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-19 21:16:35,103 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:16:35,104 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:16:35,104 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:16:35,104 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:16:35,104 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:16:35,105 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:16:35,105 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:16:35,105 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:16:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-19 21:16:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 21:16:35,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:35,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:35,133 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2019-11-19 21:16:35,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:35,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172975718] [2019-11-19 21:16:35,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:35,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172975718] [2019-11-19 21:16:35,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:35,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:35,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603145854] [2019-11-19 21:16:35,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:35,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:35,404 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2019-11-19 21:16:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:35,594 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2019-11-19 21:16:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:35,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-19 21:16:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:35,611 INFO L225 Difference]: With dead ends: 130 [2019-11-19 21:16:35,612 INFO L226 Difference]: Without dead ends: 109 [2019-11-19 21:16:35,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-19 21:16:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-11-19 21:16:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-19 21:16:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-19 21:16:35,662 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2019-11-19 21:16:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:35,663 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-19 21:16:35,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-19 21:16:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-19 21:16:35,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:35,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:35,666 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:35,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:35,667 INFO L82 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2019-11-19 21:16:35,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:35,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780038592] [2019-11-19 21:16:35,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:35,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780038592] [2019-11-19 21:16:35,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:35,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:35,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812955300] [2019-11-19 21:16:35,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:35,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:35,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:35,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:35,748 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2019-11-19 21:16:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:35,823 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-19 21:16:35,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:35,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-19 21:16:35,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:35,825 INFO L225 Difference]: With dead ends: 65 [2019-11-19 21:16:35,825 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 21:16:35,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:35,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 21:16:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-19 21:16:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-19 21:16:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-19 21:16:35,835 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2019-11-19 21:16:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:35,836 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-19 21:16:35,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:35,836 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-19 21:16:35,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 21:16:35,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:35,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:35,838 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:35,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:35,839 INFO L82 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2019-11-19 21:16:35,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:35,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603153962] [2019-11-19 21:16:35,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:35,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603153962] [2019-11-19 21:16:35,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:35,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:35,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421524082] [2019-11-19 21:16:35,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:35,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:35,897 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-11-19 21:16:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:35,989 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-19 21:16:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:35,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-19 21:16:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:35,991 INFO L225 Difference]: With dead ends: 69 [2019-11-19 21:16:35,991 INFO L226 Difference]: Without dead ends: 67 [2019-11-19 21:16:35,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-19 21:16:35,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-19 21:16:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-19 21:16:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-19 21:16:36,001 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2019-11-19 21:16:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,001 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-19 21:16:36,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-19 21:16:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:16:36,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,003 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,003 INFO L82 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2019-11-19 21:16:36,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030635889] [2019-11-19 21:16:36,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:36,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030635889] [2019-11-19 21:16:36,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:36,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:36,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370375738] [2019-11-19 21:16:36,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:36,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:36,087 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-19 21:16:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,186 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-19 21:16:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:36,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 21:16:36,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,188 INFO L225 Difference]: With dead ends: 66 [2019-11-19 21:16:36,188 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 21:16:36,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 21:16:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-19 21:16:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-19 21:16:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-19 21:16:36,203 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2019-11-19 21:16:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,206 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-19 21:16:36,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-19 21:16:36,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:16:36,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,208 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2019-11-19 21:16:36,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001174351] [2019-11-19 21:16:36,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:36,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001174351] [2019-11-19 21:16:36,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:36,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:36,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597287379] [2019-11-19 21:16:36,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:36,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:36,280 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-19 21:16:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,381 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-19 21:16:36,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:36,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-19 21:16:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,383 INFO L225 Difference]: With dead ends: 65 [2019-11-19 21:16:36,383 INFO L226 Difference]: Without dead ends: 63 [2019-11-19 21:16:36,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-19 21:16:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-11-19 21:16:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 21:16:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-19 21:16:36,396 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2019-11-19 21:16:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,396 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-19 21:16:36,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-19 21:16:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:16:36,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2019-11-19 21:16:36,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990413936] [2019-11-19 21:16:36,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:36,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990413936] [2019-11-19 21:16:36,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:36,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:36,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946555403] [2019-11-19 21:16:36,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:36,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:36,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:36,484 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-19 21:16:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,557 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2019-11-19 21:16:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:36,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 21:16:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,559 INFO L225 Difference]: With dead ends: 63 [2019-11-19 21:16:36,559 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 21:16:36,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 21:16:36,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-11-19 21:16:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 21:16:36,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-19 21:16:36,567 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2019-11-19 21:16:36,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,567 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-19 21:16:36,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-19 21:16:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:16:36,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,569 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,569 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2019-11-19 21:16:36,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129003063] [2019-11-19 21:16:36,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:36,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129003063] [2019-11-19 21:16:36,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:36,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:36,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246909811] [2019-11-19 21:16:36,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:36,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:36,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:36,641 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-11-19 21:16:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,769 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2019-11-19 21:16:36,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:36,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-19 21:16:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,770 INFO L225 Difference]: With dead ends: 100 [2019-11-19 21:16:36,771 INFO L226 Difference]: Without dead ends: 98 [2019-11-19 21:16:36,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-19 21:16:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2019-11-19 21:16:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 21:16:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-19 21:16:36,790 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2019-11-19 21:16:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,790 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-19 21:16:36,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-19 21:16:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:16:36,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,794 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,796 INFO L82 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2019-11-19 21:16:36,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769261624] [2019-11-19 21:16:36,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:36,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769261624] [2019-11-19 21:16:36,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:36,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:36,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682628527] [2019-11-19 21:16:36,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:36,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:36,832 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-11-19 21:16:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:36,892 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-19 21:16:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:36,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 21:16:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:36,893 INFO L225 Difference]: With dead ends: 57 [2019-11-19 21:16:36,893 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 21:16:36,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 21:16:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-11-19 21:16:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 21:16:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-19 21:16:36,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2019-11-19 21:16:36,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:36,903 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-19 21:16:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-19 21:16:36,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 21:16:36,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:36,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:36,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:36,907 INFO L82 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2019-11-19 21:16:36,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:36,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630910876] [2019-11-19 21:16:36,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:37,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630910876] [2019-11-19 21:16:37,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:37,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:37,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662644838] [2019-11-19 21:16:37,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:37,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:37,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:37,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:37,015 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-19 21:16:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:37,135 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2019-11-19 21:16:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:16:37,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-19 21:16:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:37,136 INFO L225 Difference]: With dead ends: 91 [2019-11-19 21:16:37,136 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 21:16:37,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 21:16:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2019-11-19 21:16:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-19 21:16:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-19 21:16:37,142 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 13 [2019-11-19 21:16:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:37,143 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-19 21:16:37,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-19 21:16:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 21:16:37,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:37,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:37,144 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2019-11-19 21:16:37,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:37,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826785584] [2019-11-19 21:16:37,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:37,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826785584] [2019-11-19 21:16:37,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:37,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:37,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110299947] [2019-11-19 21:16:37,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:37,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:37,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:37,181 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-19 21:16:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:37,268 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-19 21:16:37,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:37,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-19 21:16:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:37,270 INFO L225 Difference]: With dead ends: 68 [2019-11-19 21:16:37,270 INFO L226 Difference]: Without dead ends: 66 [2019-11-19 21:16:37,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-19 21:16:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-11-19 21:16:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 21:16:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-19 21:16:37,281 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 13 [2019-11-19 21:16:37,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:37,281 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-19 21:16:37,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-19 21:16:37,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-19 21:16:37,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:37,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:37,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:37,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2019-11-19 21:16:37,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:37,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307400372] [2019-11-19 21:16:37,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:37,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307400372] [2019-11-19 21:16:37,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:37,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:16:37,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296561952] [2019-11-19 21:16:37,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:16:37,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:37,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:16:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:37,378 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-11-19 21:16:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:37,453 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-19 21:16:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:37,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-19 21:16:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:37,455 INFO L225 Difference]: With dead ends: 49 [2019-11-19 21:16:37,455 INFO L226 Difference]: Without dead ends: 47 [2019-11-19 21:16:37,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-19 21:16:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-11-19 21:16:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 21:16:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-19 21:16:37,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 13 [2019-11-19 21:16:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:37,462 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-19 21:16:37,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:16:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-19 21:16:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:16:37,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:37,465 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:37,465 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2019-11-19 21:16:37,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:37,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457211674] [2019-11-19 21:16:37,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:37,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457211674] [2019-11-19 21:16:37,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:37,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:37,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178648060] [2019-11-19 21:16:37,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:37,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:37,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:37,561 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-19 21:16:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:37,628 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-11-19 21:16:37,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:16:37,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-19 21:16:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:37,629 INFO L225 Difference]: With dead ends: 46 [2019-11-19 21:16:37,629 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 21:16:37,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 21:16:37,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-19 21:16:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 21:16:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-19 21:16:37,639 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2019-11-19 21:16:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:37,642 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-19 21:16:37,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-19 21:16:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:16:37,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:37,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:37,643 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:37,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:37,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2019-11-19 21:16:37,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:37,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865285873] [2019-11-19 21:16:37,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:37,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865285873] [2019-11-19 21:16:37,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:37,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:16:37,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116291569] [2019-11-19 21:16:37,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:16:37,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:37,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:16:37,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:37,704 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-11-19 21:16:37,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:37,784 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-11-19 21:16:37,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:16:37,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-19 21:16:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:37,786 INFO L225 Difference]: With dead ends: 57 [2019-11-19 21:16:37,786 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 21:16:37,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 21:16:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-11-19 21:16:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 21:16:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-19 21:16:37,792 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2019-11-19 21:16:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:37,792 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-19 21:16:37,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:16:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-19 21:16:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:16:37,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:37,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:37,795 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2019-11-19 21:16:37,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:37,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795827177] [2019-11-19 21:16:37,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:37,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795827177] [2019-11-19 21:16:37,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:37,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:16:37,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338800465] [2019-11-19 21:16:37,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:16:37,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:16:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:37,876 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-19 21:16:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:37,968 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2019-11-19 21:16:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:37,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 21:16:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:37,970 INFO L225 Difference]: With dead ends: 61 [2019-11-19 21:16:37,970 INFO L226 Difference]: Without dead ends: 59 [2019-11-19 21:16:37,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:37,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-19 21:16:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-11-19 21:16:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 21:16:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-19 21:16:37,976 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 14 [2019-11-19 21:16:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:37,976 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-19 21:16:37,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:16:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-19 21:16:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:16:37,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:37,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:37,982 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2019-11-19 21:16:37,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:37,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42388623] [2019-11-19 21:16:37,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:38,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42388623] [2019-11-19 21:16:38,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:38,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:16:38,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297528097] [2019-11-19 21:16:38,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:16:38,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:16:38,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:38,079 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-11-19 21:16:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:38,162 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-19 21:16:38,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:16:38,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 21:16:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:38,163 INFO L225 Difference]: With dead ends: 37 [2019-11-19 21:16:38,163 INFO L226 Difference]: Without dead ends: 33 [2019-11-19 21:16:38,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-19 21:16:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-19 21:16:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-19 21:16:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-19 21:16:38,170 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-11-19 21:16:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:38,170 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-19 21:16:38,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:16:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-19 21:16:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:16:38,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:38,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:38,171 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2019-11-19 21:16:38,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:38,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166074462] [2019-11-19 21:16:38,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:38,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:38,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166074462] [2019-11-19 21:16:38,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:38,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:16:38,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898061173] [2019-11-19 21:16:38,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:16:38,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:16:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:38,248 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2019-11-19 21:16:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:38,318 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-11-19 21:16:38,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:16:38,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-19 21:16:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:38,319 INFO L225 Difference]: With dead ends: 48 [2019-11-19 21:16:38,320 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 21:16:38,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:16:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 21:16:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-19 21:16:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 21:16:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-19 21:16:38,323 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 15 [2019-11-19 21:16:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:38,324 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-19 21:16:38,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:16:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-19 21:16:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 21:16:38,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:38,325 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:38,326 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:38,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:38,326 INFO L82 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2019-11-19 21:16:38,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:38,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29575791] [2019-11-19 21:16:38,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:38,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29575791] [2019-11-19 21:16:38,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:38,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:16:38,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827368719] [2019-11-19 21:16:38,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:16:38,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:38,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:16:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:16:38,382 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-11-19 21:16:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:38,481 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-19 21:16:38,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:16:38,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-19 21:16:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:38,484 INFO L225 Difference]: With dead ends: 52 [2019-11-19 21:16:38,484 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 21:16:38,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:16:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 21:16:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2019-11-19 21:16:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 21:16:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-19 21:16:38,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-11-19 21:16:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:38,492 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-19 21:16:38,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:16:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-19 21:16:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:16:38,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:16:38,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:16:38,494 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:16:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:16:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2019-11-19 21:16:38,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:16:38,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657210482] [2019-11-19 21:16:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:16:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:16:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:16:38,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657210482] [2019-11-19 21:16:38,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:16:38,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:16:38,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569120844] [2019-11-19 21:16:38,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:16:38,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:16:38,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:16:38,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:16:38,529 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 4 states. [2019-11-19 21:16:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:16:38,574 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-19 21:16:38,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:16:38,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-19 21:16:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:16:38,575 INFO L225 Difference]: With dead ends: 33 [2019-11-19 21:16:38,575 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:16:38,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:16:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:16:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:16:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:16:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:16:38,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-19 21:16:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:16:38,577 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:16:38,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:16:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:16:38,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:16:38,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:16:38,881 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-19 21:16:38,881 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-19 21:16:38,882 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-19 21:16:38,883 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-19 21:16:38,883 INFO L444 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-19 21:16:38,883 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-19 21:16:38,883 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-19 21:16:38,883 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-19 21:16:38,884 INFO L444 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-19 21:16:38,885 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-19 21:16:38,885 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-19 21:16:38,885 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-19 21:16:38,885 INFO L447 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-19 21:16:38,885 INFO L444 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-19 21:16:38,885 INFO L447 ceAbstractionStarter]: At program point L368(lines 10 370) the Hoare annotation is: true [2019-11-19 21:16:38,885 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-19 21:16:38,885 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-19 21:16:38,886 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-19 21:16:38,886 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-19 21:16:38,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-19 21:16:38,887 INFO L440 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~13))) [2019-11-19 21:16:38,887 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-19 21:16:38,887 INFO L444 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-19 21:16:38,887 INFO L440 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-19 21:16:38,887 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-19 21:16:38,888 INFO L444 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-19 21:16:38,888 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-19 21:16:38,888 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-19 21:16:38,889 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-19 21:16:38,889 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-19 21:16:38,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-19 21:16:38,889 INFO L444 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-19 21:16:38,890 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-19 21:16:38,890 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-19 21:16:38,890 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 21:16:38,890 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-19 21:16:38,890 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:16:38,890 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-19 21:16:38,891 INFO L444 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-19 21:16:38,891 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-19 21:16:38,891 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-19 21:16:38,891 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-19 21:16:38,891 INFO L444 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-19 21:16:38,891 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-19 21:16:38,892 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-19 21:16:38,892 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:16:38,892 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-19 21:16:38,892 INFO L444 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-19 21:16:38,892 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-19 21:16:38,892 INFO L444 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-19 21:16:38,893 INFO L440 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-19 21:16:38,893 INFO L440 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1))) [2019-11-19 21:16:38,893 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-19 21:16:38,894 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-19 21:16:38,894 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-19 21:16:38,894 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-19 21:16:38,894 INFO L444 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-19 21:16:38,894 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-19 21:16:38,894 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-19 21:16:38,895 INFO L444 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-19 21:16:38,895 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-19 21:16:38,895 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-19 21:16:38,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:16:38 BoogieIcfgContainer [2019-11-19 21:16:38,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:16:38,918 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:16:38,918 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:16:38,918 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:16:38,919 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:16:35" (3/4) ... [2019-11-19 21:16:38,922 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:16:38,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 21:16:38,940 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:16:39,053 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:16:39,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:16:39,056 INFO L168 Benchmark]: Toolchain (without parser) took 5025.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -117.8 MB). Peak memory consumption was 84.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:39,056 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:16:39,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:39,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:16:39,057 INFO L168 Benchmark]: Boogie Preprocessor took 21.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:16:39,058 INFO L168 Benchmark]: RCFGBuilder took 527.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:39,058 INFO L168 Benchmark]: TraceAbstraction took 3875.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:39,059 INFO L168 Benchmark]: Witness Printer took 135.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:16:39,061 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 527.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3875.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.1 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * Witness Printer took 135.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 <= main__t && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: (main__t + 1 <= main__tagbuf_len && 0 <= main__t) && !(0 == __VERIFIER_assert__cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 17 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 726 SDtfs, 1259 SDslu, 649 SDs, 0 SdLazy, 990 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, 18 MinimizatonAttempts, 225 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 58 HoareAnnotationTreeSize, 6 FomulaSimplifications, 79390 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1100 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 7089 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...