/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 -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:22:09,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:22:09,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:22:09,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:22:09,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:22:09,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:22:09,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:22:09,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:22:09,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:22:09,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:22:09,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:22:09,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:22:09,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:22:09,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:22:09,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:22:09,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:22:09,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:22:09,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:22:09,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:22:09,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:22:09,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:22:09,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:22:09,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:22:09,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:22:09,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:22:09,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:22:09,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:22:09,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:22:09,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:22:09,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:22:09,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:22:09,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:22:09,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:22:09,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:22:09,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:22:09,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:22:09,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:22:09,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:22:09,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:22:09,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:22:09,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:22:09,084 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-06 21:22:09,098 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:22:09,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:22:09,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:22:09,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:22:09,100 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:22:09,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:22:09,100 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:22:09,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:22:09,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:22:09,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:22:09,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:22:09,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:22:09,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:22:09,102 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:22:09,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:22:09,102 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:22:09,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:22:09,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:22:09,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:22:09,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:22:09,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:22:09,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:09,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:22:09,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:22:09,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:22:09,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:22:09,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:22:09,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:22:09,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:22:09,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:22:09,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:22:09,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:22:09,419 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:22:09,419 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:22:09,420 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-06 21:22:09,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d75b6f86/0db7ed04c3ca49028d07a50c3674de4c/FLAG4fe4a9364 [2019-11-06 21:22:09,993 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:22:09,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-06 21:22:10,002 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d75b6f86/0db7ed04c3ca49028d07a50c3674de4c/FLAG4fe4a9364 [2019-11-06 21:22:10,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d75b6f86/0db7ed04c3ca49028d07a50c3674de4c [2019-11-06 21:22:10,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:22:10,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:22:10,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:10,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:22:10,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:22:10,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad4d5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10, skipping insertion in model container [2019-11-06 21:22:10,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,405 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:22:10,456 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:22:10,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:10,687 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:22:10,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:10,821 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:22:10,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10 WrapperNode [2019-11-06 21:22:10,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:10,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:22:10,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:22:10,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:22:10,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (1/1) ... [2019-11-06 21:22:10,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:22:10,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:22:10,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:22:10,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:22:10,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (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-06 21:22:10,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:22:10,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:22:10,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:22:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:22:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:22:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:22:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:22:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:22:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:22:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:22:11,293 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:22:11,294 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:22:11,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:11 BoogieIcfgContainer [2019-11-06 21:22:11,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:22:11,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:22:11,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:22:11,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:22:11,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:10" (1/3) ... [2019-11-06 21:22:11,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2acdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:11, skipping insertion in model container [2019-11-06 21:22:11,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:10" (2/3) ... [2019-11-06 21:22:11,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c2acdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:11, skipping insertion in model container [2019-11-06 21:22:11,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:11" (3/3) ... [2019-11-06 21:22:11,303 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-11-06 21:22:11,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:22:11,327 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-06 21:22:11,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-06 21:22:11,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:22:11,366 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:22:11,366 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:22:11,366 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:22:11,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:22:11,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:22:11,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:22:11,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:22:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-11-06 21:22:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-06 21:22:11,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:11,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:11,398 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:11,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-11-06 21:22:11,413 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:11,413 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613246206] [2019-11-06 21:22:11,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:11,597 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-06 21:22:11,598 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613246206] [2019-11-06 21:22:11,599 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:11,599 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:22:11,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557786604] [2019-11-06 21:22:11,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:22:11,606 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:22:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:22:11,624 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2019-11-06 21:22:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:11,777 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2019-11-06 21:22:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:11,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-06 21:22:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:11,791 INFO L225 Difference]: With dead ends: 90 [2019-11-06 21:22:11,791 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 21:22:11,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 21:22:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-11-06 21:22:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-06 21:22:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-06 21:22:11,843 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-11-06 21:22:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:11,843 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-06 21:22:11,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:22:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-06 21:22:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:22:11,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:11,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:11,846 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-11-06 21:22:11,847 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:11,847 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322674487] [2019-11-06 21:22:11,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:11,954 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-06 21:22:11,954 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322674487] [2019-11-06 21:22:11,954 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:11,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:11,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416742150] [2019-11-06 21:22:11,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:11,957 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:11,958 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-11-06 21:22:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:12,234 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2019-11-06 21:22:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:12,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 21:22:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:12,237 INFO L225 Difference]: With dead ends: 153 [2019-11-06 21:22:12,237 INFO L226 Difference]: Without dead ends: 101 [2019-11-06 21:22:12,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-06 21:22:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-11-06 21:22:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:22:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-06 21:22:12,251 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-11-06 21:22:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:12,251 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-06 21:22:12,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-06 21:22:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:22:12,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:12,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:12,254 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-11-06 21:22:12,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:12,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787503920] [2019-11-06 21:22:12,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:12,306 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-06 21:22:12,306 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787503920] [2019-11-06 21:22:12,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:12,307 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:12,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489846351] [2019-11-06 21:22:12,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:12,308 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:12,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:12,320 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 5 states. [2019-11-06 21:22:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:12,443 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2019-11-06 21:22:12,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:12,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 21:22:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:12,445 INFO L225 Difference]: With dead ends: 75 [2019-11-06 21:22:12,446 INFO L226 Difference]: Without dead ends: 73 [2019-11-06 21:22:12,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-06 21:22:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-11-06 21:22:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 21:22:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-06 21:22:12,454 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-11-06 21:22:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:12,455 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-06 21:22:12,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-06 21:22:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:22:12,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:12,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:12,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-11-06 21:22:12,457 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:12,457 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582018166] [2019-11-06 21:22:12,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:12,525 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-06 21:22:12,525 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582018166] [2019-11-06 21:22:12,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:12,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:12,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872121696] [2019-11-06 21:22:12,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:12,527 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:12,528 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-11-06 21:22:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:12,659 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-06 21:22:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:12,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-06 21:22:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:12,661 INFO L225 Difference]: With dead ends: 96 [2019-11-06 21:22:12,661 INFO L226 Difference]: Without dead ends: 94 [2019-11-06 21:22:12,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-06 21:22:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-11-06 21:22:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:22:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-06 21:22:12,670 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-11-06 21:22:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:12,670 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-06 21:22:12,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-06 21:22:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:12,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:12,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:12,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-11-06 21:22:12,673 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:12,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624313386] [2019-11-06 21:22:12,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:12,744 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-06 21:22:12,744 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624313386] [2019-11-06 21:22:12,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:12,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:12,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610473857] [2019-11-06 21:22:12,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:12,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:12,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:12,746 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2019-11-06 21:22:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:12,974 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2019-11-06 21:22:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:12,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 21:22:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:12,977 INFO L225 Difference]: With dead ends: 95 [2019-11-06 21:22:12,977 INFO L226 Difference]: Without dead ends: 93 [2019-11-06 21:22:12,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-06 21:22:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-11-06 21:22:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:22:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-06 21:22:12,995 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-11-06 21:22:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:12,995 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-06 21:22:12,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-06 21:22:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:12,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:12,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:13,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-11-06 21:22:13,001 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:13,001 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813467125] [2019-11-06 21:22:13,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,063 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-06 21:22:13,064 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813467125] [2019-11-06 21:22:13,064 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:13,064 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:13,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451324770] [2019-11-06 21:22:13,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:13,065 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:13,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:13,066 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-06 21:22:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:13,216 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-06 21:22:13,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:13,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:22:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:13,218 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:13,218 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:13,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:13,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-11-06 21:22:13,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 21:22:13,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-06 21:22:13,226 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-11-06 21:22:13,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:13,227 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-06 21:22:13,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:13,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-06 21:22:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:13,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:13,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:13,229 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:13,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:13,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-11-06 21:22:13,230 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:13,230 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889342282] [2019-11-06 21:22:13,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,296 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-06 21:22:13,297 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889342282] [2019-11-06 21:22:13,297 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:13,297 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:13,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843013873] [2019-11-06 21:22:13,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:13,298 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:13,299 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-06 21:22:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:13,445 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2019-11-06 21:22:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:13,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-06 21:22:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:13,446 INFO L225 Difference]: With dead ends: 91 [2019-11-06 21:22:13,447 INFO L226 Difference]: Without dead ends: 89 [2019-11-06 21:22:13,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-06 21:22:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-11-06 21:22:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-06 21:22:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-06 21:22:13,454 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-11-06 21:22:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:13,454 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-06 21:22:13,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-06 21:22:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:13,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:13,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:13,456 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-11-06 21:22:13,457 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:13,457 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967104929] [2019-11-06 21:22:13,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:13,527 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967104929] [2019-11-06 21:22:13,528 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:13,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:13,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408888288] [2019-11-06 21:22:13,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:13,529 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:13,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:13,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:13,530 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 6 states. [2019-11-06 21:22:13,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:13,690 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-06 21:22:13,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:13,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:13,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:13,691 INFO L225 Difference]: With dead ends: 73 [2019-11-06 21:22:13,691 INFO L226 Difference]: Without dead ends: 71 [2019-11-06 21:22:13,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-06 21:22:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-11-06 21:22:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 21:22:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-06 21:22:13,698 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-11-06 21:22:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:13,698 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-06 21:22:13,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-06 21:22:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:13,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:13,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:13,700 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-11-06 21:22:13,701 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:13,701 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733929494] [2019-11-06 21:22:13,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,748 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-06 21:22:13,748 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733929494] [2019-11-06 21:22:13,748 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:13,748 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:13,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364623591] [2019-11-06 21:22:13,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:13,749 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:13,750 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2019-11-06 21:22:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:13,888 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-11-06 21:22:13,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:13,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:13,889 INFO L225 Difference]: With dead ends: 61 [2019-11-06 21:22:13,890 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 21:22:13,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 21:22:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-11-06 21:22:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 21:22:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-06 21:22:13,896 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-11-06 21:22:13,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:13,897 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-06 21:22:13,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-06 21:22:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:13,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:13,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:13,898 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:13,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-11-06 21:22:13,899 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:13,899 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023334999] [2019-11-06 21:22:13,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:13,955 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-06 21:22:13,956 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023334999] [2019-11-06 21:22:13,956 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:13,956 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:13,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345105094] [2019-11-06 21:22:13,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:13,958 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:13,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:13,959 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-06 21:22:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:14,052 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-11-06 21:22:14,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:22:14,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-06 21:22:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:14,062 INFO L225 Difference]: With dead ends: 61 [2019-11-06 21:22:14,062 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 21:22:14,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 21:22:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-11-06 21:22:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:22:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-06 21:22:14,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-11-06 21:22:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:14,072 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-06 21:22:14,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-06 21:22:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:22:14,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:14,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:14,075 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:14,076 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-11-06 21:22:14,076 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:14,076 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942004819] [2019-11-06 21:22:14,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:14,137 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-06 21:22:14,138 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942004819] [2019-11-06 21:22:14,138 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:14,138 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:14,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535169221] [2019-11-06 21:22:14,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:14,139 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:14,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:14,140 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-06 21:22:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:14,278 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-06 21:22:14,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:14,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 21:22:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:14,280 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:14,280 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:14,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-11-06 21:22:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 21:22:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-06 21:22:14,291 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-11-06 21:22:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:14,291 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-06 21:22:14,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-06 21:22:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:22:14,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:14,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:14,293 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-11-06 21:22:14,293 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:14,294 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93086836] [2019-11-06 21:22:14,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:22:14,376 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93086836] [2019-11-06 21:22:14,376 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:14,376 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:14,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119100790] [2019-11-06 21:22:14,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:14,377 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:14,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:14,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:14,377 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-11-06 21:22:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:14,558 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2019-11-06 21:22:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:14,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-06 21:22:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:14,560 INFO L225 Difference]: With dead ends: 74 [2019-11-06 21:22:14,560 INFO L226 Difference]: Without dead ends: 72 [2019-11-06 21:22:14,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-06 21:22:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-11-06 21:22:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 21:22:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-06 21:22:14,566 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-11-06 21:22:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:14,566 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-06 21:22:14,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:14,566 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-06 21:22:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:22:14,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:14,567 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:14,568 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-11-06 21:22:14,568 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:14,569 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359776791] [2019-11-06 21:22:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:14,625 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-06 21:22:14,625 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359776791] [2019-11-06 21:22:14,625 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:14,625 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:14,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007157409] [2019-11-06 21:22:14,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:14,626 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:14,627 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2019-11-06 21:22:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:15,058 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-06 21:22:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:15,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-06 21:22:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:15,060 INFO L225 Difference]: With dead ends: 62 [2019-11-06 21:22:15,060 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 21:22:15,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:22:15,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 21:22:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-11-06 21:22:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-06 21:22:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-06 21:22:15,066 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-11-06 21:22:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:15,066 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-06 21:22:15,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-06 21:22:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:22:15,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:15,067 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:15,068 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-11-06 21:22:15,068 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:15,069 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950854178] [2019-11-06 21:22:15,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:15,109 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-06 21:22:15,109 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950854178] [2019-11-06 21:22:15,110 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:15,110 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:15,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996399474] [2019-11-06 21:22:15,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:15,111 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:15,111 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-11-06 21:22:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:15,329 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2019-11-06 21:22:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:15,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-06 21:22:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:15,330 INFO L225 Difference]: With dead ends: 87 [2019-11-06 21:22:15,330 INFO L226 Difference]: Without dead ends: 85 [2019-11-06 21:22:15,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-06 21:22:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-11-06 21:22:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 21:22:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-06 21:22:15,335 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-11-06 21:22:15,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:15,336 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-06 21:22:15,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-06 21:22:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:22:15,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:15,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:15,337 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-11-06 21:22:15,338 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:15,338 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024551691] [2019-11-06 21:22:15,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:15,429 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-06 21:22:15,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024551691] [2019-11-06 21:22:15,429 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:15,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:15,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101719362] [2019-11-06 21:22:15,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:15,431 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:15,431 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-11-06 21:22:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:15,621 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-11-06 21:22:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:15,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-06 21:22:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:15,622 INFO L225 Difference]: With dead ends: 60 [2019-11-06 21:22:15,623 INFO L226 Difference]: Without dead ends: 58 [2019-11-06 21:22:15,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:22:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-06 21:22:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-11-06 21:22:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 21:22:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-11-06 21:22:15,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-11-06 21:22:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:15,628 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-11-06 21:22:15,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-11-06 21:22:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:22:15,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:15,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:15,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-11-06 21:22:15,630 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:15,631 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908839150] [2019-11-06 21:22:15,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:15,675 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-06 21:22:15,676 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908839150] [2019-11-06 21:22:15,676 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:15,676 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:15,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644629735] [2019-11-06 21:22:15,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:15,677 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:15,678 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2019-11-06 21:22:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:15,963 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2019-11-06 21:22:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:15,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-06 21:22:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:15,964 INFO L225 Difference]: With dead ends: 125 [2019-11-06 21:22:15,964 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:22:15,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:22:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:22:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:22:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:22:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:22:15,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-06 21:22:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:15,966 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:22:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:22:15,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:22:15,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:22:16,165 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 63 [2019-11-06 21:22:16,477 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 103 [2019-11-06 21:22:16,687 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 66 [2019-11-06 21:22:16,975 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 12 [2019-11-06 21:22:17,392 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 36 [2019-11-06 21:22:17,518 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 22 [2019-11-06 21:22:17,521 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:17,521 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_334~0 |old(~__return_334~0)|)) [2019-11-06 21:22:17,522 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:17,522 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:17,522 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:22:17,522 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:22:17,522 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:17,522 INFO L443 ceAbstractionStarter]: For program point L93(lines 93 120) no Hoare annotation was computed. [2019-11-06 21:22:17,523 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 260) no Hoare annotation was computed. [2019-11-06 21:22:17,523 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 308) no Hoare annotation was computed. [2019-11-06 21:22:17,523 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 281) no Hoare annotation was computed. [2019-11-06 21:22:17,523 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 136) no Hoare annotation was computed. [2019-11-06 21:22:17,523 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 240) no Hoare annotation was computed. [2019-11-06 21:22:17,523 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 124) no Hoare annotation was computed. [2019-11-06 21:22:17,524 INFO L439 ceAbstractionStarter]: At program point L259(lines 26 301) the Hoare annotation is: (let ((.cse3 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse4 (<= 0 main_~main__j~0))) (let ((.cse0 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) (.cse1 (= ~__return_334~0 |old(~__return_334~0)|)) (.cse2 (and (<= 1 main_~main__j~0) (let ((.cse5 (and (<= 1 main_~main__i~0) .cse4))) (or (and (not (= main_~__VERIFIER_assert__cond~12 0)) .cse5) (and .cse5 .cse3)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 (and (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__i~0) .cse0) .cse4) (and (not (= main_~__VERIFIER_assert__cond~14 0)) .cse0 .cse1 .cse2)))) [2019-11-06 21:22:17,524 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-06 21:22:17,524 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2019-11-06 21:22:17,524 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 280) no Hoare annotation was computed. [2019-11-06 21:22:17,524 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 200) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 266) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 270) no Hoare annotation was computed. [2019-11-06 21:22:17,525 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-06 21:22:17,526 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2019-11-06 21:22:17,526 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 308) no Hoare annotation was computed. [2019-11-06 21:22:17,526 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 272) no Hoare annotation was computed. [2019-11-06 21:22:17,526 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-06 21:22:17,526 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 308) the Hoare annotation is: (= ~__return_334~0 |old(~__return_334~0)|) [2019-11-06 21:22:17,526 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2019-11-06 21:22:17,526 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point L212(line 212) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 276) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 118) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 295) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 71) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-06 21:22:17,527 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2019-11-06 21:22:17,528 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 122) no Hoare annotation was computed. [2019-11-06 21:22:17,528 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 307) no Hoare annotation was computed. [2019-11-06 21:22:17,528 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 262) no Hoare annotation was computed. [2019-11-06 21:22:17,528 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-06 21:22:17,528 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 283) no Hoare annotation was computed. [2019-11-06 21:22:17,528 INFO L439 ceAbstractionStarter]: At program point L288(lines 33 289) the Hoare annotation is: (and (< main_~main__i~0 main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= ~__return_334~0 |old(~__return_334~0)|) (<= 0 main_~main__j~0)) [2019-11-06 21:22:17,529 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 264) no Hoare annotation was computed. [2019-11-06 21:22:17,529 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-06 21:22:17,529 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2019-11-06 21:22:17,529 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-06 21:22:17,529 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-06 21:22:17,529 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 268) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 289) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-06 21:22:17,530 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-11-06 21:22:17,531 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2019-11-06 21:22:17,531 INFO L443 ceAbstractionStarter]: For program point L158(lines 158 274) no Hoare annotation was computed. [2019-11-06 21:22:17,531 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2019-11-06 21:22:17,531 INFO L439 ceAbstractionStarter]: At program point L299(lines 20 307) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= ~__return_334~0 |old(~__return_334~0)|)) [2019-11-06 21:22:17,531 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-06 21:22:17,531 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 278) no Hoare annotation was computed. [2019-11-06 21:22:17,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:22:17 BoogieIcfgContainer [2019-11-06 21:22:17,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:22:17,554 INFO L168 Benchmark]: Toolchain (without parser) took 7167.74 ms. Allocated memory was 144.7 MB in the beginning and 303.0 MB in the end (delta: 158.3 MB). Free memory was 103.1 MB in the beginning and 252.8 MB in the end (delta: -149.7 MB). Peak memory consumption was 147.7 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:17,555 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 21:22:17,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 434.64 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 102.9 MB in the beginning and 180.6 MB in the end (delta: -77.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:17,560 INFO L168 Benchmark]: Boogie Preprocessor took 41.73 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:17,562 INFO L168 Benchmark]: RCFGBuilder took 430.99 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 157.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:17,566 INFO L168 Benchmark]: TraceAbstraction took 6256.03 ms. Allocated memory was 201.9 MB in the beginning and 303.0 MB in the end (delta: 101.2 MB). Free memory was 156.8 MB in the beginning and 252.8 MB in the end (delta: -95.9 MB). Peak memory consumption was 144.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:17,576 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 434.64 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 102.9 MB in the beginning and 180.6 MB in the end (delta: -77.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.73 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.99 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 157.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6256.03 ms. Allocated memory was 201.9 MB in the beginning and 303.0 MB in the end (delta: 101.2 MB). Free memory was 156.8 MB in the beginning and 252.8 MB in the end (delta: -95.9 MB). Peak memory consumption was 144.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 188]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 71]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 200]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 107]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 136]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 148]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 160]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (0 <= main__i && main__limit + 4 <= main__bufsize) && __return_334 == \old(__return_334) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((((main__limit + 4 <= main__bufsize && __return_334 == \old(__return_334)) && 1 <= main__j && ((!(__VERIFIER_assert__cond == 0) && 1 <= main__i && 0 <= main__j) || ((1 <= main__i && 0 <= main__j) && main__j + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) || ((__return_334 == \old(__return_334) && (main__i < main__len && 0 <= main__i) && main__limit + 4 <= main__bufsize) && 0 <= main__j)) || (((!(__VERIFIER_assert__cond == 0) && main__limit + 4 <= main__bufsize) && __return_334 == \old(__return_334)) && 1 <= main__j && ((!(__VERIFIER_assert__cond == 0) && 1 <= main__i && 0 <= main__j) || ((1 <= main__i && 0 <= main__j) && main__j + 4 <= main__bufsize))) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((main__i < main__len && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__limit + 4 <= main__bufsize) && __return_334 == \old(__return_334)) && 0 <= main__j - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Result: SAFE, OverallTime: 6.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 935 SDtfs, 1910 SDslu, 227 SDs, 0 SdLazy, 1420 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 157 HoareAnnotationTreeSize, 7 FomulaSimplifications, 883802412 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 50606 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 14772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...