/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:37:54,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:37:54,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:37:54,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:37:54,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:37:54,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:37:54,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:37:54,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:37:54,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:37:54,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:37:54,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:37:54,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:37:54,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:37:54,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:37:54,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:37:54,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:37:54,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:37:54,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:37:54,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:37:54,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:37:54,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:37:54,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:37:54,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:37:54,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:37:54,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:37:54,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:37:54,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:37:54,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:37:54,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:37:54,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:37:54,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:37:54,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:37:54,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:37:54,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:37:54,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:37:54,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:37:54,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:37:54,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:37:54,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:37:54,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:37:54,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:37:54,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:37:54,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:37:54,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:37:54,691 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:37:54,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:37:54,692 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:37:54,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:37:54,692 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:37:54,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:37:54,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:37:54,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:37:54,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:37:54,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:37:54,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:37:54,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:37:54,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:37:54,694 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:37:54,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:37:54,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:37:54,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:37:54,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:37:54,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:37:54,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:37:54,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:37:54,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:37:54,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:37:54,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:37:54,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:37:54,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:37:54,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:37:55,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:37:55,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:37:55,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:37:55,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:37:55,046 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:37:55,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-11-07 04:37:55,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4583e672/0dbf813c02124fb785be7274f9a992b0/FLAG673ab8fd0 [2019-11-07 04:37:55,897 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:37:55,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-11-07 04:37:55,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4583e672/0dbf813c02124fb785be7274f9a992b0/FLAG673ab8fd0 [2019-11-07 04:37:55,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4583e672/0dbf813c02124fb785be7274f9a992b0 [2019-11-07 04:37:55,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:37:55,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:37:55,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:37:55,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:37:55,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:37:55,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:55" (1/1) ... [2019-11-07 04:37:55,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2f6022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:55, skipping insertion in model container [2019-11-07 04:37:55,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:37:55" (1/1) ... [2019-11-07 04:37:55,987 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:37:56,095 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:37:56,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:37:56,964 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:37:57,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:37:57,267 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:37:57,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57 WrapperNode [2019-11-07 04:37:57,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:37:57,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:37:57,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:37:57,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:37:57,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (1/1) ... [2019-11-07 04:37:57,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:37:57,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:37:57,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:37:57,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:37:57,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (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-07 04:37:57,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:37:57,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:37:57,566 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:37:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:37:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:37:57,566 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:37:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:37:57,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:37:59,323 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:37:59,324 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-07 04:37:59,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:59 BoogieIcfgContainer [2019-11-07 04:37:59,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:37:59,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:37:59,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:37:59,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:37:59,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:37:55" (1/3) ... [2019-11-07 04:37:59,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5fea50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:59, skipping insertion in model container [2019-11-07 04:37:59,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:37:57" (2/3) ... [2019-11-07 04:37:59,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a5fea50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:37:59, skipping insertion in model container [2019-11-07 04:37:59,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:37:59" (3/3) ... [2019-11-07 04:37:59,341 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-11-07 04:37:59,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:37:59,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:37:59,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:37:59,418 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:37:59,419 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:37:59,419 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:37:59,419 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:37:59,419 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:37:59,419 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:37:59,419 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:37:59,419 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:37:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-11-07 04:37:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 04:37:59,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:37:59,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:37:59,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:37:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:37:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1507363399, now seen corresponding path program 1 times [2019-11-07 04:37:59,501 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:37:59,502 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5701050] [2019-11-07 04:37:59,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:37:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:37:59,716 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-07 04:37:59,717 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5701050] [2019-11-07 04:37:59,719 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:37:59,719 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 04:37:59,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135413176] [2019-11-07 04:37:59,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 04:37:59,730 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:37:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 04:37:59,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 04:37:59,758 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 2 states. [2019-11-07 04:37:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:37:59,815 INFO L93 Difference]: Finished difference Result 468 states and 915 transitions. [2019-11-07 04:37:59,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 04:37:59,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-07 04:37:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:37:59,850 INFO L225 Difference]: With dead ends: 468 [2019-11-07 04:37:59,851 INFO L226 Difference]: Without dead ends: 227 [2019-11-07 04:37:59,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 04:37:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-07 04:37:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-11-07 04:37:59,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-07 04:37:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 396 transitions. [2019-11-07 04:37:59,990 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 396 transitions. Word has length 12 [2019-11-07 04:37:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:37:59,991 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 396 transitions. [2019-11-07 04:37:59,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 04:37:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 396 transitions. [2019-11-07 04:37:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 04:37:59,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:37:59,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:37:59,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:37:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:37:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1048841406, now seen corresponding path program 1 times [2019-11-07 04:37:59,993 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:37:59,994 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232576737] [2019-11-07 04:37:59,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:00,117 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-07 04:38:00,118 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232576737] [2019-11-07 04:38:00,119 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:00,121 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:00,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794488806] [2019-11-07 04:38:00,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:00,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:00,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:00,125 INFO L87 Difference]: Start difference. First operand 227 states and 396 transitions. Second operand 3 states. [2019-11-07 04:38:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:00,365 INFO L93 Difference]: Finished difference Result 452 states and 791 transitions. [2019-11-07 04:38:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:00,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-07 04:38:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:00,368 INFO L225 Difference]: With dead ends: 452 [2019-11-07 04:38:00,368 INFO L226 Difference]: Without dead ends: 230 [2019-11-07 04:38:00,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-07 04:38:00,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-07 04:38:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-07 04:38:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 399 transitions. [2019-11-07 04:38:00,385 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 399 transitions. Word has length 13 [2019-11-07 04:38:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:00,386 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 399 transitions. [2019-11-07 04:38:00,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 399 transitions. [2019-11-07 04:38:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:38:00,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:00,387 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:00,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1370593924, now seen corresponding path program 1 times [2019-11-07 04:38:00,388 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:00,388 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394350995] [2019-11-07 04:38:00,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:38:00,479 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394350995] [2019-11-07 04:38:00,479 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:00,480 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:00,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7769969] [2019-11-07 04:38:00,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:00,481 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:00,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:00,483 INFO L87 Difference]: Start difference. First operand 230 states and 399 transitions. Second operand 3 states. [2019-11-07 04:38:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:00,611 INFO L93 Difference]: Finished difference Result 439 states and 772 transitions. [2019-11-07 04:38:00,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:00,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-07 04:38:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:00,614 INFO L225 Difference]: With dead ends: 439 [2019-11-07 04:38:00,615 INFO L226 Difference]: Without dead ends: 215 [2019-11-07 04:38:00,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-07 04:38:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-11-07 04:38:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-07 04:38:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 377 transitions. [2019-11-07 04:38:00,627 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 377 transitions. Word has length 18 [2019-11-07 04:38:00,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:00,627 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 377 transitions. [2019-11-07 04:38:00,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:00,627 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 377 transitions. [2019-11-07 04:38:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:38:00,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:00,629 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:00,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash -93612677, now seen corresponding path program 1 times [2019-11-07 04:38:00,630 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:00,630 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052404629] [2019-11-07 04:38:00,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:38:00,693 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052404629] [2019-11-07 04:38:00,694 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:00,694 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:00,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655652515] [2019-11-07 04:38:00,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:00,695 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:00,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:00,696 INFO L87 Difference]: Start difference. First operand 215 states and 377 transitions. Second operand 3 states. [2019-11-07 04:38:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:01,169 INFO L93 Difference]: Finished difference Result 617 states and 1101 transitions. [2019-11-07 04:38:01,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:01,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-07 04:38:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:01,172 INFO L225 Difference]: With dead ends: 617 [2019-11-07 04:38:01,172 INFO L226 Difference]: Without dead ends: 409 [2019-11-07 04:38:01,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-07 04:38:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2019-11-07 04:38:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-07 04:38:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 721 transitions. [2019-11-07 04:38:01,188 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 721 transitions. Word has length 21 [2019-11-07 04:38:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:01,189 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 721 transitions. [2019-11-07 04:38:01,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 721 transitions. [2019-11-07 04:38:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 04:38:01,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:01,193 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:01,193 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -301260006, now seen corresponding path program 1 times [2019-11-07 04:38:01,195 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:01,195 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959631873] [2019-11-07 04:38:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:01,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:38:01,280 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959631873] [2019-11-07 04:38:01,280 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:01,280 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:01,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380429949] [2019-11-07 04:38:01,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:01,283 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:01,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:01,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:01,283 INFO L87 Difference]: Start difference. First operand 403 states and 721 transitions. Second operand 3 states. [2019-11-07 04:38:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:01,415 INFO L93 Difference]: Finished difference Result 639 states and 1133 transitions. [2019-11-07 04:38:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:01,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 04:38:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:01,417 INFO L225 Difference]: With dead ends: 639 [2019-11-07 04:38:01,418 INFO L226 Difference]: Without dead ends: 247 [2019-11-07 04:38:01,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-07 04:38:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-11-07 04:38:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-07 04:38:01,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 421 transitions. [2019-11-07 04:38:01,432 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 421 transitions. Word has length 22 [2019-11-07 04:38:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:01,432 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 421 transitions. [2019-11-07 04:38:01,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 421 transitions. [2019-11-07 04:38:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 04:38:01,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:01,438 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:01,438 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1404394409, now seen corresponding path program 1 times [2019-11-07 04:38:01,439 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:01,440 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920951664] [2019-11-07 04:38:01,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:38:01,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920951664] [2019-11-07 04:38:01,508 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:01,508 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:01,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714864420] [2019-11-07 04:38:01,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:01,509 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:01,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:01,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:01,512 INFO L87 Difference]: Start difference. First operand 245 states and 421 transitions. Second operand 3 states. [2019-11-07 04:38:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:01,657 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-11-07 04:38:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:01,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 04:38:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:01,660 INFO L225 Difference]: With dead ends: 247 [2019-11-07 04:38:01,660 INFO L226 Difference]: Without dead ends: 245 [2019-11-07 04:38:01,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-07 04:38:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-11-07 04:38:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-07 04:38:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 413 transitions. [2019-11-07 04:38:01,674 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 413 transitions. Word has length 22 [2019-11-07 04:38:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:01,675 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 413 transitions. [2019-11-07 04:38:01,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 413 transitions. [2019-11-07 04:38:01,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 04:38:01,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:01,677 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:01,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash 439813276, now seen corresponding path program 1 times [2019-11-07 04:38:01,678 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:01,681 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812634203] [2019-11-07 04:38:01,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:38:01,775 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812634203] [2019-11-07 04:38:01,775 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:01,775 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:01,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280537888] [2019-11-07 04:38:01,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:01,778 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:01,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:01,784 INFO L87 Difference]: Start difference. First operand 245 states and 413 transitions. Second operand 3 states. [2019-11-07 04:38:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:02,327 INFO L93 Difference]: Finished difference Result 652 states and 1107 transitions. [2019-11-07 04:38:02,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:02,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 04:38:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:02,331 INFO L225 Difference]: With dead ends: 652 [2019-11-07 04:38:02,331 INFO L226 Difference]: Without dead ends: 414 [2019-11-07 04:38:02,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-07 04:38:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 401. [2019-11-07 04:38:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-11-07 04:38:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 613 transitions. [2019-11-07 04:38:02,348 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 613 transitions. Word has length 25 [2019-11-07 04:38:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:02,349 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 613 transitions. [2019-11-07 04:38:02,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 613 transitions. [2019-11-07 04:38:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 04:38:02,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:02,351 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:02,351 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2062836266, now seen corresponding path program 1 times [2019-11-07 04:38:02,352 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:02,353 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581541861] [2019-11-07 04:38:02,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:38:02,407 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581541861] [2019-11-07 04:38:02,407 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:02,407 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:02,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565531680] [2019-11-07 04:38:02,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:02,408 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:02,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:02,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:02,409 INFO L87 Difference]: Start difference. First operand 401 states and 613 transitions. Second operand 3 states. [2019-11-07 04:38:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:02,460 INFO L93 Difference]: Finished difference Result 732 states and 1128 transitions. [2019-11-07 04:38:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:02,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-07 04:38:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:02,464 INFO L225 Difference]: With dead ends: 732 [2019-11-07 04:38:02,464 INFO L226 Difference]: Without dead ends: 342 [2019-11-07 04:38:02,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-07 04:38:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-11-07 04:38:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-07 04:38:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 525 transitions. [2019-11-07 04:38:02,476 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 525 transitions. Word has length 35 [2019-11-07 04:38:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:02,477 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 525 transitions. [2019-11-07 04:38:02,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 525 transitions. [2019-11-07 04:38:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 04:38:02,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:02,478 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:02,479 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2124147787, now seen corresponding path program 1 times [2019-11-07 04:38:02,480 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:02,480 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112599280] [2019-11-07 04:38:02,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:38:02,516 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112599280] [2019-11-07 04:38:02,517 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:02,517 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:02,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329218363] [2019-11-07 04:38:02,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:02,518 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:02,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:02,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:02,519 INFO L87 Difference]: Start difference. First operand 342 states and 525 transitions. Second operand 3 states. [2019-11-07 04:38:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:02,609 INFO L93 Difference]: Finished difference Result 667 states and 1032 transitions. [2019-11-07 04:38:02,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:02,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-07 04:38:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:02,612 INFO L225 Difference]: With dead ends: 667 [2019-11-07 04:38:02,612 INFO L226 Difference]: Without dead ends: 336 [2019-11-07 04:38:02,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-07 04:38:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-11-07 04:38:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-07 04:38:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 505 transitions. [2019-11-07 04:38:02,623 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 505 transitions. Word has length 36 [2019-11-07 04:38:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:02,623 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 505 transitions. [2019-11-07 04:38:02,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 505 transitions. [2019-11-07 04:38:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-07 04:38:02,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:02,624 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:02,625 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1987626795, now seen corresponding path program 1 times [2019-11-07 04:38:02,625 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:02,626 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83715277] [2019-11-07 04:38:02,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:38:02,668 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83715277] [2019-11-07 04:38:02,669 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:02,669 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:38:02,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312602726] [2019-11-07 04:38:02,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:38:02,670 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:38:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:38:02,670 INFO L87 Difference]: Start difference. First operand 336 states and 505 transitions. Second operand 4 states. [2019-11-07 04:38:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:03,052 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2019-11-07 04:38:03,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:03,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-07 04:38:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:03,055 INFO L225 Difference]: With dead ends: 379 [2019-11-07 04:38:03,056 INFO L226 Difference]: Without dead ends: 342 [2019-11-07 04:38:03,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:38:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-07 04:38:03,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-11-07 04:38:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-07 04:38:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 469 transitions. [2019-11-07 04:38:03,066 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 469 transitions. Word has length 40 [2019-11-07 04:38:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:03,067 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 469 transitions. [2019-11-07 04:38:03,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:38:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 469 transitions. [2019-11-07 04:38:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 04:38:03,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:03,068 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:03,068 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:03,069 INFO L82 PathProgramCache]: Analyzing trace with hash -334088251, now seen corresponding path program 1 times [2019-11-07 04:38:03,069 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:03,069 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162526648] [2019-11-07 04:38:03,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:38:03,109 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162526648] [2019-11-07 04:38:03,109 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:03,109 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:03,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379844430] [2019-11-07 04:38:03,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:03,110 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:03,111 INFO L87 Difference]: Start difference. First operand 336 states and 469 transitions. Second operand 3 states. [2019-11-07 04:38:03,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:03,158 INFO L93 Difference]: Finished difference Result 638 states and 891 transitions. [2019-11-07 04:38:03,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:03,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-07 04:38:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:03,161 INFO L225 Difference]: With dead ends: 638 [2019-11-07 04:38:03,161 INFO L226 Difference]: Without dead ends: 313 [2019-11-07 04:38:03,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-07 04:38:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-11-07 04:38:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-07 04:38:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2019-11-07 04:38:03,170 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 41 [2019-11-07 04:38:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:03,170 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2019-11-07 04:38:03,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2019-11-07 04:38:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 04:38:03,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:38:03,171 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:38:03,171 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:38:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:38:03,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1158837627, now seen corresponding path program 1 times [2019-11-07 04:38:03,172 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:38:03,172 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142240069] [2019-11-07 04:38:03,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:38:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:38:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 04:38:03,206 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142240069] [2019-11-07 04:38:03,206 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:38:03,206 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:38:03,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410711509] [2019-11-07 04:38:03,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:38:03,207 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:38:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:38:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:03,208 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand 3 states. [2019-11-07 04:38:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:38:03,249 INFO L93 Difference]: Finished difference Result 477 states and 668 transitions. [2019-11-07 04:38:03,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:38:03,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-07 04:38:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:38:03,250 INFO L225 Difference]: With dead ends: 477 [2019-11-07 04:38:03,250 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:38:03,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:38:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:38:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:38:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:38:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:38:03,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-11-07 04:38:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:38:03,252 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:38:03,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:38:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:38:03,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:38:03,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:38:03,395 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:38:03,395 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:38:03,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:38:03,396 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:38:03,396 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:38:03,396 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:38:03,396 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 1255) no Hoare annotation was computed. [2019-11-07 04:38:03,396 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-11-07 04:38:03,396 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-11-07 04:38:03,397 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-11-07 04:38:03,398 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-11-07 04:38:03,399 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-11-07 04:38:03,400 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L439 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-11-07 04:38:03,401 INFO L443 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-11-07 04:38:03,402 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-11-07 04:38:03,403 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-11-07 04:38:03,404 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-11-07 04:38:03,405 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-11-07 04:38:03,405 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-11-07 04:38:03,405 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-11-07 04:38:03,405 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-11-07 04:38:03,405 INFO L439 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse1 (<= 1 main_~this_m_conn~0)) (.cse0 (<= 1 main_~this_m_delta~0)) (.cse3 (= 0 main_~this_m_conn~0)) (.cse2 (= 0 main_~this_m_conn_data_listener~0))) (or (and (<= 1 main_~this_m_conn_data_listener~0) .cse0 .cse1 (= 3 main_~q~0)) (and .cse0 (<= 4 main_~q~0) .cse1 .cse2) (and .cse0 (= 2 main_~q~0) .cse3 .cse2) (and .cse0 .cse3 (= main_~q~0 0) .cse2))) [2019-11-07 04:38:03,405 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-11-07 04:38:03,406 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-11-07 04:38:03,407 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-11-07 04:38:03,408 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-07 04:38:03,409 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-11-07 04:38:03,410 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 16 1255) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-11-07 04:38:03,411 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-11-07 04:38:03,412 INFO L443 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-11-07 04:38:03,413 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-11-07 04:38:03,414 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-11-07 04:38:03,415 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-11-07 04:38:03,416 INFO L443 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-11-07 04:38:03,417 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-11-07 04:38:03,418 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-11-07 04:38:03,419 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 16 1255) the Hoare annotation is: true [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-11-07 04:38:03,420 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-11-07 04:38:03,421 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 32 1250) the Hoare annotation is: (let ((.cse0 (<= 1 main_~this_m_delta~0)) (.cse1 (= 0 main_~this_m_conn_data_listener~0))) (or (and .cse0 (<= 4 main_~q~0) (<= 1 main_~this_m_conn~0) .cse1) (and .cse0 (= 0 main_~this_m_conn~0) (= main_~q~0 0) .cse1))) [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-11-07 04:38:03,422 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-11-07 04:38:03,423 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-11-07 04:38:03,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:38:03 BoogieIcfgContainer [2019-11-07 04:38:03,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:38:03,444 INFO L168 Benchmark]: Toolchain (without parser) took 7473.98 ms. Allocated memory was 138.4 MB in the beginning and 325.6 MB in the end (delta: 187.2 MB). Free memory was 93.4 MB in the beginning and 124.9 MB in the end (delta: -31.5 MB). Peak memory consumption was 155.6 MB. Max. memory is 7.1 GB. [2019-11-07 04:38:03,444 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 04:38:03,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1299.04 ms. Allocated memory was 138.4 MB in the beginning and 232.3 MB in the end (delta: 93.8 MB). Free memory was 93.1 MB in the beginning and 124.4 MB in the end (delta: -31.3 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. [2019-11-07 04:38:03,446 INFO L168 Benchmark]: Boogie Preprocessor took 220.85 ms. Allocated memory is still 232.3 MB. Free memory was 124.4 MB in the beginning and 111.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-11-07 04:38:03,447 INFO L168 Benchmark]: RCFGBuilder took 1834.63 ms. Allocated memory was 232.3 MB in the beginning and 263.2 MB in the end (delta: 30.9 MB). Free memory was 111.0 MB in the beginning and 174.6 MB in the end (delta: -63.5 MB). Peak memory consumption was 60.6 MB. Max. memory is 7.1 GB. [2019-11-07 04:38:03,448 INFO L168 Benchmark]: TraceAbstraction took 4114.43 ms. Allocated memory was 263.2 MB in the beginning and 325.6 MB in the end (delta: 62.4 MB). Free memory was 174.6 MB in the beginning and 124.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:38:03,459 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.23 ms. Allocated memory is still 138.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1299.04 ms. Allocated memory was 138.4 MB in the beginning and 232.3 MB in the end (delta: 93.8 MB). Free memory was 93.1 MB in the beginning and 124.4 MB in the end (delta: -31.3 MB). Peak memory consumption was 70.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 220.85 ms. Allocated memory is still 232.3 MB. Free memory was 124.4 MB in the beginning and 111.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1834.63 ms. Allocated memory was 232.3 MB in the beginning and 263.2 MB in the end (delta: 30.9 MB). Free memory was 111.0 MB in the beginning and 174.6 MB in the end (delta: -63.5 MB). Peak memory consumption was 60.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4114.43 ms. Allocated memory was 263.2 MB in the beginning and 325.6 MB in the end (delta: 62.4 MB). Free memory was 174.6 MB in the beginning and 124.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((1 <= this_m_conn_data_listener && 1 <= this_m_delta) && 1 <= this_m_conn) && 3 == q) || (((1 <= this_m_delta && 4 <= q) && 1 <= this_m_conn) && 0 == this_m_conn_data_listener)) || (((1 <= this_m_delta && 2 == q) && 0 == this_m_conn) && 0 == this_m_conn_data_listener)) || (((1 <= this_m_delta && 0 == this_m_conn) && q == 0) && 0 == this_m_conn_data_listener) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((1 <= this_m_delta && 4 <= q) && 1 <= this_m_conn) && 0 == this_m_conn_data_listener) || (((1 <= this_m_delta && 0 == this_m_conn) && q == 0) && 0 == this_m_conn_data_listener) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 241 locations, 1 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 4070 SDtfs, 2122 SDslu, 1797 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 85 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 14254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 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...