/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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 01:05:43,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 01:05:43,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 01:05:43,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 01:05:43,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 01:05:43,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 01:05:43,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 01:05:43,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 01:05:43,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 01:05:43,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 01:05:43,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 01:05:43,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 01:05:43,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 01:05:43,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 01:05:43,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 01:05:43,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 01:05:43,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 01:05:43,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 01:05:43,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 01:05:43,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 01:05:43,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 01:05:43,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 01:05:43,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 01:05:43,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 01:05:43,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 01:05:43,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 01:05:43,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 01:05:43,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 01:05:43,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 01:05:43,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 01:05:43,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 01:05:43,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 01:05:43,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 01:05:43,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 01:05:43,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 01:05:43,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 01:05:43,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 01:05:43,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 01:05:43,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 01:05:43,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 01:05:43,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 01:05:43,437 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 01:05:43,465 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 01:05:43,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 01:05:43,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 01:05:43,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 01:05:43,468 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 01:05:43,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 01:05:43,468 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 01:05:43,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 01:05:43,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 01:05:43,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 01:05:43,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 01:05:43,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 01:05:43,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 01:05:43,471 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 01:05:43,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 01:05:43,471 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 01:05:43,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 01:05:43,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 01:05:43,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 01:05:43,472 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 01:05:43,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 01:05:43,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 01:05:43,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 01:05:43,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 01:05:43,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 01:05:43,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 01:05:43,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 01:05:43,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 01:05:43,473 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 01:05:43,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 01:05:43,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 01:05:43,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 01:05:43,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 01:05:43,780 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 01:05:43,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:05:43,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30b3aad8/cb098a5de565420b85088e2242532491/FLAGf53269b19 [2019-11-07 01:05:44,478 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 01:05:44,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:05:44,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30b3aad8/cb098a5de565420b85088e2242532491/FLAGf53269b19 [2019-11-07 01:05:44,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30b3aad8/cb098a5de565420b85088e2242532491 [2019-11-07 01:05:44,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 01:05:44,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 01:05:44,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:44,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 01:05:44,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 01:05:44,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:44" (1/1) ... [2019-11-07 01:05:44,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abfb195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:44, skipping insertion in model container [2019-11-07 01:05:44,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:05:44" (1/1) ... [2019-11-07 01:05:44,729 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 01:05:44,807 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 01:05:45,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:45,510 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 01:05:45,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 01:05:45,898 INFO L192 MainTranslator]: Completed translation [2019-11-07 01:05:45,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45 WrapperNode [2019-11-07 01:05:45,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 01:05:45,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 01:05:45,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 01:05:45,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 01:05:45,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:45,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:45,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:45,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:46,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:46,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:46,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (1/1) ... [2019-11-07 01:05:46,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 01:05:46,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 01:05:46,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 01:05:46,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 01:05:46,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (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 01:05:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 01:05:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 01:05:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 01:05:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 01:05:46,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 01:05:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 01:05:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 01:05:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 01:05:46,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 01:05:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 01:05:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 01:05:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 01:05:46,151 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 01:05:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 01:05:46,152 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 01:05:46,153 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 01:05:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 01:05:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 01:05:46,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 01:05:48,350 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 01:05:48,351 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 01:05:48,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:48 BoogieIcfgContainer [2019-11-07 01:05:48,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 01:05:48,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 01:05:48,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 01:05:48,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 01:05:48,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:05:44" (1/3) ... [2019-11-07 01:05:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354aeac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:48, skipping insertion in model container [2019-11-07 01:05:48,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:05:45" (2/3) ... [2019-11-07 01:05:48,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354aeac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:05:48, skipping insertion in model container [2019-11-07 01:05:48,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:05:48" (3/3) ... [2019-11-07 01:05:48,371 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 01:05:48,382 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 01:05:48,411 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-07 01:05:48,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-07 01:05:48,467 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 01:05:48,467 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 01:05:48,467 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 01:05:48,467 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 01:05:48,467 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 01:05:48,468 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 01:05:48,468 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 01:05:48,468 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 01:05:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states. [2019-11-07 01:05:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 01:05:48,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:48,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:48,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash -437253728, now seen corresponding path program 1 times [2019-11-07 01:05:48,536 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:48,536 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049046491] [2019-11-07 01:05:48,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:49,084 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 01:05:49,085 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049046491] [2019-11-07 01:05:49,086 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:49,087 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:49,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059898226] [2019-11-07 01:05:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:49,098 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:49,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:49,118 INFO L87 Difference]: Start difference. First operand 446 states. Second operand 3 states. [2019-11-07 01:05:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:49,313 INFO L93 Difference]: Finished difference Result 701 states and 1229 transitions. [2019-11-07 01:05:49,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:49,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 01:05:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:49,345 INFO L225 Difference]: With dead ends: 701 [2019-11-07 01:05:49,346 INFO L226 Difference]: Without dead ends: 544 [2019-11-07 01:05:49,350 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 01:05:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-07 01:05:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2019-11-07 01:05:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-07 01:05:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 713 transitions. [2019-11-07 01:05:49,465 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 713 transitions. Word has length 53 [2019-11-07 01:05:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:49,465 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 713 transitions. [2019-11-07 01:05:49,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 713 transitions. [2019-11-07 01:05:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 01:05:49,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:49,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:49,472 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash 511312781, now seen corresponding path program 1 times [2019-11-07 01:05:49,472 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:49,473 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355404310] [2019-11-07 01:05:49,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:05:49,605 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355404310] [2019-11-07 01:05:49,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:49,605 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:49,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077779566] [2019-11-07 01:05:49,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:49,607 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:49,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:49,608 INFO L87 Difference]: Start difference. First operand 538 states and 713 transitions. Second operand 3 states. [2019-11-07 01:05:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:49,698 INFO L93 Difference]: Finished difference Result 939 states and 1299 transitions. [2019-11-07 01:05:49,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:49,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 01:05:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:49,705 INFO L225 Difference]: With dead ends: 939 [2019-11-07 01:05:49,705 INFO L226 Difference]: Without dead ends: 717 [2019-11-07 01:05:49,708 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 01:05:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-07 01:05:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2019-11-07 01:05:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-11-07 01:05:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 964 transitions. [2019-11-07 01:05:49,739 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 964 transitions. Word has length 53 [2019-11-07 01:05:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:49,740 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 964 transitions. [2019-11-07 01:05:49,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:49,740 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 964 transitions. [2019-11-07 01:05:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 01:05:49,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:49,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:49,744 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:49,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2083769958, now seen corresponding path program 1 times [2019-11-07 01:05:49,744 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:49,745 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789306454] [2019-11-07 01:05:49,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:50,010 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 01:05:50,010 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789306454] [2019-11-07 01:05:50,011 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:50,011 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:05:50,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353810545] [2019-11-07 01:05:50,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:05:50,012 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:50,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:05:50,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:05:50,013 INFO L87 Difference]: Start difference. First operand 711 states and 964 transitions. Second operand 10 states. [2019-11-07 01:05:52,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:52,395 INFO L93 Difference]: Finished difference Result 2245 states and 3240 transitions. [2019-11-07 01:05:52,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 01:05:52,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-07 01:05:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:52,409 INFO L225 Difference]: With dead ends: 2245 [2019-11-07 01:05:52,409 INFO L226 Difference]: Without dead ends: 2114 [2019-11-07 01:05:52,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-11-07 01:05:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-11-07 01:05:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 722. [2019-11-07 01:05:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-11-07 01:05:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 978 transitions. [2019-11-07 01:05:52,512 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 978 transitions. Word has length 53 [2019-11-07 01:05:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:52,513 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 978 transitions. [2019-11-07 01:05:52,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:05:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 978 transitions. [2019-11-07 01:05:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:52,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:52,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:52,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:52,516 INFO L82 PathProgramCache]: Analyzing trace with hash -952135619, now seen corresponding path program 1 times [2019-11-07 01:05:52,516 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:52,517 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460933688] [2019-11-07 01:05:52,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:52,599 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 01:05:52,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460933688] [2019-11-07 01:05:52,600 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:52,600 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 01:05:52,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510860859] [2019-11-07 01:05:52,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 01:05:52,601 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 01:05:52,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 01:05:52,602 INFO L87 Difference]: Start difference. First operand 722 states and 978 transitions. Second operand 3 states. [2019-11-07 01:05:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:52,727 INFO L93 Difference]: Finished difference Result 1389 states and 1943 transitions. [2019-11-07 01:05:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 01:05:52,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-07 01:05:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:52,734 INFO L225 Difference]: With dead ends: 1389 [2019-11-07 01:05:52,734 INFO L226 Difference]: Without dead ends: 1060 [2019-11-07 01:05:52,736 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 01:05:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-11-07 01:05:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1053. [2019-11-07 01:05:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-11-07 01:05:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-11-07 01:05:52,796 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-11-07 01:05:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:52,797 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-11-07 01:05:52,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 01:05:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-11-07 01:05:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:52,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:52,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:52,800 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1058176550, now seen corresponding path program 1 times [2019-11-07 01:05:52,801 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:52,801 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60015795] [2019-11-07 01:05:52,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:53,004 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 01:05:53,005 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60015795] [2019-11-07 01:05:53,005 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:53,005 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:05:53,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573490502] [2019-11-07 01:05:53,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:05:53,008 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:53,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:05:53,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:05:53,009 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 10 states. [2019-11-07 01:05:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:54,804 INFO L93 Difference]: Finished difference Result 2584 states and 3635 transitions. [2019-11-07 01:05:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 01:05:54,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-07 01:05:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:54,817 INFO L225 Difference]: With dead ends: 2584 [2019-11-07 01:05:54,817 INFO L226 Difference]: Without dead ends: 2367 [2019-11-07 01:05:54,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-07 01:05:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-07 01:05:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1053. [2019-11-07 01:05:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-11-07 01:05:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-11-07 01:05:54,941 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-11-07 01:05:54,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:54,942 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-11-07 01:05:54,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:05:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-11-07 01:05:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:54,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:54,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:54,945 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:54,946 INFO L82 PathProgramCache]: Analyzing trace with hash -609407585, now seen corresponding path program 1 times [2019-11-07 01:05:54,946 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:54,946 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459922464] [2019-11-07 01:05:54,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:55,306 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 01:05:55,306 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459922464] [2019-11-07 01:05:55,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:55,308 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 01:05:55,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832979437] [2019-11-07 01:05:55,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 01:05:55,309 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 01:05:55,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-07 01:05:55,311 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 12 states. [2019-11-07 01:05:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:05:59,190 INFO L93 Difference]: Finished difference Result 3802 states and 5406 transitions. [2019-11-07 01:05:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 01:05:59,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-11-07 01:05:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:05:59,208 INFO L225 Difference]: With dead ends: 3802 [2019-11-07 01:05:59,208 INFO L226 Difference]: Without dead ends: 3604 [2019-11-07 01:05:59,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-11-07 01:05:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2019-11-07 01:05:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 1069. [2019-11-07 01:05:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-11-07 01:05:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1467 transitions. [2019-11-07 01:05:59,315 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1467 transitions. Word has length 54 [2019-11-07 01:05:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:05:59,316 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1467 transitions. [2019-11-07 01:05:59,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 01:05:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1467 transitions. [2019-11-07 01:05:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 01:05:59,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:05:59,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:05:59,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:05:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:05:59,324 INFO L82 PathProgramCache]: Analyzing trace with hash 963049592, now seen corresponding path program 1 times [2019-11-07 01:05:59,328 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:05:59,329 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581010759] [2019-11-07 01:05:59,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:05:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:05:59,535 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 01:05:59,535 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581010759] [2019-11-07 01:05:59,535 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:05:59,536 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:05:59,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444663943] [2019-11-07 01:05:59,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:05:59,536 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:05:59,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:05:59,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:05:59,537 INFO L87 Difference]: Start difference. First operand 1069 states and 1467 transitions. Second operand 9 states. [2019-11-07 01:06:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:00,939 INFO L93 Difference]: Finished difference Result 4058 states and 5764 transitions. [2019-11-07 01:06:00,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:06:00,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 01:06:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:00,960 INFO L225 Difference]: With dead ends: 4058 [2019-11-07 01:06:00,960 INFO L226 Difference]: Without dead ends: 3298 [2019-11-07 01:06:00,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:06:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-07 01:06:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 2389. [2019-11-07 01:06:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-11-07 01:06:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3394 transitions. [2019-11-07 01:06:01,242 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3394 transitions. Word has length 54 [2019-11-07 01:06:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:01,243 INFO L462 AbstractCegarLoop]: Abstraction has 2389 states and 3394 transitions. [2019-11-07 01:06:01,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:06:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3394 transitions. [2019-11-07 01:06:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:06:01,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:01,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:01,247 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:01,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1344826450, now seen corresponding path program 1 times [2019-11-07 01:06:01,247 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:01,248 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483779066] [2019-11-07 01:06:01,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:01,373 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 01:06:01,373 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483779066] [2019-11-07 01:06:01,374 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:01,374 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 01:06:01,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361216621] [2019-11-07 01:06:01,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 01:06:01,375 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 01:06:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 01:06:01,376 INFO L87 Difference]: Start difference. First operand 2389 states and 3394 transitions. Second operand 7 states. [2019-11-07 01:06:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:03,485 INFO L93 Difference]: Finished difference Result 7376 states and 10821 transitions. [2019-11-07 01:06:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:06:03,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-07 01:06:03,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:03,517 INFO L225 Difference]: With dead ends: 7376 [2019-11-07 01:06:03,517 INFO L226 Difference]: Without dead ends: 6979 [2019-11-07 01:06:03,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 01:06:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-07 01:06:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 2390. [2019-11-07 01:06:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-11-07 01:06:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3396 transitions. [2019-11-07 01:06:03,886 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3396 transitions. Word has length 55 [2019-11-07 01:06:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:03,887 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3396 transitions. [2019-11-07 01:06:03,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 01:06:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3396 transitions. [2019-11-07 01:06:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:06:03,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:03,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:03,894 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash 698198403, now seen corresponding path program 1 times [2019-11-07 01:06:03,895 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:03,895 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619340741] [2019-11-07 01:06:03,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:04,137 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 01:06:04,138 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619340741] [2019-11-07 01:06:04,139 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:04,139 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:06:04,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45363048] [2019-11-07 01:06:04,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:06:04,141 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:04,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:06:04,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:04,142 INFO L87 Difference]: Start difference. First operand 2390 states and 3396 transitions. Second operand 9 states. [2019-11-07 01:06:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:06,159 INFO L93 Difference]: Finished difference Result 6722 states and 9758 transitions. [2019-11-07 01:06:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 01:06:06,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 01:06:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:06,185 INFO L225 Difference]: With dead ends: 6722 [2019-11-07 01:06:06,185 INFO L226 Difference]: Without dead ends: 6171 [2019-11-07 01:06:06,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-11-07 01:06:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-11-07 01:06:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 2405. [2019-11-07 01:06:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-11-07 01:06:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3418 transitions. [2019-11-07 01:06:06,507 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3418 transitions. Word has length 55 [2019-11-07 01:06:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:06,508 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 3418 transitions. [2019-11-07 01:06:06,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:06:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3418 transitions. [2019-11-07 01:06:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:06:06,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:06,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:06,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2110452651, now seen corresponding path program 1 times [2019-11-07 01:06:06,512 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:06,512 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916514527] [2019-11-07 01:06:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:06,608 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 01:06:06,609 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916514527] [2019-11-07 01:06:06,609 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:06,609 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 01:06:06,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47698035] [2019-11-07 01:06:06,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 01:06:06,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:06,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 01:06:06,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 01:06:06,611 INFO L87 Difference]: Start difference. First operand 2405 states and 3418 transitions. Second operand 6 states. [2019-11-07 01:06:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:07,239 INFO L93 Difference]: Finished difference Result 4138 states and 5959 transitions. [2019-11-07 01:06:07,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 01:06:07,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 01:06:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:07,245 INFO L225 Difference]: With dead ends: 4138 [2019-11-07 01:06:07,246 INFO L226 Difference]: Without dead ends: 2372 [2019-11-07 01:06:07,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-07 01:06:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-11-07 01:06:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1715. [2019-11-07 01:06:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-11-07 01:06:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-11-07 01:06:07,463 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-11-07 01:06:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:07,463 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-11-07 01:06:07,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 01:06:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-11-07 01:06:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:06:07,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:07,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:07,466 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1073379538, now seen corresponding path program 1 times [2019-11-07 01:06:07,467 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:07,467 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085960009] [2019-11-07 01:06:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 01:06:07,605 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085960009] [2019-11-07 01:06:07,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:07,605 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 01:06:07,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766683487] [2019-11-07 01:06:07,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 01:06:07,606 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:07,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 01:06:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 01:06:07,607 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 10 states. [2019-11-07 01:06:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:11,857 INFO L93 Difference]: Finished difference Result 8298 states and 11986 transitions. [2019-11-07 01:06:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-07 01:06:11,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-11-07 01:06:11,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:11,874 INFO L225 Difference]: With dead ends: 8298 [2019-11-07 01:06:11,875 INFO L226 Difference]: Without dead ends: 7766 [2019-11-07 01:06:11,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-11-07 01:06:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-11-07 01:06:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 1715. [2019-11-07 01:06:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-11-07 01:06:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-11-07 01:06:12,200 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-11-07 01:06:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:12,200 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-11-07 01:06:12,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 01:06:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-11-07 01:06:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:06:12,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:12,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:12,209 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -603462302, now seen corresponding path program 1 times [2019-11-07 01:06:12,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:12,209 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142213134] [2019-11-07 01:06:12,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:12,349 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 01:06:12,349 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142213134] [2019-11-07 01:06:12,349 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:12,349 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:06:12,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402354454] [2019-11-07 01:06:12,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:06:12,350 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:06:12,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:12,351 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 9 states. [2019-11-07 01:06:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 01:06:14,148 INFO L93 Difference]: Finished difference Result 7723 states and 11113 transitions. [2019-11-07 01:06:14,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 01:06:14,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 01:06:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 01:06:14,161 INFO L225 Difference]: With dead ends: 7723 [2019-11-07 01:06:14,162 INFO L226 Difference]: Without dead ends: 6251 [2019-11-07 01:06:14,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 01:06:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-11-07 01:06:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4360. [2019-11-07 01:06:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2019-11-07 01:06:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6289 transitions. [2019-11-07 01:06:14,883 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6289 transitions. Word has length 55 [2019-11-07 01:06:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 01:06:14,883 INFO L462 AbstractCegarLoop]: Abstraction has 4360 states and 6289 transitions. [2019-11-07 01:06:14,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 01:06:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6289 transitions. [2019-11-07 01:06:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 01:06:14,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 01:06:14,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 01:06:14,888 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 01:06:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 01:06:14,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1551481955, now seen corresponding path program 1 times [2019-11-07 01:06:14,889 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 01:06:14,889 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120563035] [2019-11-07 01:06:14,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 01:06:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 01:06:15,014 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 01:06:15,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120563035] [2019-11-07 01:06:15,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 01:06:15,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 01:06:15,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940130605] [2019-11-07 01:06:15,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 01:06:15,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 01:06:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 01:06:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 01:06:15,021 INFO L87 Difference]: Start difference. First operand 4360 states and 6289 transitions. Second operand 9 states.