/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:15:00,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:15:00,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:15:00,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:15:00,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:15:00,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:15:00,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:15:00,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:15:00,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:15:00,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:15:00,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:15:00,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:15:00,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:15:00,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:15:00,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:15:00,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:15:00,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:15:00,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:15:00,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:15:00,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:15:00,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:15:00,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:15:00,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:15:00,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:15:00,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:15:00,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:15:00,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:15:00,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:15:00,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:15:00,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:15:00,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:15:00,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:15:00,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:15:00,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:15:00,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:15:00,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:15:00,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:15:00,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:15:00,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:15:00,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:15:00,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:15:00,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 05:15:00,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:15:00,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:15:00,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:15:00,429 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:15:00,429 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:15:00,430 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:15:00,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:15:00,430 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:15:00,430 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:15:00,430 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:15:00,430 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:15:00,432 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:15:00,432 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:15:00,432 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:15:00,432 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:15:00,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:15:00,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:15:00,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:15:00,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:15:00,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:15:00,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:15:00,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:15:00,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:15:00,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:15:00,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:15:00,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:15:00,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:15:00,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:15:00,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:15:00,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:15:00,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:15:00,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:15:00,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:15:00,441 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:15:00,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:15:00,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:15:00,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:15:00,442 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:15:00,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:15:00,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:15:00,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:15:00,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:15:00,784 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:15:00,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product29.cil.c [2019-11-24 05:15:00,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d302267b3/ae3e683d2eb847a08119f641d149c9e0/FLAG41f1ac752 [2019-11-24 05:15:01,485 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:15:01,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product29.cil.c [2019-11-24 05:15:01,515 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d302267b3/ae3e683d2eb847a08119f641d149c9e0/FLAG41f1ac752 [2019-11-24 05:15:01,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d302267b3/ae3e683d2eb847a08119f641d149c9e0 [2019-11-24 05:15:01,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:15:01,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:15:01,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:15:01,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:15:01,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:15:01,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:15:01" (1/1) ... [2019-11-24 05:15:01,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51039e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:01, skipping insertion in model container [2019-11-24 05:15:01,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:15:01" (1/1) ... [2019-11-24 05:15:01,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:15:01,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:15:02,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:15:02,594 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:15:02,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:15:02,875 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:15:02,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02 WrapperNode [2019-11-24 05:15:02,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:15:02,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:15:02,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:15:02,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:15:02,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:02,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:15:03,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:15:03,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:15:03,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:15:03,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (1/1) ... [2019-11-24 05:15:03,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:15:03,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:15:03,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:15:03,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:15:03,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (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-24 05:15:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 05:15:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 05:15:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 05:15:03,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:15:03,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:15:19,977 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:15:19,977 INFO L284 CfgBuilder]: Removed 617 assume(true) statements. [2019-11-24 05:15:19,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:15:19 BoogieIcfgContainer [2019-11-24 05:15:19,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:15:19,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:15:19,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:15:19,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:15:19,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:15:01" (1/3) ... [2019-11-24 05:15:19,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b9d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:15:19, skipping insertion in model container [2019-11-24 05:15:19,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:15:02" (2/3) ... [2019-11-24 05:15:19,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5b9d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:15:19, skipping insertion in model container [2019-11-24 05:15:19,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:15:19" (3/3) ... [2019-11-24 05:15:19,991 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product29.cil.c [2019-11-24 05:15:20,000 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:15:20,007 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 05:15:20,015 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 05:15:20,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:15:20,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:15:20,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:15:20,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:15:20,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:15:20,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:15:20,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:15:20,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:15:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 05:15:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 05:15:20,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:20,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:20,060 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1838255619, now seen corresponding path program 1 times [2019-11-24 05:15:20,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:20,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062867023] [2019-11-24 05:15:20,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:20,415 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-24 05:15:20,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062867023] [2019-11-24 05:15:20,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:20,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:15:20,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297573172] [2019-11-24 05:15:20,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 05:15:20,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:20,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 05:15:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:15:20,441 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 05:15:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:20,477 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 05:15:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 05:15:20,479 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 05:15:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:20,493 INFO L225 Difference]: With dead ends: 100 [2019-11-24 05:15:20,493 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 05:15:20,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 05:15:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 05:15:20,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 05:15:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 05:15:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 05:15:20,534 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 05:15:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:20,534 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 05:15:20,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 05:15:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 05:15:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 05:15:20,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:20,535 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:20,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1694206946, now seen corresponding path program 1 times [2019-11-24 05:15:20,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:20,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904305420] [2019-11-24 05:15:20,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:20,680 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-24 05:15:20,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904305420] [2019-11-24 05:15:20,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:20,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:20,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811133524] [2019-11-24 05:15:20,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:20,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:20,684 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 05:15:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:20,701 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 05:15:20,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:20,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 05:15:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:20,703 INFO L225 Difference]: With dead ends: 94 [2019-11-24 05:15:20,703 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 05:15:20,704 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-24 05:15:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 05:15:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 05:15:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 05:15:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 05:15:20,719 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 05:15:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:20,719 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 05:15:20,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:20,719 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 05:15:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 05:15:20,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:20,721 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:20,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:20,724 INFO L82 PathProgramCache]: Analyzing trace with hash 8635389, now seen corresponding path program 1 times [2019-11-24 05:15:20,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:20,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460843298] [2019-11-24 05:15:20,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:15:20,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460843298] [2019-11-24 05:15:20,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:20,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 05:15:20,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486758816] [2019-11-24 05:15:20,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:20,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:20,916 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 05:15:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:21,067 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2019-11-24 05:15:21,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:21,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 05:15:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:21,072 INFO L225 Difference]: With dead ends: 86 [2019-11-24 05:15:21,075 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 05:15:21,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 05:15:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 05:15:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-24 05:15:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 05:15:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 05:15:21,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 05:15:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:21,089 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 05:15:21,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 05:15:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 05:15:21,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:21,092 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:21,092 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash 143196637, now seen corresponding path program 1 times [2019-11-24 05:15:21,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:21,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072446551] [2019-11-24 05:15:21,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:15:21,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072446551] [2019-11-24 05:15:21,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:21,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:15:21,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429614689] [2019-11-24 05:15:21,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:15:21,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:15:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:15:21,340 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 5 states. [2019-11-24 05:15:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:21,554 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2019-11-24 05:15:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 05:15:21,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 05:15:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:21,556 INFO L225 Difference]: With dead ends: 124 [2019-11-24 05:15:21,556 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 05:15:21,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:15:21,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 05:15:21,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-11-24 05:15:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 05:15:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2019-11-24 05:15:21,568 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 15 [2019-11-24 05:15:21,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:21,568 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2019-11-24 05:15:21,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:15:21,568 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2019-11-24 05:15:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 05:15:21,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:21,570 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 05:15:21,570 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1587177902, now seen corresponding path program 1 times [2019-11-24 05:15:21,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:21,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689937144] [2019-11-24 05:15:21,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:15:21,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689937144] [2019-11-24 05:15:21,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:21,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:15:21,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248682703] [2019-11-24 05:15:21,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:15:21,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:21,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:15:21,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:15:21,723 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand 5 states. [2019-11-24 05:15:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:21,789 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2019-11-24 05:15:21,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:15:21,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 05:15:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:21,790 INFO L225 Difference]: With dead ends: 81 [2019-11-24 05:15:21,791 INFO L226 Difference]: Without dead ends: 60 [2019-11-24 05:15:21,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-24 05:15:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-24 05:15:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-24 05:15:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-24 05:15:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2019-11-24 05:15:21,800 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 18 [2019-11-24 05:15:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:21,801 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2019-11-24 05:15:21,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:15:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2019-11-24 05:15:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 05:15:21,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:21,802 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] [2019-11-24 05:15:21,802 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1232688521, now seen corresponding path program 1 times [2019-11-24 05:15:21,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:21,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874724956] [2019-11-24 05:15:21,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:21,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:21,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874724956] [2019-11-24 05:15:21,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:21,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:21,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479969122] [2019-11-24 05:15:21,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:21,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:21,870 INFO L87 Difference]: Start difference. First operand 58 states and 100 transitions. Second operand 3 states. [2019-11-24 05:15:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:21,891 INFO L93 Difference]: Finished difference Result 168 states and 292 transitions. [2019-11-24 05:15:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:21,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 05:15:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:21,893 INFO L225 Difference]: With dead ends: 168 [2019-11-24 05:15:21,893 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 05:15:21,894 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-24 05:15:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 05:15:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2019-11-24 05:15:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-24 05:15:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 185 transitions. [2019-11-24 05:15:21,908 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 185 transitions. Word has length 22 [2019-11-24 05:15:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:21,908 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 185 transitions. [2019-11-24 05:15:21,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 185 transitions. [2019-11-24 05:15:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 05:15:21,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:21,910 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] [2019-11-24 05:15:21,911 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:21,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:21,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1949732660, now seen corresponding path program 1 times [2019-11-24 05:15:21,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:21,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260176203] [2019-11-24 05:15:21,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:21,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260176203] [2019-11-24 05:15:21,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:21,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:21,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375201030] [2019-11-24 05:15:21,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:21,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:21,983 INFO L87 Difference]: Start difference. First operand 104 states and 185 transitions. Second operand 3 states. [2019-11-24 05:15:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:22,004 INFO L93 Difference]: Finished difference Result 304 states and 543 transitions. [2019-11-24 05:15:22,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:22,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 05:15:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:22,006 INFO L225 Difference]: With dead ends: 304 [2019-11-24 05:15:22,006 INFO L226 Difference]: Without dead ends: 202 [2019-11-24 05:15:22,007 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-24 05:15:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-24 05:15:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2019-11-24 05:15:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 05:15:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 349 transitions. [2019-11-24 05:15:22,027 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 349 transitions. Word has length 23 [2019-11-24 05:15:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:22,027 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 349 transitions. [2019-11-24 05:15:22,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 349 transitions. [2019-11-24 05:15:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 05:15:22,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:22,029 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] [2019-11-24 05:15:22,030 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 395413989, now seen corresponding path program 1 times [2019-11-24 05:15:22,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:22,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214685740] [2019-11-24 05:15:22,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:22,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214685740] [2019-11-24 05:15:22,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:22,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:22,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249369743] [2019-11-24 05:15:22,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:22,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:22,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:22,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:22,098 INFO L87 Difference]: Start difference. First operand 194 states and 349 transitions. Second operand 3 states. [2019-11-24 05:15:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:22,131 INFO L93 Difference]: Finished difference Result 570 states and 1027 transitions. [2019-11-24 05:15:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:22,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 05:15:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:22,134 INFO L225 Difference]: With dead ends: 570 [2019-11-24 05:15:22,134 INFO L226 Difference]: Without dead ends: 378 [2019-11-24 05:15:22,135 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-24 05:15:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-24 05:15:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-11-24 05:15:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-11-24 05:15:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 665 transitions. [2019-11-24 05:15:22,163 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 665 transitions. Word has length 24 [2019-11-24 05:15:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:22,163 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 665 transitions. [2019-11-24 05:15:22,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 665 transitions. [2019-11-24 05:15:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 05:15:22,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:22,165 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] [2019-11-24 05:15:22,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1810600266, now seen corresponding path program 1 times [2019-11-24 05:15:22,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:22,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956801691] [2019-11-24 05:15:22,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:22,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956801691] [2019-11-24 05:15:22,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:22,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:22,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425313676] [2019-11-24 05:15:22,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:22,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:22,236 INFO L87 Difference]: Start difference. First operand 370 states and 665 transitions. Second operand 3 states. [2019-11-24 05:15:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:22,310 INFO L93 Difference]: Finished difference Result 1090 states and 1959 transitions. [2019-11-24 05:15:22,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:22,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 05:15:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:22,315 INFO L225 Difference]: With dead ends: 1090 [2019-11-24 05:15:22,315 INFO L226 Difference]: Without dead ends: 722 [2019-11-24 05:15:22,316 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-24 05:15:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-24 05:15:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 714. [2019-11-24 05:15:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-24 05:15:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1273 transitions. [2019-11-24 05:15:22,469 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1273 transitions. Word has length 25 [2019-11-24 05:15:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:22,471 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1273 transitions. [2019-11-24 05:15:22,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1273 transitions. [2019-11-24 05:15:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 05:15:22,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:22,474 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] [2019-11-24 05:15:22,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:22,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1195597942, now seen corresponding path program 1 times [2019-11-24 05:15:22,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:22,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168729147] [2019-11-24 05:15:22,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:22,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168729147] [2019-11-24 05:15:22,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:22,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:22,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534305492] [2019-11-24 05:15:22,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:22,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:22,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:22,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:22,548 INFO L87 Difference]: Start difference. First operand 714 states and 1273 transitions. Second operand 3 states. [2019-11-24 05:15:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:22,651 INFO L93 Difference]: Finished difference Result 2106 states and 3751 transitions. [2019-11-24 05:15:22,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:22,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 05:15:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:22,659 INFO L225 Difference]: With dead ends: 2106 [2019-11-24 05:15:22,660 INFO L226 Difference]: Without dead ends: 1394 [2019-11-24 05:15:22,661 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-24 05:15:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-11-24 05:15:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1386. [2019-11-24 05:15:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-11-24 05:15:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2441 transitions. [2019-11-24 05:15:22,755 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2441 transitions. Word has length 26 [2019-11-24 05:15:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:22,755 INFO L462 AbstractCegarLoop]: Abstraction has 1386 states and 2441 transitions. [2019-11-24 05:15:22,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2441 transitions. [2019-11-24 05:15:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 05:15:22,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:22,757 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] [2019-11-24 05:15:22,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1719219225, now seen corresponding path program 1 times [2019-11-24 05:15:22,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:22,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144361750] [2019-11-24 05:15:22,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:22,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144361750] [2019-11-24 05:15:22,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:22,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:22,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786485622] [2019-11-24 05:15:22,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:22,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:22,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:22,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:22,846 INFO L87 Difference]: Start difference. First operand 1386 states and 2441 transitions. Second operand 3 states. [2019-11-24 05:15:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:23,027 INFO L93 Difference]: Finished difference Result 4090 states and 7191 transitions. [2019-11-24 05:15:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:23,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 05:15:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:23,042 INFO L225 Difference]: With dead ends: 4090 [2019-11-24 05:15:23,043 INFO L226 Difference]: Without dead ends: 2706 [2019-11-24 05:15:23,045 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-24 05:15:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2019-11-24 05:15:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 2698. [2019-11-24 05:15:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-11-24 05:15:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4681 transitions. [2019-11-24 05:15:23,225 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4681 transitions. Word has length 27 [2019-11-24 05:15:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:23,226 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 4681 transitions. [2019-11-24 05:15:23,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4681 transitions. [2019-11-24 05:15:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 05:15:23,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:23,227 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] [2019-11-24 05:15:23,228 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1520779451, now seen corresponding path program 1 times [2019-11-24 05:15:23,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:23,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241385211] [2019-11-24 05:15:23,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:23,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241385211] [2019-11-24 05:15:23,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:15:23,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:15:23,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420404479] [2019-11-24 05:15:23,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:15:23,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:15:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:15:23,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:15:23,335 INFO L87 Difference]: Start difference. First operand 2698 states and 4681 transitions. Second operand 3 states. [2019-11-24 05:15:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:15:23,713 INFO L93 Difference]: Finished difference Result 7962 states and 13783 transitions. [2019-11-24 05:15:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:15:23,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 05:15:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:15:23,741 INFO L225 Difference]: With dead ends: 7962 [2019-11-24 05:15:23,742 INFO L226 Difference]: Without dead ends: 5266 [2019-11-24 05:15:23,746 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-24 05:15:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5266 states. [2019-11-24 05:15:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5266 to 5258. [2019-11-24 05:15:24,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5258 states. [2019-11-24 05:15:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5258 states to 5258 states and 8969 transitions. [2019-11-24 05:15:24,052 INFO L78 Accepts]: Start accepts. Automaton has 5258 states and 8969 transitions. Word has length 28 [2019-11-24 05:15:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:15:24,052 INFO L462 AbstractCegarLoop]: Abstraction has 5258 states and 8969 transitions. [2019-11-24 05:15:24,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:15:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5258 states and 8969 transitions. [2019-11-24 05:15:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 05:15:24,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:15:24,054 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] [2019-11-24 05:15:24,055 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:15:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:15:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1854684663, now seen corresponding path program 1 times [2019-11-24 05:15:24,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:15:24,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030021603] [2019-11-24 05:15:24,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:15:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:24,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030021603] [2019-11-24 05:15:24,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596409456] [2019-11-24 05:15:24,175 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-24 05:15:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:15:24,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 05:15:24,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:15:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:24,682 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:15:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:15:24,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632317607] [2019-11-24 05:15:24,736 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2019-11-24 05:15:24,736 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:15:24,743 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:15:24,750 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:15:24,751 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:16:38,802 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 738