/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:01,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:01,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:02,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:02,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:02,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:02,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:02,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:02,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:02,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:02,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:02,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:02,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:02,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:02,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:02,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:02,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:02,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:02,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:02,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:02,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:02,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:02,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:02,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:02,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:02,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:02,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:02,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:02,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:02,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:02,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:02,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:02,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:02,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:02,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:02,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:02,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:02,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:02,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:02,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:02,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:02,074 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 00:34:02,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:02,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:02,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:02,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:02,091 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:02,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:02,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:02,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:02,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:02,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:02,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:02,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:02,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:02,093 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:02,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:02,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:02,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:02,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:02,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:02,094 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:02,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:02,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:02,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:02,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:02,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:02,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:02,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:02,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:02,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:34:02,414 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:02,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:02,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:02,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:02,435 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:02,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-07 00:34:02,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d7ef69a/bb55df5e47474f5b82cb3d2811c3b67d/FLAG26cfd325b [2019-11-07 00:34:03,033 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:03,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-07 00:34:03,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d7ef69a/bb55df5e47474f5b82cb3d2811c3b67d/FLAG26cfd325b [2019-11-07 00:34:03,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83d7ef69a/bb55df5e47474f5b82cb3d2811c3b67d [2019-11-07 00:34:03,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:03,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:03,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:03,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:03,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:03,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee7042c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03, skipping insertion in model container [2019-11-07 00:34:03,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,366 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:03,412 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:03,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:03,664 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:03,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:03,717 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:03,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03 WrapperNode [2019-11-07 00:34:03,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:03,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:03,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:03,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:03,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (1/1) ... [2019-11-07 00:34:03,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:03,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:03,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:03,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:03,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (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 00:34:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:04,345 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:04,345 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:34:04,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:04 BoogieIcfgContainer [2019-11-07 00:34:04,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:04,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:04,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:04,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:04,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:03" (1/3) ... [2019-11-07 00:34:04,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b45260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:04, skipping insertion in model container [2019-11-07 00:34:04,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:03" (2/3) ... [2019-11-07 00:34:04,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b45260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:04, skipping insertion in model container [2019-11-07 00:34:04,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:04" (3/3) ... [2019-11-07 00:34:04,355 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-07 00:34:04,366 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:04,374 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-07 00:34:04,387 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-07 00:34:04,414 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:04,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:04,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:04,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:04,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:04,416 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:04,416 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:04,416 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-07 00:34:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:34:04,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:04,448 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 00:34:04,451 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2019-11-07 00:34:04,468 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:04,468 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639982764] [2019-11-07 00:34:04,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:04,662 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 00:34:04,662 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639982764] [2019-11-07 00:34:04,663 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:04,664 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:34:04,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300107744] [2019-11-07 00:34:04,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:34:04,675 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:34:04,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:04,695 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 3 states. [2019-11-07 00:34:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:04,745 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2019-11-07 00:34:04,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:34:04,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-07 00:34:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:04,758 INFO L225 Difference]: With dead ends: 93 [2019-11-07 00:34:04,759 INFO L226 Difference]: Without dead ends: 80 [2019-11-07 00:34:04,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-07 00:34:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-07 00:34:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-07 00:34:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-07 00:34:04,817 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2019-11-07 00:34:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:04,818 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-07 00:34:04,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:34:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-07 00:34:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:34:04,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:04,819 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 00:34:04,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2019-11-07 00:34:04,821 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:04,821 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809279260] [2019-11-07 00:34:04,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:04,950 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 00:34:04,950 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809279260] [2019-11-07 00:34:04,950 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:04,951 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:04,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77468431] [2019-11-07 00:34:04,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:04,959 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:04,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:04,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:04,960 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 6 states. [2019-11-07 00:34:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:05,100 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-11-07 00:34:05,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:05,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-07 00:34:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:05,102 INFO L225 Difference]: With dead ends: 80 [2019-11-07 00:34:05,103 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 00:34:05,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:34:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 00:34:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-07 00:34:05,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-07 00:34:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-11-07 00:34:05,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2019-11-07 00:34:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:05,115 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-11-07 00:34:05,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-11-07 00:34:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 00:34:05,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:05,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:05,117 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:05,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2019-11-07 00:34:05,118 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:05,118 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666444545] [2019-11-07 00:34:05,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:05,172 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 00:34:05,172 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666444545] [2019-11-07 00:34:05,173 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:05,173 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:05,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113914009] [2019-11-07 00:34:05,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:05,174 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:05,175 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 4 states. [2019-11-07 00:34:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:05,279 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2019-11-07 00:34:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:05,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-07 00:34:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:05,285 INFO L225 Difference]: With dead ends: 101 [2019-11-07 00:34:05,285 INFO L226 Difference]: Without dead ends: 99 [2019-11-07 00:34:05,286 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 00:34:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-07 00:34:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2019-11-07 00:34:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-07 00:34:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-11-07 00:34:05,297 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2019-11-07 00:34:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:05,298 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-11-07 00:34:05,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-11-07 00:34:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 00:34:05,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:05,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:05,300 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2019-11-07 00:34:05,301 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:05,301 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401620610] [2019-11-07 00:34:05,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:05,389 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 00:34:05,389 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401620610] [2019-11-07 00:34:05,389 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:05,390 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:05,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680131289] [2019-11-07 00:34:05,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:05,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:05,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:05,392 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2019-11-07 00:34:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:05,497 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-07 00:34:05,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:05,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-07 00:34:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:05,499 INFO L225 Difference]: With dead ends: 76 [2019-11-07 00:34:05,499 INFO L226 Difference]: Without dead ends: 74 [2019-11-07 00:34:05,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-07 00:34:05,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-07 00:34:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-07 00:34:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-11-07 00:34:05,507 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2019-11-07 00:34:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:05,508 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-11-07 00:34:05,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-11-07 00:34:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:34:05,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:05,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:05,510 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2019-11-07 00:34:05,511 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:05,511 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100453485] [2019-11-07 00:34:05,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:05,629 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 00:34:05,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100453485] [2019-11-07 00:34:05,629 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:05,630 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:05,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803879099] [2019-11-07 00:34:05,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:05,631 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:05,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:05,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:05,631 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-11-07 00:34:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:05,817 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2019-11-07 00:34:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:05,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-07 00:34:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:05,819 INFO L225 Difference]: With dead ends: 141 [2019-11-07 00:34:05,819 INFO L226 Difference]: Without dead ends: 139 [2019-11-07 00:34:05,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:34:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-07 00:34:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2019-11-07 00:34:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-07 00:34:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-07 00:34:05,830 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2019-11-07 00:34:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:05,830 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-07 00:34:05,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-07 00:34:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-07 00:34:05,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:05,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:05,833 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:05,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2019-11-07 00:34:05,833 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:05,833 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248814647] [2019-11-07 00:34:05,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:05,926 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 00:34:05,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248814647] [2019-11-07 00:34:05,926 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:05,926 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:05,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507936871] [2019-11-07 00:34:05,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:05,929 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:05,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:05,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:05,929 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-11-07 00:34:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:06,083 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-11-07 00:34:06,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:06,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-07 00:34:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:06,086 INFO L225 Difference]: With dead ends: 108 [2019-11-07 00:34:06,086 INFO L226 Difference]: Without dead ends: 106 [2019-11-07 00:34:06,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:34:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-07 00:34:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2019-11-07 00:34:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-07 00:34:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2019-11-07 00:34:06,104 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2019-11-07 00:34:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:06,108 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2019-11-07 00:34:06,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2019-11-07 00:34:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:34:06,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:06,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:06,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:06,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2019-11-07 00:34:06,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:06,113 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394223573] [2019-11-07 00:34:06,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:06,201 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 00:34:06,201 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394223573] [2019-11-07 00:34:06,202 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:06,202 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451263580] [2019-11-07 00:34:06,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:06,203 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:06,204 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2019-11-07 00:34:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:06,336 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-07 00:34:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:06,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-07 00:34:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:06,337 INFO L225 Difference]: With dead ends: 121 [2019-11-07 00:34:06,337 INFO L226 Difference]: Without dead ends: 119 [2019-11-07 00:34:06,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-07 00:34:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2019-11-07 00:34:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-07 00:34:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2019-11-07 00:34:06,345 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2019-11-07 00:34:06,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:06,346 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2019-11-07 00:34:06,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2019-11-07 00:34:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:34:06,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:06,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:06,348 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2019-11-07 00:34:06,349 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:06,349 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950656173] [2019-11-07 00:34:06,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:06,416 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 00:34:06,417 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950656173] [2019-11-07 00:34:06,417 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:06,417 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:06,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094572432] [2019-11-07 00:34:06,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:06,419 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:06,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:06,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:06,419 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2019-11-07 00:34:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:06,522 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-11-07 00:34:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:06,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-07 00:34:06,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:06,523 INFO L225 Difference]: With dead ends: 77 [2019-11-07 00:34:06,524 INFO L226 Difference]: Without dead ends: 75 [2019-11-07 00:34:06,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-07 00:34:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-07 00:34:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-07 00:34:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-11-07 00:34:06,536 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2019-11-07 00:34:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:06,536 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-11-07 00:34:06,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-11-07 00:34:06,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-07 00:34:06,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:06,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:06,541 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:06,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2019-11-07 00:34:06,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:06,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551626485] [2019-11-07 00:34:06,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:06,593 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 00:34:06,594 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551626485] [2019-11-07 00:34:06,594 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:06,594 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:34:06,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103757934] [2019-11-07 00:34:06,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:34:06,595 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:34:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:06,597 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2019-11-07 00:34:06,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:06,644 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2019-11-07 00:34:06,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:34:06,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-07 00:34:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:06,645 INFO L225 Difference]: With dead ends: 115 [2019-11-07 00:34:06,645 INFO L226 Difference]: Without dead ends: 75 [2019-11-07 00:34:06,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:34:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-07 00:34:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-07 00:34:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-07 00:34:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-07 00:34:06,661 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2019-11-07 00:34:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:06,661 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-07 00:34:06,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:34:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-07 00:34:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:34:06,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:06,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:06,663 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2019-11-07 00:34:06,667 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:06,667 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887802147] [2019-11-07 00:34:06,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:06,728 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 00:34:06,728 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887802147] [2019-11-07 00:34:06,728 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:06,728 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:06,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173363147] [2019-11-07 00:34:06,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:06,729 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:06,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:06,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:06,731 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2019-11-07 00:34:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:06,795 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-11-07 00:34:06,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:06,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-07 00:34:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:06,797 INFO L225 Difference]: With dead ends: 76 [2019-11-07 00:34:06,797 INFO L226 Difference]: Without dead ends: 74 [2019-11-07 00:34:06,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 00:34:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-07 00:34:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-11-07 00:34:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-07 00:34:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-11-07 00:34:06,804 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2019-11-07 00:34:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:06,804 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-11-07 00:34:06,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-11-07 00:34:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-07 00:34:06,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:06,806 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:06,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2019-11-07 00:34:06,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:06,811 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496769484] [2019-11-07 00:34:06,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:06,910 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496769484] [2019-11-07 00:34:06,910 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931616715] [2019-11-07 00:34:06,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:06,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 00:34:06,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:07,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:07,055 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:07,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [416322349] [2019-11-07 00:34:07,109 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-11-07 00:34:07,155 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:07,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:07,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:07,392 INFO L272 AbstractInterpreter]: Visited 28 different actions 64 times. Merged at 6 different actions 36 times. Widened at 1 different actions 2 times. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2019-11-07 00:34:07,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:07,398 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:07,399 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:07,399 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-11-07 00:34:07,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368495462] [2019-11-07 00:34:07,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:34:07,400 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:07,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:34:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:34:07,401 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 9 states. [2019-11-07 00:34:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:07,571 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-11-07 00:34:07,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:07,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-07 00:34:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:07,573 INFO L225 Difference]: With dead ends: 111 [2019-11-07 00:34:07,573 INFO L226 Difference]: Without dead ends: 109 [2019-11-07 00:34:07,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:34:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-07 00:34:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2019-11-07 00:34:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-07 00:34:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-07 00:34:07,587 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2019-11-07 00:34:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:07,587 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-07 00:34:07,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:34:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-07 00:34:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:34:07,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:07,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:07,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:07,790 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2019-11-07 00:34:07,791 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:07,791 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425905383] [2019-11-07 00:34:07,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:07,941 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 00:34:07,941 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425905383] [2019-11-07 00:34:07,941 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:07,941 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:07,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961759605] [2019-11-07 00:34:07,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:07,942 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:07,943 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-11-07 00:34:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:08,003 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-07 00:34:08,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:08,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-07 00:34:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:08,005 INFO L225 Difference]: With dead ends: 70 [2019-11-07 00:34:08,005 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 00:34:08,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 00:34:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-07 00:34:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 00:34:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-07 00:34:08,011 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2019-11-07 00:34:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:08,011 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-07 00:34:08,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-07 00:34:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:34:08,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:08,012 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:08,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2019-11-07 00:34:08,014 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:08,014 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168963580] [2019-11-07 00:34:08,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:08,084 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168963580] [2019-11-07 00:34:08,084 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958861531] [2019-11-07 00:34:08,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:08,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-07 00:34:08,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:08,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:08,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:08,190 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:08,230 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [15883400] [2019-11-07 00:34:08,231 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-11-07 00:34:08,233 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:08,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:08,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:08,364 INFO L272 AbstractInterpreter]: Visited 30 different actions 75 times. Merged at 8 different actions 44 times. Widened at 2 different actions 3 times. Performed 320 root evaluator evaluations with a maximum evaluation depth of 4. Performed 320 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2019-11-07 00:34:08,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:08,365 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:08,365 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:08,366 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-11-07 00:34:08,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090596903] [2019-11-07 00:34:08,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:34:08,368 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:34:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:34:08,370 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 9 states. [2019-11-07 00:34:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:08,474 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-11-07 00:34:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:08,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-07 00:34:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:08,476 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:08,476 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:08,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:34:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2019-11-07 00:34:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-07 00:34:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-07 00:34:08,480 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2019-11-07 00:34:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:08,481 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-07 00:34:08,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:34:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-07 00:34:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 00:34:08,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:08,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:08,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:08,684 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2019-11-07 00:34:08,685 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:08,685 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779552504] [2019-11-07 00:34:08,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:08,787 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 00:34:08,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779552504] [2019-11-07 00:34:08,788 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:08,788 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:08,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5570631] [2019-11-07 00:34:08,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:08,789 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:08,789 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 5 states. [2019-11-07 00:34:08,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:08,848 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-07 00:34:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:08,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-07 00:34:08,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:08,849 INFO L225 Difference]: With dead ends: 63 [2019-11-07 00:34:08,849 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 00:34:08,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 00:34:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 00:34:08,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-07 00:34:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-07 00:34:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-07 00:34:08,853 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2019-11-07 00:34:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:08,854 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-07 00:34:08,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-07 00:34:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 00:34:08,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:08,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:08,855 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2019-11-07 00:34:08,856 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:08,857 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979692294] [2019-11-07 00:34:08,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:08,910 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 00:34:08,910 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979692294] [2019-11-07 00:34:08,910 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:08,910 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:34:08,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558876887] [2019-11-07 00:34:08,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:34:08,911 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:08,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:34:08,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:08,912 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2019-11-07 00:34:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:09,004 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-11-07 00:34:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:09,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-07 00:34:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:09,005 INFO L225 Difference]: With dead ends: 71 [2019-11-07 00:34:09,005 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 00:34:09,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:34:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 00:34:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-11-07 00:34:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-07 00:34:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-07 00:34:09,010 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2019-11-07 00:34:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:09,010 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-07 00:34:09,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:34:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-07 00:34:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 00:34:09,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,012 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2019-11-07 00:34:09,013 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,013 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830438827] [2019-11-07 00:34:09,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,060 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 00:34:09,061 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830438827] [2019-11-07 00:34:09,061 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:09,061 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:09,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273040538] [2019-11-07 00:34:09,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:09,062 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:09,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:09,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:09,063 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2019-11-07 00:34:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:09,173 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2019-11-07 00:34:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:09,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-07 00:34:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:09,174 INFO L225 Difference]: With dead ends: 91 [2019-11-07 00:34:09,174 INFO L226 Difference]: Without dead ends: 89 [2019-11-07 00:34:09,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-07 00:34:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-07 00:34:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-07 00:34:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-11-07 00:34:09,183 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2019-11-07 00:34:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:09,183 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-11-07 00:34:09,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-11-07 00:34:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-07 00:34:09,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,185 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2019-11-07 00:34:09,185 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,186 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882375725] [2019-11-07 00:34:09,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:09,238 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882375725] [2019-11-07 00:34:09,241 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:09,241 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:09,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704085189] [2019-11-07 00:34:09,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:09,242 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:09,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:09,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:09,242 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 5 states. [2019-11-07 00:34:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:09,322 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-11-07 00:34:09,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:09,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-07 00:34:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:09,323 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:34:09,324 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 00:34:09,324 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 00:34:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-07 00:34:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-07 00:34:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-11-07 00:34:09,338 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2019-11-07 00:34:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:09,338 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-11-07 00:34:09,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-11-07 00:34:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 00:34:09,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,340 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2019-11-07 00:34:09,340 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273896490] [2019-11-07 00:34:09,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,383 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 00:34:09,384 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273896490] [2019-11-07 00:34:09,384 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:09,384 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:09,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852788439] [2019-11-07 00:34:09,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:09,385 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:09,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:09,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:09,385 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-11-07 00:34:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:09,411 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-11-07 00:34:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:09,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-07 00:34:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:09,412 INFO L225 Difference]: With dead ends: 70 [2019-11-07 00:34:09,412 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 00:34:09,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:09,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 00:34:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-07 00:34:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 00:34:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-07 00:34:09,418 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2019-11-07 00:34:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:09,418 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-07 00:34:09,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-07 00:34:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-07 00:34:09,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,420 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 273875486, now seen corresponding path program 1 times [2019-11-07 00:34:09,420 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,420 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310514122] [2019-11-07 00:34:09,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,460 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 00:34:09,460 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310514122] [2019-11-07 00:34:09,461 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:09,461 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:09,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510843473] [2019-11-07 00:34:09,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:09,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:09,462 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-07 00:34:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:09,490 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-07 00:34:09,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:09,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-07 00:34:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:09,492 INFO L225 Difference]: With dead ends: 68 [2019-11-07 00:34:09,492 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 00:34:09,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 00:34:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-11-07 00:34:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-07 00:34:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-07 00:34:09,497 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2019-11-07 00:34:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:09,498 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-07 00:34:09,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-07 00:34:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-07 00:34:09,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,499 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash -99791318, now seen corresponding path program 1 times [2019-11-07 00:34:09,500 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750023600] [2019-11-07 00:34:09,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,542 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 00:34:09,542 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750023600] [2019-11-07 00:34:09,543 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:09,543 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:09,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461901008] [2019-11-07 00:34:09,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:09,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:09,544 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 5 states. [2019-11-07 00:34:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:09,667 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2019-11-07 00:34:09,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:09,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-07 00:34:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:09,668 INFO L225 Difference]: With dead ends: 90 [2019-11-07 00:34:09,668 INFO L226 Difference]: Without dead ends: 88 [2019-11-07 00:34:09,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-07 00:34:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2019-11-07 00:34:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-07 00:34:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2019-11-07 00:34:09,675 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2019-11-07 00:34:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:09,676 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2019-11-07 00:34:09,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2019-11-07 00:34:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 00:34:09,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:09,677 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:09,677 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2020599801, now seen corresponding path program 1 times [2019-11-07 00:34:09,678 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:09,678 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403408706] [2019-11-07 00:34:09,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:09,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403408706] [2019-11-07 00:34:09,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802371368] [2019-11-07 00:34:09,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:09,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:09,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-07 00:34:09,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:09,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:09,892 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:09,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:09,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [825568034] [2019-11-07 00:34:09,944 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 45 [2019-11-07 00:34:09,951 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:09,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:10,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:10,062 INFO L272 AbstractInterpreter]: Visited 42 different actions 89 times. Merged at 8 different actions 47 times. Widened at 2 different actions 3 times. Performed 362 root evaluator evaluations with a maximum evaluation depth of 4. Performed 362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 44 variables. [2019-11-07 00:34:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,063 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:10,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:10,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2019-11-07 00:34:10,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305086515] [2019-11-07 00:34:10,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:34:10,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:34:10,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:34:10,065 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 9 states. [2019-11-07 00:34:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,224 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-11-07 00:34:10,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:10,224 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2019-11-07 00:34:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,225 INFO L225 Difference]: With dead ends: 70 [2019-11-07 00:34:10,225 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 00:34:10,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 13 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:34:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 00:34:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-11-07 00:34:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 00:34:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-07 00:34:10,231 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 44 [2019-11-07 00:34:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,232 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-07 00:34:10,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:34:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-07 00:34:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-07 00:34:10,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:10,437 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1201439652, now seen corresponding path program 1 times [2019-11-07 00:34:10,438 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,438 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592734765] [2019-11-07 00:34:10,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,495 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 00:34:10,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592734765] [2019-11-07 00:34:10,495 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,496 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:10,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487189770] [2019-11-07 00:34:10,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:10,497 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:10,497 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-11-07 00:34:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,601 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-07 00:34:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:10,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-07 00:34:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,604 INFO L225 Difference]: With dead ends: 71 [2019-11-07 00:34:10,605 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 00:34:10,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 00:34:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-07 00:34:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-07 00:34:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-07 00:34:10,610 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2019-11-07 00:34:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,610 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-07 00:34:10,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-07 00:34:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 00:34:10,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,611 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,612 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash 40764835, now seen corresponding path program 1 times [2019-11-07 00:34:10,612 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,613 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638964745] [2019-11-07 00:34:10,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 00:34:10,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638964745] [2019-11-07 00:34:10,660 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,660 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:10,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802094270] [2019-11-07 00:34:10,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:10,660 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:10,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:10,661 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-11-07 00:34:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,774 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2019-11-07 00:34:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:10,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-07 00:34:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,776 INFO L225 Difference]: With dead ends: 77 [2019-11-07 00:34:10,776 INFO L226 Difference]: Without dead ends: 75 [2019-11-07 00:34:10,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:34:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-07 00:34:10,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2019-11-07 00:34:10,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-07 00:34:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-11-07 00:34:10,781 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2019-11-07 00:34:10,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,781 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-11-07 00:34:10,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-11-07 00:34:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 00:34:10,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,782 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,782 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1664106253, now seen corresponding path program 1 times [2019-11-07 00:34:10,782 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,783 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134578279] [2019-11-07 00:34:10,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:10,833 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134578279] [2019-11-07 00:34:10,833 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429946690] [2019-11-07 00:34:10,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 00:34:10,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:10,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 00:34:10,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 00:34:10,959 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:34:10,960 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 6 [2019-11-07 00:34:10,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910519335] [2019-11-07 00:34:10,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:10,963 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:10,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:10,963 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2019-11-07 00:34:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,999 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-11-07 00:34:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-07 00:34:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,001 INFO L225 Difference]: With dead ends: 60 [2019-11-07 00:34:11,001 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:11,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:11,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:11,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-11-07 00:34:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,004 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:11,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:11,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:11,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:11,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:11,326 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-11-07 00:34:12,091 WARN L191 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-11-07 00:34:12,315 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-11-07 00:34:12,704 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 70 [2019-11-07 00:34:12,822 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-11-07 00:34:12,825 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:12,826 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:12,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:12,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:12,826 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:12,826 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:12,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:12,826 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-11-07 00:34:12,826 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-11-07 00:34:12,826 INFO L443 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 434) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-11-07 00:34:12,827 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-07 00:34:12,828 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-11-07 00:34:12,829 INFO L439 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse3 (= 0 main_~main__c~0)) (.cse0 (<= 2 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse5 (= main_~__VERIFIER_assert__cond~10 1)) (.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (and (and (= main_~__VERIFIER_assert__cond~0 1) (= main_~__VERIFIER_assert__cond~4 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (and (= main_~__VERIFIER_assert__cond~3 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0)))) (not (= main_~__VERIFIER_assert__cond~7 0))) (not (= main_~__VERIFIER_assert__cond~8 0))))) (or (and .cse0 (<= (+ main_~main__cp~0 2) main_~main__urilen~0) .cse1 .cse2 (= main_~__VERIFIER_assert__cond~8 1) .cse3) (and .cse0 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse1 .cse2 .cse4 .cse5 .cse3) (and .cse0 (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~15 0)) .cse4 .cse5 (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) .cse1 .cse2 (= main_~__VERIFIER_assert__cond~12 1)))) [2019-11-07 00:34:12,829 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-11-07 00:34:12,829 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-11-07 00:34:12,829 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 434) no Hoare annotation was computed. [2019-11-07 00:34:12,829 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-11-07 00:34:12,829 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 434) the Hoare annotation is: true [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-11-07 00:34:12,830 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-11-07 00:34:12,831 INFO L443 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-07 00:34:12,832 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-07 00:34:12,832 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-11-07 00:34:12,832 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-07 00:34:12,832 INFO L439 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (= main_~__VERIFIER_assert__cond~3 1)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (= main_~__VERIFIER_assert__cond~16 1)) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1)) [2019-11-07 00:34:12,832 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-11-07 00:34:12,832 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-11-07 00:34:12,833 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-11-07 00:34:12,833 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-11-07 00:34:12,833 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-11-07 00:34:12,833 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-11-07 00:34:12,833 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-07 00:34:12,833 INFO L439 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (let ((.cse0 (and (= main_~__VERIFIER_assert__cond~3 1) (and (< main_~main__cp~0 main_~main__urilen~0) (let ((.cse1 (< 0 main_~main__scheme~0)) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3 .cse4) (and (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 .cse4))))))) (or (and (= main_~__VERIFIER_assert__cond~0 1) .cse0) (and .cse0 (= main_~main__urilen~0 (+ main_~main__cp~0 1))))) [2019-11-07 00:34:12,833 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-11-07 00:34:12,834 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-11-07 00:34:12,834 INFO L439 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (let ((.cse3 (= main_~__VERIFIER_assert__cond~10 1)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse2 (and (<= 2 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~10 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (< 0 main_~main__scheme~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~4 1) (and (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~1 0))))))) (or (and (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse0 (and .cse1 (= 0 main_~main__c~0) .cse2) .cse3) (and (not (= main_~__VERIFIER_assert__cond~15 0)) (= main_~__VERIFIER_assert__cond~12 1) .cse3 (and (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__c~0) .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~13 0)))))) [2019-11-07 00:34:12,834 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-11-07 00:34:12,834 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-11-07 00:34:12,834 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-11-07 00:34:12,834 INFO L443 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-11-07 00:34:12,834 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L439 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (not (= main_~__VERIFIER_assert__cond~0 0)) [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-11-07 00:34:12,835 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-07 00:34:12,836 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-07 00:34:12,836 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-11-07 00:34:12,836 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-11-07 00:34:12,836 INFO L443 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-11-07 00:34:12,836 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-07 00:34:12,836 INFO L443 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-11-07 00:34:12,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:12 BoogieIcfgContainer [2019-11-07 00:34:12,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:12,871 INFO L168 Benchmark]: Toolchain (without parser) took 9521.85 ms. Allocated memory was 143.1 MB in the beginning and 316.7 MB in the end (delta: 173.5 MB). Free memory was 100.2 MB in the beginning and 151.2 MB in the end (delta: -51.0 MB). Peak memory consumption was 164.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:12,871 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:12,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.08 ms. Allocated memory is still 143.1 MB. Free memory was 100.0 MB in the beginning and 87.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:12,872 INFO L168 Benchmark]: Boogie Preprocessor took 137.14 ms. Allocated memory was 143.1 MB in the beginning and 199.2 MB in the end (delta: 56.1 MB). Free memory was 87.1 MB in the beginning and 176.7 MB in the end (delta: -89.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:12,873 INFO L168 Benchmark]: RCFGBuilder took 489.19 ms. Allocated memory is still 199.2 MB. Free memory was 176.7 MB in the beginning and 149.5 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:12,874 INFO L168 Benchmark]: TraceAbstraction took 8521.14 ms. Allocated memory was 199.2 MB in the beginning and 316.7 MB in the end (delta: 117.4 MB). Free memory was 149.5 MB in the beginning and 151.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:12,877 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27 ms. Allocated memory is still 143.1 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 368.08 ms. Allocated memory is still 143.1 MB. Free memory was 100.0 MB in the beginning and 87.1 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.14 ms. Allocated memory was 143.1 MB in the beginning and 199.2 MB in the end (delta: 56.1 MB). Free memory was 87.1 MB in the beginning and 176.7 MB in the end (delta: -89.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 489.19 ms. Allocated memory is still 199.2 MB. Free memory was 176.7 MB in the beginning and 149.5 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8521.14 ms. Allocated memory was 199.2 MB in the beginning and 316.7 MB in the end (delta: 117.4 MB). Free memory was 149.5 MB in the beginning and 151.2 MB in the end (delta: -1.7 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: 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: 225]: Loop Invariant Derived loop invariant: ((((((2 <= main__cp && main__cp + 2 <= main__urilen) && __VERIFIER_assert__cond == 1) && (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c) || ((((((2 <= main__cp && main__c + 2 <= main__tokenlen) && __VERIFIER_assert__cond == 1) && (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 0 == main__c)) || (((((((((2 <= main__cp && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && (((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || ((__VERIFIER_assert__cond == 1 && main__cp < main__urilen && (((((0 < main__scheme && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__urilen == main__cp + 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((main__c + 2 <= main__tokenlen && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && 0 == main__c) && ((((((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && ((((((((2 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && (__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((__VERIFIER_assert__cond == 1 && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 87 locations, 18 error locations. Result: SAFE, OverallTime: 8.4s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 1400 SDtfs, 2441 SDslu, 1862 SDs, 0 SdLazy, 1176 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 337 SyntacticMatches, 27 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 287 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 549 HoareAnnotationTreeSize, 9 FomulaSimplifications, 28106 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 22934 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1081 ConstructedInterpolants, 0 QuantifiedInterpolants, 95518 SizeOfPredicates, 33 NumberOfNonLiveVariables, 547 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 32 InterpolantComputations, 22 PerfectInterpolantSequences, 24/47 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...