/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:01:05,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:01:05,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:01:05,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:01:05,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:01:05,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:01:05,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:01:05,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:01:05,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:01:05,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:01:05,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:01:05,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:01:05,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:01:05,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:01:05,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:01:05,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:01:05,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:01:05,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:01:05,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:01:05,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:01:05,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:01:05,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:01:05,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:01:05,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:01:05,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:01:05,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:01:05,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:01:05,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:01:05,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:01:05,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:01:05,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:01:05,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:01:05,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:01:05,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:01:05,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:01:05,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:01:05,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:01:05,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:01:05,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:01:05,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:01:05,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:01:05,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:01:05,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:01:05,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:01:05,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:01:05,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:01:05,406 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:01:05,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:01:05,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:01:05,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:01:05,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:01:05,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:01:05,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:01:05,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:01:05,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:01:05,408 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:01:05,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:01:05,408 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:01:05,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:01:05,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:01:05,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:01:05,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:01:05,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:01:05,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:05,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:01:05,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:01:05,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:01:05,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:01:05,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:01:05,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:01:05,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:01:05,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:01:05,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:01:05,771 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:01:05,772 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:01:05,773 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:01:05,773 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-11-07 04:01:05,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bcafc0d/d40ccfa9c46949cd8ba5f3059d34aff1/FLAG376e4439e [2019-11-07 04:01:06,311 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:01:06,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-07 04:01:06,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bcafc0d/d40ccfa9c46949cd8ba5f3059d34aff1/FLAG376e4439e [2019-11-07 04:01:06,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0bcafc0d/d40ccfa9c46949cd8ba5f3059d34aff1 [2019-11-07 04:01:06,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:01:06,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:01:06,675 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:06,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:01:06,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:01:06,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:06" (1/1) ... [2019-11-07 04:01:06,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b92e4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:06, skipping insertion in model container [2019-11-07 04:01:06,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:06" (1/1) ... [2019-11-07 04:01:06,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:01:06,737 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:01:06,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:06,993 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:01:07,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:07,134 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:01:07,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07 WrapperNode [2019-11-07 04:01:07,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:07,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:01:07,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:01:07,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:01:07,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... [2019-11-07 04:01:07,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:01:07,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:01:07,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:01:07,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:01:07,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:07,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:01:07,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:01:07,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:01:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:01:07,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:01:07,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:01:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:01:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:01:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:01:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:01:07,730 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:01:07,731 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:01:07,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:07 BoogieIcfgContainer [2019-11-07 04:01:07,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:01:07,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:01:07,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:01:07,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:01:07,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:06" (1/3) ... [2019-11-07 04:01:07,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1723b190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:07, skipping insertion in model container [2019-11-07 04:01:07,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:07" (2/3) ... [2019-11-07 04:01:07,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1723b190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:07, skipping insertion in model container [2019-11-07 04:01:07,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:07" (3/3) ... [2019-11-07 04:01:07,741 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-11-07 04:01:07,751 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:01:07,760 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-07 04:01:07,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-07 04:01:07,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:01:07,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:01:07,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:01:07,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:01:07,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:01:07,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:01:07,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:01:07,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:01:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2019-11-07 04:01:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:07,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:07,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:07,827 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:07,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash 315066952, now seen corresponding path program 1 times [2019-11-07 04:01:07,840 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:07,841 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855390572] [2019-11-07 04:01:07,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:08,041 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855390572] [2019-11-07 04:01:08,043 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:08,044 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:08,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217279550] [2019-11-07 04:01:08,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:08,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:08,072 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2019-11-07 04:01:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:08,276 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2019-11-07 04:01:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:08,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:08,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:08,291 INFO L225 Difference]: With dead ends: 130 [2019-11-07 04:01:08,291 INFO L226 Difference]: Without dead ends: 110 [2019-11-07 04:01:08,295 INFO L630 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-11-07 04:01:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-07 04:01:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2019-11-07 04:01:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-07 04:01:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-11-07 04:01:08,342 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2019-11-07 04:01:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:08,343 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-11-07 04:01:08,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-11-07 04:01:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:08,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:08,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:08,345 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 311896200, now seen corresponding path program 1 times [2019-11-07 04:01:08,346 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:08,346 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301688384] [2019-11-07 04:01:08,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:08,411 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301688384] [2019-11-07 04:01:08,411 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:08,412 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:08,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113496860] [2019-11-07 04:01:08,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:08,415 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:08,415 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2019-11-07 04:01:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:08,514 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-07 04:01:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:08,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:08,517 INFO L225 Difference]: With dead ends: 110 [2019-11-07 04:01:08,517 INFO L226 Difference]: Without dead ends: 108 [2019-11-07 04:01:08,519 INFO L630 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-11-07 04:01:08,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-07 04:01:08,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 70. [2019-11-07 04:01:08,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-07 04:01:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-07 04:01:08,529 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 11 [2019-11-07 04:01:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:08,529 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-07 04:01:08,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-07 04:01:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:08,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:08,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:08,532 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:08,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1659047165, now seen corresponding path program 1 times [2019-11-07 04:01:08,533 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:08,533 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507643682] [2019-11-07 04:01:08,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:08,605 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507643682] [2019-11-07 04:01:08,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:08,606 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:08,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545846945] [2019-11-07 04:01:08,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:08,607 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:08,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:08,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:08,608 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-11-07 04:01:08,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:08,759 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-07 04:01:08,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:08,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:08,762 INFO L225 Difference]: With dead ends: 72 [2019-11-07 04:01:08,762 INFO L226 Difference]: Without dead ends: 70 [2019-11-07 04:01:08,764 INFO L630 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-11-07 04:01:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-07 04:01:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-11-07 04:01:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 04:01:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-07 04:01:08,782 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 14 [2019-11-07 04:01:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:08,783 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-07 04:01:08,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-07 04:01:08,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 04:01:08,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:08,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:08,789 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:08,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:08,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1688353559, now seen corresponding path program 1 times [2019-11-07 04:01:08,790 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:08,790 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728040430] [2019-11-07 04:01:08,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:08,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728040430] [2019-11-07 04:01:08,887 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:08,887 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:08,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066728346] [2019-11-07 04:01:08,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:08,889 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:08,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:08,889 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-11-07 04:01:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:08,981 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-07 04:01:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:08,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-07 04:01:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:08,983 INFO L225 Difference]: With dead ends: 70 [2019-11-07 04:01:08,983 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 04:01:08,984 INFO L630 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-11-07 04:01:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 04:01:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-07 04:01:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 04:01:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-07 04:01:08,998 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 14 [2019-11-07 04:01:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:08,999 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-07 04:01:08,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-07 04:01:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:09,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,002 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash -108700357, now seen corresponding path program 1 times [2019-11-07 04:01:09,004 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,005 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795932251] [2019-11-07 04:01:09,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,096 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795932251] [2019-11-07 04:01:09,096 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,097 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011801033] [2019-11-07 04:01:09,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:09,098 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:09,099 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-07 04:01:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:09,241 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-11-07 04:01:09,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:09,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 04:01:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:09,243 INFO L225 Difference]: With dead ends: 115 [2019-11-07 04:01:09,244 INFO L226 Difference]: Without dead ends: 113 [2019-11-07 04:01:09,244 INFO L630 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-11-07 04:01:09,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-07 04:01:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 64. [2019-11-07 04:01:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-07 04:01:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-07 04:01:09,264 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 15 [2019-11-07 04:01:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:09,265 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-07 04:01:09,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-07 04:01:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:09,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,272 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash -108714259, now seen corresponding path program 1 times [2019-11-07 04:01:09,273 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,273 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244589315] [2019-11-07 04:01:09,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,340 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244589315] [2019-11-07 04:01:09,340 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,340 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:09,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773162507] [2019-11-07 04:01:09,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:09,341 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:09,342 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-07 04:01:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:09,458 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-11-07 04:01:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:09,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 04:01:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:09,460 INFO L225 Difference]: With dead ends: 100 [2019-11-07 04:01:09,460 INFO L226 Difference]: Without dead ends: 98 [2019-11-07 04:01:09,461 INFO L630 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-11-07 04:01:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-07 04:01:09,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 62. [2019-11-07 04:01:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-07 04:01:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-07 04:01:09,468 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2019-11-07 04:01:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:09,468 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-07 04:01:09,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-07 04:01:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:09,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash -109142256, now seen corresponding path program 1 times [2019-11-07 04:01:09,471 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,471 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816535920] [2019-11-07 04:01:09,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,530 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816535920] [2019-11-07 04:01:09,530 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,531 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:09,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691313327] [2019-11-07 04:01:09,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:09,532 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:09,532 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2019-11-07 04:01:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:09,604 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-07 04:01:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:09,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 04:01:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:09,605 INFO L225 Difference]: With dead ends: 64 [2019-11-07 04:01:09,605 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 04:01:09,606 INFO L630 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-11-07 04:01:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 04:01:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-07 04:01:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-07 04:01:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2019-11-07 04:01:09,611 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 15 [2019-11-07 04:01:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:09,612 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2019-11-07 04:01:09,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2019-11-07 04:01:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 04:01:09,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash 799355856, now seen corresponding path program 1 times [2019-11-07 04:01:09,614 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,614 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795743700] [2019-11-07 04:01:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,654 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795743700] [2019-11-07 04:01:09,654 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,655 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:09,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309111314] [2019-11-07 04:01:09,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:09,655 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:09,656 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2019-11-07 04:01:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:09,721 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-11-07 04:01:09,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:09,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 04:01:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:09,722 INFO L225 Difference]: With dead ends: 60 [2019-11-07 04:01:09,722 INFO L226 Difference]: Without dead ends: 56 [2019-11-07 04:01:09,723 INFO L630 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-11-07 04:01:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-07 04:01:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-11-07 04:01:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-07 04:01:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-07 04:01:09,737 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2019-11-07 04:01:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:09,737 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-07 04:01:09,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-07 04:01:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:09,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,740 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash 925259441, now seen corresponding path program 1 times [2019-11-07 04:01:09,741 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,741 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031464303] [2019-11-07 04:01:09,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:09,831 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031464303] [2019-11-07 04:01:09,831 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:09,831 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:09,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911472351] [2019-11-07 04:01:09,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:09,833 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:09,834 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-11-07 04:01:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:09,959 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-07 04:01:09,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:09,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:09,961 INFO L225 Difference]: With dead ends: 93 [2019-11-07 04:01:09,961 INFO L226 Difference]: Without dead ends: 91 [2019-11-07 04:01:09,962 INFO L630 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-11-07 04:01:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-07 04:01:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-11-07 04:01:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-07 04:01:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-07 04:01:09,968 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2019-11-07 04:01:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:09,968 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-07 04:01:09,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:09,969 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-07 04:01:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:09,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:09,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:09,971 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:09,971 INFO L82 PathProgramCache]: Analyzing trace with hash 924828465, now seen corresponding path program 1 times [2019-11-07 04:01:09,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:09,972 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067403884] [2019-11-07 04:01:09,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,037 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067403884] [2019-11-07 04:01:10,040 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,040 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719002944] [2019-11-07 04:01:10,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,042 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,042 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-07 04:01:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,152 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2019-11-07 04:01:10,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:10,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,157 INFO L225 Difference]: With dead ends: 83 [2019-11-07 04:01:10,157 INFO L226 Difference]: Without dead ends: 81 [2019-11-07 04:01:10,158 INFO L630 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-11-07 04:01:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-07 04:01:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 50. [2019-11-07 04:01:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-07 04:01:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-07 04:01:10,162 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-11-07 04:01:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,162 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-07 04:01:10,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-07 04:01:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:10,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,164 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -975549911, now seen corresponding path program 1 times [2019-11-07 04:01:10,165 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,165 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733812845] [2019-11-07 04:01:10,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,193 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733812845] [2019-11-07 04:01:10,194 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,194 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429002345] [2019-11-07 04:01:10,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,195 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,195 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-07 04:01:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,258 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-07 04:01:10,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:10,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,260 INFO L225 Difference]: With dead ends: 69 [2019-11-07 04:01:10,260 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 04:01:10,260 INFO L630 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-11-07 04:01:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 04:01:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2019-11-07 04:01:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-07 04:01:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-07 04:01:10,265 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 16 [2019-11-07 04:01:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,265 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-07 04:01:10,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-07 04:01:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:01:10,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,266 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -974010711, now seen corresponding path program 1 times [2019-11-07 04:01:10,267 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,267 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259180342] [2019-11-07 04:01:10,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,295 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259180342] [2019-11-07 04:01:10,295 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,296 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381013845] [2019-11-07 04:01:10,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,296 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,297 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2019-11-07 04:01:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,384 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-07 04:01:10,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:10,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:01:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,385 INFO L225 Difference]: With dead ends: 50 [2019-11-07 04:01:10,385 INFO L226 Difference]: Without dead ends: 48 [2019-11-07 04:01:10,386 INFO L630 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-11-07 04:01:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-07 04:01:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-07 04:01:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-07 04:01:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-11-07 04:01:10,391 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 16 [2019-11-07 04:01:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,391 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-07 04:01:10,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,391 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-11-07 04:01:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:10,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,392 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,393 INFO L82 PathProgramCache]: Analyzing trace with hash -175907649, now seen corresponding path program 1 times [2019-11-07 04:01:10,393 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,393 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048828633] [2019-11-07 04:01:10,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,428 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048828633] [2019-11-07 04:01:10,428 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,428 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419621161] [2019-11-07 04:01:10,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,429 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,430 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2019-11-07 04:01:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,512 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-11-07 04:01:10,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:10,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,513 INFO L225 Difference]: With dead ends: 68 [2019-11-07 04:01:10,513 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 04:01:10,514 INFO L630 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-11-07 04:01:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 04:01:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2019-11-07 04:01:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-07 04:01:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-11-07 04:01:10,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2019-11-07 04:01:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,519 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-11-07 04:01:10,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-11-07 04:01:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:10,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,521 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -177273069, now seen corresponding path program 1 times [2019-11-07 04:01:10,521 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,521 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484482640] [2019-11-07 04:01:10,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,590 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484482640] [2019-11-07 04:01:10,591 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,592 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001791655] [2019-11-07 04:01:10,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,592 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,594 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-11-07 04:01:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,675 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2019-11-07 04:01:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:10,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:10,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,676 INFO L225 Difference]: With dead ends: 58 [2019-11-07 04:01:10,676 INFO L226 Difference]: Without dead ends: 56 [2019-11-07 04:01:10,677 INFO L630 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-11-07 04:01:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-07 04:01:10,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-11-07 04:01:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-07 04:01:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-11-07 04:01:10,682 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 17 [2019-11-07 04:01:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,682 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-11-07 04:01:10,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-11-07 04:01:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 04:01:10,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,686 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash -129557819, now seen corresponding path program 1 times [2019-11-07 04:01:10,687 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,687 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794371510] [2019-11-07 04:01:10,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,746 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794371510] [2019-11-07 04:01:10,746 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,746 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306895833] [2019-11-07 04:01:10,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,747 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,748 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-11-07 04:01:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,808 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-07 04:01:10,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:10,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 04:01:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,810 INFO L225 Difference]: With dead ends: 42 [2019-11-07 04:01:10,810 INFO L226 Difference]: Without dead ends: 38 [2019-11-07 04:01:10,811 INFO L630 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-11-07 04:01:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-07 04:01:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-07 04:01:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-07 04:01:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-07 04:01:10,815 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2019-11-07 04:01:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,816 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-07 04:01:10,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-07 04:01:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 04:01:10,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,817 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1158166692, now seen corresponding path program 1 times [2019-11-07 04:01:10,818 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,818 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458711802] [2019-11-07 04:01:10,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,867 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458711802] [2019-11-07 04:01:10,867 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,867 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:10,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801983823] [2019-11-07 04:01:10,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:10,868 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:10,869 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2019-11-07 04:01:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,971 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-11-07 04:01:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:10,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 04:01:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,972 INFO L225 Difference]: With dead ends: 53 [2019-11-07 04:01:10,982 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 04:01:10,983 INFO L630 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-11-07 04:01:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 04:01:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-11-07 04:01:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-07 04:01:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-11-07 04:01:10,987 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 18 [2019-11-07 04:01:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,987 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-11-07 04:01:10,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-11-07 04:01:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 04:01:10,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,989 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1439368950, now seen corresponding path program 1 times [2019-11-07 04:01:10,989 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,989 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869621653] [2019-11-07 04:01:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:11,024 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869621653] [2019-11-07 04:01:11,025 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:11,025 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:01:11,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417618457] [2019-11-07 04:01:11,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:01:11,025 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:11,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:01:11,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:01:11,026 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2019-11-07 04:01:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:11,119 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-11-07 04:01:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:11,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-07 04:01:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:11,122 INFO L225 Difference]: With dead ends: 55 [2019-11-07 04:01:11,122 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 04:01:11,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 04:01:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-11-07 04:01:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 04:01:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-07 04:01:11,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2019-11-07 04:01:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:11,128 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-07 04:01:11,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:01:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-07 04:01:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 04:01:11,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:11,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:11,129 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:11,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:11,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1670767605, now seen corresponding path program 1 times [2019-11-07 04:01:11,130 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:11,130 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927713876] [2019-11-07 04:01:11,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:11,160 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927713876] [2019-11-07 04:01:11,160 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:11,160 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:11,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165223815] [2019-11-07 04:01:11,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:11,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:11,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:11,162 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-11-07 04:01:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:11,202 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-11-07 04:01:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:11,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 04:01:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:11,203 INFO L225 Difference]: With dead ends: 36 [2019-11-07 04:01:11,203 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:01:11,204 INFO L630 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-11-07 04:01:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:01:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:01:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:01:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:01:11,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-11-07 04:01:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:11,205 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:01:11,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:01:11,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:01:11,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:01:11,491 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:01:11,492 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-11-07 04:01:11,492 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-11-07 04:01:11,493 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-11-07 04:01:11,494 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-11-07 04:01:11,494 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-11-07 04:01:11,494 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-11-07 04:01:11,494 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-11-07 04:01:11,494 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-07 04:01:11,494 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__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-11-07 04:01:11,494 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-11-07 04:01:11,495 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-11-07 04:01:11,496 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-11-07 04:01:11,497 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-11-07 04:01:11,498 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-11-07 04:01:11,498 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__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-11-07 04:01:11,498 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__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-11-07 04:01:11,498 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-11-07 04:01:11,498 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-11-07 04:01:11,498 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-07 04:01:11,498 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-11-07 04:01:11,499 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-11-07 04:01:11,499 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-11-07 04:01:11,499 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-07 04:01:11,499 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-11-07 04:01:11,499 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-07 04:01:11,499 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-11-07 04:01:11,499 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-07 04:01:11,500 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-11-07 04:01:11,501 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-11-07 04:01:11,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:11 BoogieIcfgContainer [2019-11-07 04:01:11,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:01:11,518 INFO L168 Benchmark]: Toolchain (without parser) took 4843.68 ms. Allocated memory was 145.8 MB in the beginning and 246.4 MB in the end (delta: 100.7 MB). Free memory was 103.8 MB in the beginning and 127.4 MB in the end (delta: -23.5 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:11,519 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-07 04:01:11,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.51 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 103.4 MB in the beginning and 181.5 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:11,521 INFO L168 Benchmark]: Boogie Preprocessor took 42.21 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 179.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:11,521 INFO L168 Benchmark]: RCFGBuilder took 554.15 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 153.9 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:11,522 INFO L168 Benchmark]: TraceAbstraction took 3782.51 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 153.9 MB in the beginning and 129.4 MB in the end (delta: 24.5 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:11,526 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 460.51 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 103.4 MB in the beginning and 181.5 MB in the end (delta: -78.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.21 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 179.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 554.15 ms. Allocated memory is still 202.9 MB. Free memory was 179.5 MB in the beginning and 153.9 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3782.51 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 153.9 MB in the beginning and 129.4 MB in the end (delta: 24.5 MB). Peak memory consumption was 68.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: 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: 340]: 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: 361]: 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: 373]: 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: 273]: 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: 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: 137]: 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: 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: 183]: 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__tagbuf_len == main__t)) && !(__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__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 18 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 834 SDtfs, 1350 SDslu, 875 SDs, 0 SdLazy, 1095 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 50 HoareAnnotationTreeSize, 9 FomulaSimplifications, 849927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2628 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 10210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...