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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:03:15,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:03:15,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:03:15,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:03:15,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:03:15,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:03:15,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:03:15,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:03:15,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:03:15,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:03:15,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:03:15,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:03:15,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:03:15,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:03:15,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:03:15,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:03:15,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:03:15,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:03:15,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:03:15,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:03:15,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:03:15,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:03:15,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:03:15,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:03:15,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:03:15,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:03:15,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:03:15,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:03:15,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:03:15,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:03:15,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:03:15,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:03:15,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:03:15,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:03:15,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:03:15,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:03:15,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:03:15,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:03:15,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:03:15,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:03:15,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:03:15,982 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:03:16,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:03:16,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:03:16,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:03:16,006 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:03:16,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:03:16,007 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:03:16,007 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:03:16,007 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:03:16,008 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:03:16,008 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:03:16,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:03:16,009 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:03:16,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:03:16,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:03:16,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:03:16,011 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:03:16,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:03:16,011 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:03:16,012 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:03:16,012 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:03:16,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:03:16,013 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:03:16,013 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:03:16,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:03:16,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:03:16,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:03:16,014 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:03:16,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:03:16,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:03:16,014 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:03:16,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:03:16,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:03:16,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:03:16,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:03:16,081 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:03:16,082 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-09-16 17:03:16,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b65c2f14/961395c29f4643d8816aeb85ad35770c/FLAGa0a4ae8f4 [2019-09-16 17:03:16,622 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:03:16,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-16 17:03:16,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b65c2f14/961395c29f4643d8816aeb85ad35770c/FLAGa0a4ae8f4 [2019-09-16 17:03:17,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b65c2f14/961395c29f4643d8816aeb85ad35770c [2019-09-16 17:03:17,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:03:17,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:03:17,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:17,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:03:17,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:03:17,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a4cde2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17, skipping insertion in model container [2019-09-16 17:03:17,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,052 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:03:17,080 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:03:17,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:17,331 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:03:17,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:03:17,470 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:03:17,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17 WrapperNode [2019-09-16 17:03:17,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:03:17,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:03:17,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:03:17,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:03:17,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (1/1) ... [2019-09-16 17:03:17,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:03:17,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:03:17,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:03:17,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:03:17,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (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-09-16 17:03:17,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:03:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:03:17,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:03:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:03:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-16 17:03:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-16 17:03:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:03:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:03:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:03:17,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:03:17,930 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:03:17,931 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-16 17:03:17,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:17 BoogieIcfgContainer [2019-09-16 17:03:17,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:03:17,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:03:17,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:03:17,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:03:17,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:03:17" (1/3) ... [2019-09-16 17:03:17,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c80b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:17, skipping insertion in model container [2019-09-16 17:03:17,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:03:17" (2/3) ... [2019-09-16 17:03:17,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c80b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:03:17, skipping insertion in model container [2019-09-16 17:03:17,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:03:17" (3/3) ... [2019-09-16 17:03:17,940 INFO L109 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2019-09-16 17:03:17,950 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:03:17,958 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-16 17:03:17,973 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-16 17:03:18,000 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:03:18,000 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:03:18,000 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:03:18,000 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:03:18,001 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:03:18,001 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:03:18,001 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:03:18,001 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:03:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-09-16 17:03:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-16 17:03:18,026 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:18,027 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:18,029 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:18,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1118366569, now seen corresponding path program 1 times [2019-09-16 17:03:18,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:18,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:18,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:03:18,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:18,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:03:18,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:03:18,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:18,215 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-09-16 17:03:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:18,252 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2019-09-16 17:03:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:03:18,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-16 17:03:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:18,266 INFO L225 Difference]: With dead ends: 82 [2019-09-16 17:03:18,267 INFO L226 Difference]: Without dead ends: 76 [2019-09-16 17:03:18,271 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:03:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-16 17:03:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-16 17:03:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-16 17:03:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-16 17:03:18,329 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2019-09-16 17:03:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:18,330 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-16 17:03:18,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:03:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-16 17:03:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 17:03:18,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:18,332 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:18,334 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -306453431, now seen corresponding path program 1 times [2019-09-16 17:03:18,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:18,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:18,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:18,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:18,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:18,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:18,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:18,451 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-16 17:03:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:18,568 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-09-16 17:03:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:18,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-16 17:03:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:18,571 INFO L225 Difference]: With dead ends: 101 [2019-09-16 17:03:18,572 INFO L226 Difference]: Without dead ends: 101 [2019-09-16 17:03:18,573 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-16 17:03:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-09-16 17:03:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-16 17:03:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-09-16 17:03:18,582 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2019-09-16 17:03:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:18,582 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-09-16 17:03:18,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-09-16 17:03:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-16 17:03:18,584 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:18,584 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:18,585 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:18,585 INFO L82 PathProgramCache]: Analyzing trace with hash -309622200, now seen corresponding path program 1 times [2019-09-16 17:03:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:18,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:18,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:18,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:18,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:18,660 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-09-16 17:03:18,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:18,759 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2019-09-16 17:03:18,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:18,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-16 17:03:18,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:18,761 INFO L225 Difference]: With dead ends: 73 [2019-09-16 17:03:18,761 INFO L226 Difference]: Without dead ends: 73 [2019-09-16 17:03:18,762 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-16 17:03:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2019-09-16 17:03:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-16 17:03:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-09-16 17:03:18,768 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2019-09-16 17:03:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:18,769 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-09-16 17:03:18,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-09-16 17:03:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-16 17:03:18,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:18,773 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:18,774 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:18,774 INFO L82 PathProgramCache]: Analyzing trace with hash -910118681, now seen corresponding path program 1 times [2019-09-16 17:03:18,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:18,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:18,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:18,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:18,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:18,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:18,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:18,837 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2019-09-16 17:03:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:18,938 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2019-09-16 17:03:18,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:18,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-16 17:03:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:18,940 INFO L225 Difference]: With dead ends: 94 [2019-09-16 17:03:18,940 INFO L226 Difference]: Without dead ends: 94 [2019-09-16 17:03:18,941 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-16 17:03:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2019-09-16 17:03:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-16 17:03:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-09-16 17:03:18,948 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-09-16 17:03:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:18,948 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-09-16 17:03:18,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-09-16 17:03:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:18,949 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:18,949 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:18,950 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1851095055, now seen corresponding path program 1 times [2019-09-16 17:03:18,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:18,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:18,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:19,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:19,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:19,009 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-09-16 17:03:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,155 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2019-09-16 17:03:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:03:19,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-16 17:03:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,160 INFO L225 Difference]: With dead ends: 93 [2019-09-16 17:03:19,160 INFO L226 Difference]: Without dead ends: 93 [2019-09-16 17:03:19,161 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-16 17:03:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-16 17:03:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2019-09-16 17:03:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-16 17:03:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-09-16 17:03:19,174 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-09-16 17:03:19,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,176 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-09-16 17:03:19,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-09-16 17:03:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-16 17:03:19,177 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,177 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:19,178 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1194066488, now seen corresponding path program 1 times [2019-09-16 17:03:19,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:19,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:19,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:19,250 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2019-09-16 17:03:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,316 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-16 17:03:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:19,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-16 17:03:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,318 INFO L225 Difference]: With dead ends: 67 [2019-09-16 17:03:19,318 INFO L226 Difference]: Without dead ends: 67 [2019-09-16 17:03:19,319 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-16 17:03:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-09-16 17:03:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-16 17:03:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-09-16 17:03:19,323 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-09-16 17:03:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,324 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-09-16 17:03:19,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-09-16 17:03:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:03:19,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,325 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:19,326 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1549374957, now seen corresponding path program 1 times [2019-09-16 17:03:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:19,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:19,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:19,365 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2019-09-16 17:03:19,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,444 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-09-16 17:03:19,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:19,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-09-16 17:03:19,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,446 INFO L225 Difference]: With dead ends: 89 [2019-09-16 17:03:19,446 INFO L226 Difference]: Without dead ends: 89 [2019-09-16 17:03:19,446 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-16 17:03:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2019-09-16 17:03:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-16 17:03:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-09-16 17:03:19,450 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2019-09-16 17:03:19,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,451 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-09-16 17:03:19,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-09-16 17:03:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:03:19,452 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,452 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:19,453 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1638647651, now seen corresponding path program 1 times [2019-09-16 17:03:19,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:19,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:19,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:19,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:19,516 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-09-16 17:03:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,653 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2019-09-16 17:03:19,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:19,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-16 17:03:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,655 INFO L225 Difference]: With dead ends: 71 [2019-09-16 17:03:19,655 INFO L226 Difference]: Without dead ends: 71 [2019-09-16 17:03:19,656 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-09-16 17:03:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-16 17:03:19,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2019-09-16 17:03:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 17:03:19,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-09-16 17:03:19,667 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2019-09-16 17:03:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,668 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-09-16 17:03:19,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-09-16 17:03:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:03:19,669 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,669 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:19,670 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash -741527250, now seen corresponding path program 1 times [2019-09-16 17:03:19,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:19,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:19,761 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-09-16 17:03:19,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,837 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-16 17:03:19,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:03:19,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-16 17:03:19,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,839 INFO L225 Difference]: With dead ends: 59 [2019-09-16 17:03:19,839 INFO L226 Difference]: Without dead ends: 59 [2019-09-16 17:03:19,839 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-16 17:03:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-16 17:03:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2019-09-16 17:03:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-16 17:03:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-16 17:03:19,846 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2019-09-16 17:03:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,846 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-16 17:03:19,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-16 17:03:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:03:19,851 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,852 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:19,853 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1512505143, now seen corresponding path program 1 times [2019-09-16 17:03:19,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:19,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:19,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:19,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:19,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:19,919 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2019-09-16 17:03:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:19,982 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2019-09-16 17:03:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:03:19,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-09-16 17:03:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:19,984 INFO L225 Difference]: With dead ends: 59 [2019-09-16 17:03:19,984 INFO L226 Difference]: Without dead ends: 59 [2019-09-16 17:03:19,985 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:19,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-16 17:03:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-09-16 17:03:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-16 17:03:19,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-16 17:03:19,988 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2019-09-16 17:03:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:19,988 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-16 17:03:19,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-16 17:03:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:03:19,989 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:19,989 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:03:19,990 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:19,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash 356983956, now seen corresponding path program 1 times [2019-09-16 17:03:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:19,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:20,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:03:20,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:03:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:03:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:03:20,049 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-09-16 17:03:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,103 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2019-09-16 17:03:20,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:20,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-16 17:03:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,105 INFO L225 Difference]: With dead ends: 67 [2019-09-16 17:03:20,105 INFO L226 Difference]: Without dead ends: 67 [2019-09-16 17:03:20,105 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-16 17:03:20,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2019-09-16 17:03:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-16 17:03:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-16 17:03:20,108 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2019-09-16 17:03:20,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,108 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-16 17:03:20,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:03:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-16 17:03:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:03:20,109 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:20,110 INFO L407 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-09-16 17:03:20,110 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1818396113, now seen corresponding path program 1 times [2019-09-16 17:03:20,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:20,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:20,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:20,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:20,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:20,152 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-09-16 17:03:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,250 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2019-09-16 17:03:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:03:20,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-16 17:03:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,252 INFO L225 Difference]: With dead ends: 72 [2019-09-16 17:03:20,252 INFO L226 Difference]: Without dead ends: 72 [2019-09-16 17:03:20,253 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-16 17:03:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-09-16 17:03:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-16 17:03:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-09-16 17:03:20,257 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2019-09-16 17:03:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,259 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-09-16 17:03:20,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-09-16 17:03:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:03:20,260 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:20,260 INFO L407 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-09-16 17:03:20,262 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash -535701510, now seen corresponding path program 1 times [2019-09-16 17:03:20,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:20,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:20,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:20,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:20,342 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2019-09-16 17:03:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,484 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-09-16 17:03:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:03:20,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-16 17:03:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,485 INFO L225 Difference]: With dead ends: 60 [2019-09-16 17:03:20,485 INFO L226 Difference]: Without dead ends: 60 [2019-09-16 17:03:20,486 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:03:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-16 17:03:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-09-16 17:03:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-09-16 17:03:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-09-16 17:03:20,488 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2019-09-16 17:03:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,488 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-09-16 17:03:20,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-09-16 17:03:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:03:20,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:20,490 INFO L407 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-09-16 17:03:20,490 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash 573125525, now seen corresponding path program 1 times [2019-09-16 17:03:20,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:20,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:20,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:20,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:03:20,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:03:20,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:03:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:03:20,533 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-09-16 17:03:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,624 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-16 17:03:20,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:03:20,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-16 17:03:20,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,626 INFO L225 Difference]: With dead ends: 85 [2019-09-16 17:03:20,626 INFO L226 Difference]: Without dead ends: 85 [2019-09-16 17:03:20,626 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:03:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-09-16 17:03:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2019-09-16 17:03:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 17:03:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-16 17:03:20,629 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2019-09-16 17:03:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,629 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-16 17:03:20,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:03:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-16 17:03:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:03:20,630 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:20,630 INFO L407 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-09-16 17:03:20,631 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash 587025248, now seen corresponding path program 1 times [2019-09-16 17:03:20,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:20,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:20,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:20,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:20,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:20,685 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-09-16 17:03:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:20,814 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-09-16 17:03:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:03:20,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-09-16 17:03:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:20,816 INFO L225 Difference]: With dead ends: 58 [2019-09-16 17:03:20,816 INFO L226 Difference]: Without dead ends: 58 [2019-09-16 17:03:20,817 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:03:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-16 17:03:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2019-09-16 17:03:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-16 17:03:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-16 17:03:20,819 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2019-09-16 17:03:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:20,820 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-16 17:03:20,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-16 17:03:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:03:20,821 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:03:20,821 INFO L407 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-09-16 17:03:20,821 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:03:20,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:03:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1017916667, now seen corresponding path program 1 times [2019-09-16 17:03:20,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:03:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:03:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:03:20,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:03:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:03:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:03:20,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:03:20,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:03:20,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:03:20,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:03:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:03:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:03:20,873 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-16 17:03:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:03:21,022 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2019-09-16 17:03:21,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:03:21,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-09-16 17:03:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:03:21,023 INFO L225 Difference]: With dead ends: 123 [2019-09-16 17:03:21,023 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:03:21,024 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:03:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:03:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:03:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:03:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:03:21,025 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-16 17:03:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:03:21,025 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:03:21,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:03:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:03:21,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:03:21,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:03:21 BoogieIcfgContainer [2019-09-16 17:03:21,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:03:21,034 INFO L168 Benchmark]: Toolchain (without parser) took 3998.73 ms. Allocated memory was 132.6 MB in the beginning and 261.1 MB in the end (delta: 128.5 MB). Free memory was 89.1 MB in the beginning and 145.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 72.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:21,035 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-16 17:03:21,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.43 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 175.1 MB in the end (delta: -86.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:21,037 INFO L168 Benchmark]: Boogie Preprocessor took 33.05 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 173.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:21,038 INFO L168 Benchmark]: RCFGBuilder took 427.22 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 152.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:21,039 INFO L168 Benchmark]: TraceAbstraction took 3098.15 ms. Allocated memory was 199.8 MB in the beginning and 261.1 MB in the end (delta: 61.3 MB). Free memory was 152.1 MB in the beginning and 145.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 68.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:03:21,043 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.18 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.43 ms. Allocated memory was 132.6 MB in the beginning and 199.8 MB in the end (delta: 67.1 MB). Free memory was 88.9 MB in the beginning and 175.1 MB in the end (delta: -86.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.05 ms. Allocated memory is still 199.8 MB. Free memory was 175.1 MB in the beginning and 173.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.22 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 152.1 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3098.15 ms. Allocated memory was 199.8 MB in the beginning and 261.1 MB in the end (delta: 61.3 MB). Free memory was 152.1 MB in the beginning and 145.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 68.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: 95]: 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: 54]: 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: 240]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 42]: 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: 107]: 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: 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: 224]: 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: 160]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. SAFE Result, 3.0s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 936 SDtfs, 1252 SDslu, 802 SDs, 0 SdLazy, 796 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 13104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...