java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:49:32,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:49:32,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:49:32,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:49:32,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:49:32,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:49:32,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:49:32,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:49:32,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:49:32,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:49:32,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:49:32,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:49:32,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:49:32,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:49:32,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:49:32,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:49:32,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:49:32,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:49:32,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:49:32,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:49:32,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:49:32,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:49:32,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:49:32,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:49:32,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:49:32,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:49:32,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:49:32,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:49:32,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:49:32,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:49:32,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:49:32,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:49:32,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:49:32,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:49:32,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:49:32,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:49:32,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:49:32,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:49:32,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:49:32,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:49:32,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:49:32,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:49:33,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:49:33,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:49:33,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:49:33,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:49:33,008 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:49:33,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:49:33,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:49:33,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:49:33,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:49:33,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:49:33,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:49:33,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:49:33,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:49:33,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:49:33,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:49:33,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:49:33,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:49:33,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:49:33,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:49:33,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:49:33,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:49:33,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:33,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:49:33,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:49:33,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:49:33,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:49:33,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:49:33,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:49:33,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:49:33,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:49:33,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:49:33,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:49:33,063 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:49:33,063 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:49:33,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-03 19:49:33,123 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11819589d/3b5264456bff4866939ac85adce7bba8/FLAGcb3afe777 [2019-09-03 19:49:33,587 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:49:33,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-09-03 19:49:33,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11819589d/3b5264456bff4866939ac85adce7bba8/FLAGcb3afe777 [2019-09-03 19:49:33,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11819589d/3b5264456bff4866939ac85adce7bba8 [2019-09-03 19:49:33,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:49:33,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:49:33,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:33,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:49:33,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:49:33,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:33" (1/1) ... [2019-09-03 19:49:33,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db0e7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:33, skipping insertion in model container [2019-09-03 19:49:33,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:49:33" (1/1) ... [2019-09-03 19:49:33,967 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:49:34,007 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:49:34,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:34,192 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:49:34,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:49:34,366 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:49:34,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34 WrapperNode [2019-09-03 19:49:34,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:49:34,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:49:34,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:49:34,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:49:34,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... [2019-09-03 19:49:34,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:49:34,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:49:34,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:49:34,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:49:34,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:49:34,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:49:34,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:49:34,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:49:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:49:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:49:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:49:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:49:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:49:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:49:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:49:34,895 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:49:34,895 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-03 19:49:34,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:34 BoogieIcfgContainer [2019-09-03 19:49:34,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:49:34,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:49:34,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:49:34,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:49:34,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:49:33" (1/3) ... [2019-09-03 19:49:34,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb70dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:34, skipping insertion in model container [2019-09-03 19:49:34,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:49:34" (2/3) ... [2019-09-03 19:49:34,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb70dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:49:34, skipping insertion in model container [2019-09-03 19:49:34,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:49:34" (3/3) ... [2019-09-03 19:49:34,909 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-09-03 19:49:34,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:49:34,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-09-03 19:49:34,947 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-09-03 19:49:34,989 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:49:34,989 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:49:34,990 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:49:34,990 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:49:34,990 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:49:34,990 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:49:34,990 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:49:34,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:49:34,990 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:49:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-09-03 19:49:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:35,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,033 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-09-03 19:49:35,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,238 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-03 19:49:35,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:35,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:35,266 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-09-03 19:49:35,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:35,452 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2019-09-03 19:49:35,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:35,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:35,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:35,464 INFO L225 Difference]: With dead ends: 131 [2019-09-03 19:49:35,465 INFO L226 Difference]: Without dead ends: 111 [2019-09-03 19:49:35,468 INFO L628 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-03 19:49:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-03 19:49:35,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-09-03 19:49:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-03 19:49:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-09-03 19:49:35,514 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-09-03 19:49:35,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:35,514 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-09-03 19:49:35,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-09-03 19:49:35,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:49:35,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,517 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-09-03 19:49:35,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:35,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:35,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:35,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:35,601 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-09-03 19:49:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:35,688 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-09-03 19:49:35,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:35,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-03 19:49:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:35,691 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:49:35,691 INFO L226 Difference]: Without dead ends: 109 [2019-09-03 19:49:35,692 INFO L628 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-03 19:49:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-03 19:49:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-09-03 19:49:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-03 19:49:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-09-03 19:49:35,704 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-09-03 19:49:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:35,704 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-09-03 19:49:35,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-09-03 19:49:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:35,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,706 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,706 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-09-03 19:49:35,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,764 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-03 19:49:35,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:35,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:35,771 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-09-03 19:49:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:35,908 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-09-03 19:49:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:35,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:49:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:35,910 INFO L225 Difference]: With dead ends: 73 [2019-09-03 19:49:35,910 INFO L226 Difference]: Without dead ends: 71 [2019-09-03 19:49:35,911 INFO L628 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-03 19:49:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-03 19:49:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-09-03 19:49:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-03 19:49:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-09-03 19:49:35,919 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-09-03 19:49:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:35,919 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-09-03 19:49:35,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-09-03 19:49:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:49:35,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:35,921 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:35,922 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-09-03 19:49:35,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:35,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:35,982 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-03 19:49:35,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:35,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:35,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:35,985 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-09-03 19:49:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,105 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-09-03 19:49:36,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:36,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:49:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,106 INFO L225 Difference]: With dead ends: 71 [2019-09-03 19:49:36,107 INFO L226 Difference]: Without dead ends: 69 [2019-09-03 19:49:36,107 INFO L628 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-03 19:49:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-03 19:49:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-03 19:49:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-03 19:49:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-09-03 19:49:36,114 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-09-03 19:49:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,114 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-09-03 19:49:36,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-09-03 19:49:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:36,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,117 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-09-03 19:49:36,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,211 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-03 19:49:36,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:36,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:36,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:36,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:36,213 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-09-03 19:49:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,346 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-09-03 19:49:36,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:36,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 19:49:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,350 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:49:36,350 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:49:36,350 INFO L628 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-03 19:49:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:49:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-09-03 19:49:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:49:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-09-03 19:49:36,366 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-09-03 19:49:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,368 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-09-03 19:49:36,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-09-03 19:49:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:36,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,370 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-09-03 19:49:36,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,453 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-03 19:49:36,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:36,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:36,455 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-09-03 19:49:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,574 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-09-03 19:49:36,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:36,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-09-03 19:49:36,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,575 INFO L225 Difference]: With dead ends: 101 [2019-09-03 19:49:36,576 INFO L226 Difference]: Without dead ends: 99 [2019-09-03 19:49:36,576 INFO L628 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-03 19:49:36,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-03 19:49:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-09-03 19:49:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 19:49:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-09-03 19:49:36,583 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-09-03 19:49:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,583 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-09-03 19:49:36,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-09-03 19:49:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:36,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,585 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,585 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-09-03 19:49:36,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,622 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-03 19:49:36,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:36,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:36,624 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-09-03 19:49:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,680 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-09-03 19:49:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:36,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 19:49:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,682 INFO L225 Difference]: With dead ends: 65 [2019-09-03 19:49:36,682 INFO L226 Difference]: Without dead ends: 61 [2019-09-03 19:49:36,682 INFO L628 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-03 19:49:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-03 19:49:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-03 19:49:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-03 19:49:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-09-03 19:49:36,688 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-09-03 19:49:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,688 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-09-03 19:49:36,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-09-03 19:49:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:49:36,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,690 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-09-03 19:49:36,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,721 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-03 19:49:36,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:36,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:36,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:36,723 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-09-03 19:49:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,771 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-09-03 19:49:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:36,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-09-03 19:49:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,772 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:49:36,772 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:49:36,773 INFO L628 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-03 19:49:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:49:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-03 19:49:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 19:49:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-03 19:49:36,778 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-09-03 19:49:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,779 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-03 19:49:36,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-03 19:49:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:36,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,780 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,781 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-09-03 19:49:36,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:36,833 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-03 19:49:36,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:36,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:36,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:36,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:36,834 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-09-03 19:49:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:36,950 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-09-03 19:49:36,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:36,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:36,952 INFO L225 Difference]: With dead ends: 94 [2019-09-03 19:49:36,952 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 19:49:36,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 19:49:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-09-03 19:49:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 19:49:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-03 19:49:36,960 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-09-03 19:49:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:36,960 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-03 19:49:36,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-03 19:49:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:36,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:36,961 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:36,962 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-09-03 19:49:36,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:36,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,044 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-03 19:49:37,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,046 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-09-03 19:49:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,152 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-09-03 19:49:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:37,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,154 INFO L225 Difference]: With dead ends: 84 [2019-09-03 19:49:37,154 INFO L226 Difference]: Without dead ends: 82 [2019-09-03 19:49:37,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-03 19:49:37,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-09-03 19:49:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 19:49:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-09-03 19:49:37,159 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-09-03 19:49:37,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,160 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-09-03 19:49:37,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-09-03 19:49:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:37,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,162 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-09-03 19:49:37,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,222 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-03 19:49:37,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,223 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-09-03 19:49:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,302 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-09-03 19:49:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:37,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,303 INFO L225 Difference]: With dead ends: 70 [2019-09-03 19:49:37,303 INFO L226 Difference]: Without dead ends: 68 [2019-09-03 19:49:37,304 INFO L628 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-03 19:49:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-03 19:49:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-09-03 19:49:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-03 19:49:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-09-03 19:49:37,308 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-09-03 19:49:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,308 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-09-03 19:49:37,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-09-03 19:49:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:49:37,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,310 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,310 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,311 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-09-03 19:49:37,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,359 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-03 19:49:37,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,361 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-09-03 19:49:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,428 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-09-03 19:49:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:37,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-03 19:49:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,429 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:49:37,429 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:49:37,430 INFO L628 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-03 19:49:37,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:49:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-09-03 19:49:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-03 19:49:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-09-03 19:49:37,434 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-09-03 19:49:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,435 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-09-03 19:49:37,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-09-03 19:49:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:37,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,436 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-09-03 19:49:37,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,467 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-03 19:49:37,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,468 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-09-03 19:49:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,556 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-09-03 19:49:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:37,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,557 INFO L225 Difference]: With dead ends: 69 [2019-09-03 19:49:37,557 INFO L226 Difference]: Without dead ends: 67 [2019-09-03 19:49:37,558 INFO L628 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-03 19:49:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-03 19:49:37,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-09-03 19:49:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 19:49:37,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-09-03 19:49:37,561 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-09-03 19:49:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,562 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-09-03 19:49:37,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-09-03 19:49:37,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:37,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,563 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,564 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-09-03 19:49:37,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,643 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-03 19:49:37,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,645 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-09-03 19:49:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,721 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-09-03 19:49:37,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:37,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,723 INFO L225 Difference]: With dead ends: 59 [2019-09-03 19:49:37,723 INFO L226 Difference]: Without dead ends: 57 [2019-09-03 19:49:37,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-03 19:49:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-09-03 19:49:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 19:49:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-03 19:49:37,732 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-09-03 19:49:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,733 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-03 19:49:37,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-03 19:49:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:49:37,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,736 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-09-03 19:49:37,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,796 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-03 19:49:37,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,797 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-09-03 19:49:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,851 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-03 19:49:37,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:49:37,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-09-03 19:49:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,852 INFO L225 Difference]: With dead ends: 43 [2019-09-03 19:49:37,852 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:49:37,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:49:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:49:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-03 19:49:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-03 19:49:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-03 19:49:37,855 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-09-03 19:49:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,855 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-03 19:49:37,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-03 19:49:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:49:37,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:49:37,857 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-09-03 19:49:37,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:37,901 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-03 19:49:37,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:37,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:49:37,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:49:37,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:49:37,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:49:37,903 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-09-03 19:49:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:37,973 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-09-03 19:49:37,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:49:37,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 19:49:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:37,974 INFO L225 Difference]: With dead ends: 54 [2019-09-03 19:49:37,974 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 19:49:37,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:49:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 19:49:37,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-09-03 19:49:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:49:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 19:49:37,978 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-09-03 19:49:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:37,979 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 19:49:37,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:49:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 19:49:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:49:37,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:37,980 INFO L399 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-03 19:49:37,981 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:37,981 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-09-03 19:49:37,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:37,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:37,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:38,005 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-03 19:49:38,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:38,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:38,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:38,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:38,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:38,006 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2019-09-03 19:49:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:38,032 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-03 19:49:38,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:38,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-03 19:49:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:38,033 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:49:38,033 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 19:49:38,034 INFO L628 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-03 19:49:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 19:49:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 19:49:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 19:49:38,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 19:49:38,037 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-09-03 19:49:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:38,038 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 19:49:38,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:38,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 19:49:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 19:49:38,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:49:38,038 INFO L399 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-03 19:49:38,039 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:49:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:49:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-09-03 19:49:38,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:49:38,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:49:38,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:38,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:49:38,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:49:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:49:38,068 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-03 19:49:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:49:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-03 19:49:38,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-03 19:49:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-03 19:49:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-03 19:49:38,070 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-09-03 19:49:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:38,108 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-09-03 19:49:38,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:49:38,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-03 19:49:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:38,109 INFO L225 Difference]: With dead ends: 37 [2019-09-03 19:49:38,109 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:49:38,110 INFO L628 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-03 19:49:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:49:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:49:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:49:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:49:38,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-03 19:49:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:38,111 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:49:38,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-03 19:49:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:49:38,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:49:38,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:49:38,493 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:38,494 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:38,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:38,494 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:49:38,494 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:49:38,494 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-09-03 19:49:38,495 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-09-03 19:49:38,496 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-09-03 19:49:38,497 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-09-03 19:49:38,497 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-09-03 19:49:38,497 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-09-03 19:49:38,498 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-09-03 19:49:38,498 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-09-03 19:49:38,498 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-09-03 19:49:38,498 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-09-03 19:49:38,499 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-09-03 19:49:38,499 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-09-03 19:49:38,499 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-09-03 19:49:38,499 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-09-03 19:49:38,499 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 1 main_~main__t~0)) [2019-09-03 19:49:38,500 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-09-03 19:49:38,500 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-09-03 19:49:38,501 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-03 19:49:38,502 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-09-03 19:49:38,503 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-09-03 19:49:38,504 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-09-03 19:49:38,504 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (<= 0 main_~main__t~0)) [2019-09-03 19:49:38,504 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-09-03 19:49:38,504 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-09-03 19:49:38,504 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-09-03 19:49:38,504 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-09-03 19:49:38,504 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-09-03 19:49:38,505 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-09-03 19:49:38,505 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-09-03 19:49:38,505 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-09-03 19:49:38,505 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-09-03 19:49:38,506 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-09-03 19:49:38,506 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-09-03 19:49:38,506 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-09-03 19:49:38,506 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-09-03 19:49:38,506 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-09-03 19:49:38,507 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-09-03 19:49:38,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:49:38 BoogieIcfgContainer [2019-09-03 19:49:38,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:49:38,542 INFO L168 Benchmark]: Toolchain (without parser) took 4588.48 ms. Allocated memory was 141.0 MB in the beginning and 259.0 MB in the end (delta: 118.0 MB). Free memory was 87.4 MB in the beginning and 190.7 MB in the end (delta: -103.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:38,544 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:49:38,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.30 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 87.0 MB in the beginning and 179.1 MB in the end (delta: -92.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:38,550 INFO L168 Benchmark]: Boogie Preprocessor took 46.01 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 177.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:38,551 INFO L168 Benchmark]: RCFGBuilder took 483.23 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 153.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:38,552 INFO L168 Benchmark]: TraceAbstraction took 3640.67 ms. Allocated memory was 201.3 MB in the beginning and 259.0 MB in the end (delta: 57.7 MB). Free memory was 152.5 MB in the beginning and 190.7 MB in the end (delta: -38.2 MB). Peak memory consumption was 122.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:49:38,565 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 413.30 ms. Allocated memory was 141.0 MB in the beginning and 201.3 MB in the end (delta: 60.3 MB). Free memory was 87.0 MB in the beginning and 179.1 MB in the end (delta: -92.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.01 ms. Allocated memory is still 201.3 MB. Free memory was 179.1 MB in the beginning and 177.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 483.23 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 153.1 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3640.67 ms. Allocated memory was 201.3 MB in the beginning and 259.0 MB in the end (delta: 57.7 MB). Free memory was 152.5 MB in the beginning and 190.7 MB in the end (delta: -38.2 MB). Peak memory consumption was 122.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__t == main__tagbuf_len)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 3.5s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 856 SDtfs, 1356 SDslu, 904 SDs, 0 SdLazy, 1024 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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, 18 MinimizatonAttempts, 311 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 9 FomulaSimplifications, 139433 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4869 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 10744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...