/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:03:43,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:03:43,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:03:43,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:03:43,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:03:43,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:03:43,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:03:43,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:03:43,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:03:43,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:03:43,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:03:43,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:03:43,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:03:43,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:03:43,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:03:43,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:03:43,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:03:43,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:03:43,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:03:43,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:03:43,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:03:43,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:03:43,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:03:44,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:03:44,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:03:44,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:03:44,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:03:44,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:03:44,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:03:44,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:03:44,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:03:44,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:03:44,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:03:44,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:03:44,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:03:44,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:03:44,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:03:44,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:03:44,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:03:44,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:03:44,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:03:44,013 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 01:03:44,028 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:03:44,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:03:44,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:03:44,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:03:44,030 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:03:44,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:03:44,030 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:03:44,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:03:44,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:03:44,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:03:44,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:03:44,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:03:44,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:03:44,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:03:44,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:03:44,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:03:44,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:03:44,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:03:44,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:03:44,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:03:44,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:03:44,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:03:44,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:03:44,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:03:44,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:03:44,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:03:44,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:03:44,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:03:44,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 01:03:44,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:03:44,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:03:44,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:03:44,333 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:03:44,333 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:03:44,334 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 01:03:44,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2681c37bd/3566f230dc85467bba094d891ade46f5/FLAG4446bf4b2 [2019-11-07 01:03:45,128 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:03:45,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-11-07 01:03:45,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2681c37bd/3566f230dc85467bba094d891ade46f5/FLAG4446bf4b2 [2019-11-07 01:03:45,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2681c37bd/3566f230dc85467bba094d891ade46f5 [2019-11-07 01:03:45,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:03:45,275 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:03:45,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:03:45,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:03:45,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:03:45,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:45" (1/1) ... [2019-11-07 01:03:45,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382a1c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:45, skipping insertion in model container [2019-11-07 01:03:45,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:45" (1/1) ... [2019-11-07 01:03:45,294 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:03:45,409 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:03:46,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:03:46,220 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:03:46,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:03:46,549 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:03:46,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46 WrapperNode [2019-11-07 01:03:46,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:03:46,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:03:46,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:03:46,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:03:46,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (1/1) ... [2019-11-07 01:03:46,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:03:46,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:03:46,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:03:46,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:03:46,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (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 01:03:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:03:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:03:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:03:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 01:03:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:03:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:03:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:03:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:03:48,624 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:03:48,624 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-07 01:03:48,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:48 BoogieIcfgContainer [2019-11-07 01:03:48,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:03:48,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:03:48,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:03:48,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:03:48,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:03:45" (1/3) ... [2019-11-07 01:03:48,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb71e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:48, skipping insertion in model container [2019-11-07 01:03:48,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:46" (2/3) ... [2019-11-07 01:03:48,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb71e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:48, skipping insertion in model container [2019-11-07 01:03:48,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:48" (3/3) ... [2019-11-07 01:03:48,642 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-11-07 01:03:48,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:03:48,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 01:03:48,681 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 01:03:48,720 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:03:48,721 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:03:48,721 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:03:48,721 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:03:48,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:03:48,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:03:48,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:03:48,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:03:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2019-11-07 01:03:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 01:03:48,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:48,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:48,777 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash -358841446, now seen corresponding path program 1 times [2019-11-07 01:03:48,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:48,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584218568] [2019-11-07 01:03:48,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:48,981 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 01:03:48,982 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584218568] [2019-11-07 01:03:48,983 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:48,983 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 01:03:48,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738034502] [2019-11-07 01:03:48,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 01:03:48,991 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 01:03:49,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 01:03:49,009 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 2 states. [2019-11-07 01:03:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:49,083 INFO L93 Difference]: Finished difference Result 469 states and 916 transitions. [2019-11-07 01:03:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 01:03:49,086 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-11-07 01:03:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:49,102 INFO L225 Difference]: With dead ends: 469 [2019-11-07 01:03:49,102 INFO L226 Difference]: Without dead ends: 228 [2019-11-07 01:03:49,107 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 01:03:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-07 01:03:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-11-07 01:03:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-11-07 01:03:49,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 397 transitions. [2019-11-07 01:03:49,174 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 397 transitions. Word has length 13 [2019-11-07 01:03:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:49,176 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 397 transitions. [2019-11-07 01:03:49,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 01:03:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 397 transitions. [2019-11-07 01:03:49,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 01:03:49,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:49,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:49,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash -2001683715, now seen corresponding path program 1 times [2019-11-07 01:03:49,179 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:49,179 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302707937] [2019-11-07 01:03:49,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:49,242 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 01:03:49,242 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302707937] [2019-11-07 01:03:49,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:49,244 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:49,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869915720] [2019-11-07 01:03:49,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:49,246 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:49,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:49,247 INFO L87 Difference]: Start difference. First operand 228 states and 397 transitions. Second operand 3 states. [2019-11-07 01:03:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:49,387 INFO L93 Difference]: Finished difference Result 453 states and 792 transitions. [2019-11-07 01:03:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:49,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-07 01:03:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:49,391 INFO L225 Difference]: With dead ends: 453 [2019-11-07 01:03:49,391 INFO L226 Difference]: Without dead ends: 231 [2019-11-07 01:03:49,393 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 01:03:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-07 01:03:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-11-07 01:03:49,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-07 01:03:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 400 transitions. [2019-11-07 01:03:49,410 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 400 transitions. Word has length 14 [2019-11-07 01:03:49,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:49,410 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 400 transitions. [2019-11-07 01:03:49,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 400 transitions. [2019-11-07 01:03:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 01:03:49,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:49,412 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:03:49,412 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash 912246429, now seen corresponding path program 1 times [2019-11-07 01:03:49,413 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:49,413 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357561496] [2019-11-07 01:03:49,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:49,501 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 01:03:49,502 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357561496] [2019-11-07 01:03:49,502 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:49,502 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:49,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527729570] [2019-11-07 01:03:49,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:49,503 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:49,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:49,504 INFO L87 Difference]: Start difference. First operand 231 states and 400 transitions. Second operand 3 states. [2019-11-07 01:03:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:49,619 INFO L93 Difference]: Finished difference Result 440 states and 773 transitions. [2019-11-07 01:03:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:49,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 01:03:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:49,621 INFO L225 Difference]: With dead ends: 440 [2019-11-07 01:03:49,621 INFO L226 Difference]: Without dead ends: 216 [2019-11-07 01:03:49,623 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 01:03:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-07 01:03:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-07 01:03:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-07 01:03:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-07 01:03:49,641 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 19 [2019-11-07 01:03:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:49,641 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-07 01:03:49,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-07 01:03:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 01:03:49,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:49,643 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 01:03:49,643 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:49,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1491178682, now seen corresponding path program 1 times [2019-11-07 01:03:49,645 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:49,645 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637965608] [2019-11-07 01:03:49,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:49,727 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 01:03:49,727 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637965608] [2019-11-07 01:03:49,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:49,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:49,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232166237] [2019-11-07 01:03:49,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:49,729 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:49,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:49,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:49,730 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-11-07 01:03:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:50,096 INFO L93 Difference]: Finished difference Result 618 states and 1102 transitions. [2019-11-07 01:03:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:50,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-07 01:03:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:50,100 INFO L225 Difference]: With dead ends: 618 [2019-11-07 01:03:50,100 INFO L226 Difference]: Without dead ends: 410 [2019-11-07 01:03:50,101 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 01:03:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-07 01:03:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 404. [2019-11-07 01:03:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-11-07 01:03:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 722 transitions. [2019-11-07 01:03:50,126 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 722 transitions. Word has length 22 [2019-11-07 01:03:50,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:50,126 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 722 transitions. [2019-11-07 01:03:50,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 722 transitions. [2019-11-07 01:03:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 01:03:50,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:50,132 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] [2019-11-07 01:03:50,132 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:50,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:50,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1582631867, now seen corresponding path program 1 times [2019-11-07 01:03:50,133 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:50,134 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080957113] [2019-11-07 01:03:50,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,206 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 01:03:50,207 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080957113] [2019-11-07 01:03:50,207 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:50,207 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:50,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690987500] [2019-11-07 01:03:50,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:50,208 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:50,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:50,209 INFO L87 Difference]: Start difference. First operand 404 states and 722 transitions. Second operand 3 states. [2019-11-07 01:03:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:50,332 INFO L93 Difference]: Finished difference Result 640 states and 1134 transitions. [2019-11-07 01:03:50,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:50,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 01:03:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:50,334 INFO L225 Difference]: With dead ends: 640 [2019-11-07 01:03:50,335 INFO L226 Difference]: Without dead ends: 248 [2019-11-07 01:03:50,336 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 01:03:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-07 01:03:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2019-11-07 01:03:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-07 01:03:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 422 transitions. [2019-11-07 01:03:50,344 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 422 transitions. Word has length 23 [2019-11-07 01:03:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:50,345 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 422 transitions. [2019-11-07 01:03:50,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 422 transitions. [2019-11-07 01:03:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 01:03:50,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:50,346 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] [2019-11-07 01:03:50,346 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:50,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1006681014, now seen corresponding path program 1 times [2019-11-07 01:03:50,347 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:50,347 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599143637] [2019-11-07 01:03:50,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,378 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 01:03:50,378 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599143637] [2019-11-07 01:03:50,378 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:50,379 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:50,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325922533] [2019-11-07 01:03:50,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:50,379 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:50,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:50,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:50,380 INFO L87 Difference]: Start difference. First operand 246 states and 422 transitions. Second operand 3 states. [2019-11-07 01:03:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:50,532 INFO L93 Difference]: Finished difference Result 248 states and 423 transitions. [2019-11-07 01:03:50,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:50,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-07 01:03:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:50,534 INFO L225 Difference]: With dead ends: 248 [2019-11-07 01:03:50,534 INFO L226 Difference]: Without dead ends: 246 [2019-11-07 01:03:50,535 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 01:03:50,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-07 01:03:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2019-11-07 01:03:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-07 01:03:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 414 transitions. [2019-11-07 01:03:50,548 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 414 transitions. Word has length 23 [2019-11-07 01:03:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:50,548 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 414 transitions. [2019-11-07 01:03:50,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 414 transitions. [2019-11-07 01:03:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 01:03:50,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:50,550 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, 1] [2019-11-07 01:03:50,550 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1124944987, now seen corresponding path program 1 times [2019-11-07 01:03:50,551 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:50,551 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504089905] [2019-11-07 01:03:50,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:50,632 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 01:03:50,633 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504089905] [2019-11-07 01:03:50,635 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:50,635 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:50,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124547048] [2019-11-07 01:03:50,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:50,636 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:50,638 INFO L87 Difference]: Start difference. First operand 246 states and 414 transitions. Second operand 3 states. [2019-11-07 01:03:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:51,121 INFO L93 Difference]: Finished difference Result 653 states and 1108 transitions. [2019-11-07 01:03:51,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:51,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-07 01:03:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:51,126 INFO L225 Difference]: With dead ends: 653 [2019-11-07 01:03:51,127 INFO L226 Difference]: Without dead ends: 415 [2019-11-07 01:03:51,128 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 01:03:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-11-07 01:03:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 402. [2019-11-07 01:03:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-11-07 01:03:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 614 transitions. [2019-11-07 01:03:51,144 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 614 transitions. Word has length 26 [2019-11-07 01:03:51,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:51,146 INFO L462 AbstractCegarLoop]: Abstraction has 402 states and 614 transitions. [2019-11-07 01:03:51,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 614 transitions. [2019-11-07 01:03:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-07 01:03:51,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:51,151 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, 1] [2019-11-07 01:03:51,152 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1803598039, now seen corresponding path program 1 times [2019-11-07 01:03:51,152 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:51,152 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889599943] [2019-11-07 01:03:51,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:51,212 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 01:03:51,212 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889599943] [2019-11-07 01:03:51,212 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:51,212 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:51,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257077925] [2019-11-07 01:03:51,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:51,213 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:51,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:51,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:51,214 INFO L87 Difference]: Start difference. First operand 402 states and 614 transitions. Second operand 3 states. [2019-11-07 01:03:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:51,267 INFO L93 Difference]: Finished difference Result 733 states and 1129 transitions. [2019-11-07 01:03:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:51,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-07 01:03:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:51,270 INFO L225 Difference]: With dead ends: 733 [2019-11-07 01:03:51,270 INFO L226 Difference]: Without dead ends: 343 [2019-11-07 01:03:51,271 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 01:03:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-07 01:03:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-11-07 01:03:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-07 01:03:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2019-11-07 01:03:51,280 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 36 [2019-11-07 01:03:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:51,280 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2019-11-07 01:03:51,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2019-11-07 01:03:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 01:03:51,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:51,282 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] [2019-11-07 01:03:51,282 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1771198676, now seen corresponding path program 1 times [2019-11-07 01:03:51,283 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:51,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134384708] [2019-11-07 01:03:51,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:51,315 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 01:03:51,315 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134384708] [2019-11-07 01:03:51,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:51,316 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:51,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737745234] [2019-11-07 01:03:51,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:51,317 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:51,318 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand 3 states. [2019-11-07 01:03:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:51,419 INFO L93 Difference]: Finished difference Result 668 states and 1033 transitions. [2019-11-07 01:03:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:51,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-07 01:03:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:51,423 INFO L225 Difference]: With dead ends: 668 [2019-11-07 01:03:51,423 INFO L226 Difference]: Without dead ends: 337 [2019-11-07 01:03:51,425 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 01:03:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-11-07 01:03:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-11-07 01:03:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-11-07 01:03:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 506 transitions. [2019-11-07 01:03:51,436 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 506 transitions. Word has length 37 [2019-11-07 01:03:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:51,437 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 506 transitions. [2019-11-07 01:03:51,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 506 transitions. [2019-11-07 01:03:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 01:03:51,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:51,439 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 01:03:51,439 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:51,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:51,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2025838196, now seen corresponding path program 1 times [2019-11-07 01:03:51,440 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:51,440 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828935877] [2019-11-07 01:03:51,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:51,556 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 01:03:51,556 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828935877] [2019-11-07 01:03:51,557 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:51,557 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 01:03:51,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975741596] [2019-11-07 01:03:51,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 01:03:51,557 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:51,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 01:03:51,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 01:03:51,558 INFO L87 Difference]: Start difference. First operand 337 states and 506 transitions. Second operand 4 states. [2019-11-07 01:03:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:51,987 INFO L93 Difference]: Finished difference Result 380 states and 547 transitions. [2019-11-07 01:03:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:51,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-07 01:03:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:51,991 INFO L225 Difference]: With dead ends: 380 [2019-11-07 01:03:51,992 INFO L226 Difference]: Without dead ends: 343 [2019-11-07 01:03:51,992 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 01:03:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-07 01:03:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2019-11-07 01:03:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-11-07 01:03:52,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 470 transitions. [2019-11-07 01:03:52,009 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 470 transitions. Word has length 41 [2019-11-07 01:03:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:52,014 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 470 transitions. [2019-11-07 01:03:52,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 01:03:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2019-11-07 01:03:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 01:03:52,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:52,016 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 01:03:52,019 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash -197451388, now seen corresponding path program 1 times [2019-11-07 01:03:52,019 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:52,019 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50314869] [2019-11-07 01:03:52,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:52,079 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 01:03:52,079 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50314869] [2019-11-07 01:03:52,079 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:52,080 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:52,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977907719] [2019-11-07 01:03:52,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:52,081 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:52,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:52,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:52,081 INFO L87 Difference]: Start difference. First operand 337 states and 470 transitions. Second operand 3 states. [2019-11-07 01:03:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:52,126 INFO L93 Difference]: Finished difference Result 639 states and 892 transitions. [2019-11-07 01:03:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:52,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-07 01:03:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:52,130 INFO L225 Difference]: With dead ends: 639 [2019-11-07 01:03:52,130 INFO L226 Difference]: Without dead ends: 314 [2019-11-07 01:03:52,131 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 01:03:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-07 01:03:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-11-07 01:03:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-11-07 01:03:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 433 transitions. [2019-11-07 01:03:52,140 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 433 transitions. Word has length 42 [2019-11-07 01:03:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:52,140 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 433 transitions. [2019-11-07 01:03:52,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 433 transitions. [2019-11-07 01:03:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 01:03:52,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:03:52,141 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, 1] [2019-11-07 01:03:52,142 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:03:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:03:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1099613084, now seen corresponding path program 1 times [2019-11-07 01:03:52,143 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:03:52,143 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430897579] [2019-11-07 01:03:52,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:03:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:03:52,189 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 01:03:52,190 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430897579] [2019-11-07 01:03:52,190 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:03:52,190 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:03:52,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095990980] [2019-11-07 01:03:52,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:03:52,191 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:03:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:03:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:03:52,192 INFO L87 Difference]: Start difference. First operand 314 states and 433 transitions. Second operand 3 states. [2019-11-07 01:03:52,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:03:52,231 INFO L93 Difference]: Finished difference Result 478 states and 669 transitions. [2019-11-07 01:03:52,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:03:52,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-07 01:03:52,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:03:52,233 INFO L225 Difference]: With dead ends: 478 [2019-11-07 01:03:52,233 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 01:03:52,234 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 01:03:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 01:03:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 01:03:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 01:03:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 01:03:52,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-11-07 01:03:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:03:52,235 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 01:03:52,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:03:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 01:03:52,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 01:03:52,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 01:03:52,386 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:03:52,386 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:03:52,386 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:03:52,386 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 01:03:52,387 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 1255) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-11-07 01:03:52,387 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-11-07 01:03:52,388 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-11-07 01:03:52,389 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-11-07 01:03:52,389 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-11-07 01:03:52,389 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-11-07 01:03:52,389 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-11-07 01:03:52,389 INFO L443 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-11-07 01:03:52,390 INFO L443 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-11-07 01:03:52,391 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-11-07 01:03:52,392 INFO L439 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-11-07 01:03:52,393 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-11-07 01:03:52,394 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-11-07 01:03:52,395 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-11-07 01:03:52,395 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 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-11-07 01:03:52,396 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-11-07 01:03:52,397 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-11-07 01:03:52,397 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-11-07 01:03:52,398 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-11-07 01:03:52,399 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-11-07 01:03:52,400 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-11-07 01:03:52,401 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 16 1255) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-11-07 01:03:52,402 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-11-07 01:03:52,403 INFO L443 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-11-07 01:03:52,404 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-11-07 01:03:52,404 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-11-07 01:03:52,404 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-11-07 01:03:52,404 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-11-07 01:03:52,405 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-11-07 01:03:52,406 INFO L443 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-11-07 01:03:52,407 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-11-07 01:03:52,407 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-11-07 01:03:52,407 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-11-07 01:03:52,408 INFO L443 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-11-07 01:03:52,409 INFO L443 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-11-07 01:03:52,410 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 16 1255) the Hoare annotation is: true [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-11-07 01:03:52,411 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-11-07 01:03:52,412 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 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-11-07 01:03:52,412 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-11-07 01:03:52,413 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-11-07 01:03:52,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:03:52 BoogieIcfgContainer [2019-11-07 01:03:52,430 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 01:03:52,433 INFO L168 Benchmark]: Toolchain (without parser) took 7156.38 ms. Allocated memory was 143.7 MB in the beginning and 332.4 MB in the end (delta: 188.7 MB). Free memory was 90.5 MB in the beginning and 147.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 131.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:03:52,433 INFO L168 Benchmark]: CDTParser took 1.10 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-07 01:03:52,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1272.88 ms. Allocated memory was 143.7 MB in the beginning and 227.0 MB in the end (delta: 83.4 MB). Free memory was 90.3 MB in the beginning and 107.9 MB in the end (delta: -17.6 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2019-11-07 01:03:52,435 INFO L168 Benchmark]: Boogie Preprocessor took 196.15 ms. Allocated memory is still 227.0 MB. Free memory was 107.9 MB in the beginning and 94.0 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:03:52,436 INFO L168 Benchmark]: RCFGBuilder took 1879.01 ms. Allocated memory was 227.0 MB in the beginning and 263.7 MB in the end (delta: 36.7 MB). Free memory was 94.0 MB in the beginning and 166.6 MB in the end (delta: -72.6 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:03:52,437 INFO L168 Benchmark]: TraceAbstraction took 3802.58 ms. Allocated memory was 263.7 MB in the beginning and 332.4 MB in the end (delta: 68.7 MB). Free memory was 166.6 MB in the beginning and 147.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 87.9 MB. Max. memory is 7.1 GB. [2019-11-07 01:03:52,442 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1272.88 ms. Allocated memory was 143.7 MB in the beginning and 227.0 MB in the end (delta: 83.4 MB). Free memory was 90.3 MB in the beginning and 107.9 MB in the end (delta: -17.6 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 196.15 ms. Allocated memory is still 227.0 MB. Free memory was 107.9 MB in the beginning and 94.0 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1879.01 ms. Allocated memory was 227.0 MB in the beginning and 263.7 MB in the end (delta: 36.7 MB). Free memory was 94.0 MB in the beginning and 166.6 MB in the end (delta: -72.6 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3802.58 ms. Allocated memory was 263.7 MB in the beginning and 332.4 MB in the end (delta: 68.7 MB). Free memory was 166.6 MB in the beginning and 147.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 87.9 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, 242 locations, 1 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 4082 SDtfs, 2122 SDslu, 1809 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s 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=404occurred 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.1s 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, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 15057 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...