java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:45:06,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:45:06,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:45:06,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:45:06,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:45:06,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:45:06,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:45:06,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:45:06,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:45:06,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:45:06,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:45:06,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:45:06,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:45:06,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:45:06,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:45:06,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:45:06,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:45:06,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:45:06,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:45:06,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:45:06,406 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:45:06,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:45:06,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:45:06,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:45:06,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:45:06,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:45:06,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:45:06,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:45:06,417 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:45:06,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:45:06,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:45:06,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:45:06,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:45:06,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:45:06,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:45:06,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:45:06,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:45:06,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:45:06,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:45:06,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:45:06,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:45:06,436 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-10-14 23:45:06,459 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:45:06,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:45:06,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:45:06,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:45:06,462 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:45:06,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:45:06,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:45:06,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:45:06,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:45:06,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:45:06,464 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:45:06,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:45:06,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:45:06,465 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:45:06,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:45:06,466 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:45:06,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:45:06,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:45:06,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:45:06,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:45:06,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:45:06,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:45:06,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:45:06,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:45:06,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:45:06,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:45:06,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:45:06,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:45:06,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:45:06,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:45:06,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:45:06,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:45:06,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:45:06,755 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:45:06,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-14 23:45:06,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fd8d2fb/b16459fecb6e41b4a843f07bd4fe39ad/FLAGe2ba36853 [2019-10-14 23:45:07,479 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:45:07,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-14 23:45:07,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fd8d2fb/b16459fecb6e41b4a843f07bd4fe39ad/FLAGe2ba36853 [2019-10-14 23:45:07,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8fd8d2fb/b16459fecb6e41b4a843f07bd4fe39ad [2019-10-14 23:45:07,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:45:07,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:45:07,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:07,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:45:07,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:45:07,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:07" (1/1) ... [2019-10-14 23:45:07,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7c31e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:07, skipping insertion in model container [2019-10-14 23:45:07,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:45:07" (1/1) ... [2019-10-14 23:45:07,689 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:45:07,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:45:08,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:08,467 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:45:08,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:45:08,945 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:45:08,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08 WrapperNode [2019-10-14 23:45:08,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:45:08,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:45:08,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:45:08,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:45:08,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:08,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:08,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:08,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:09,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:09,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:09,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (1/1) ... [2019-10-14 23:45:09,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:45:09,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:45:09,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:45:09,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:45:09,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (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-10-14 23:45:09,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:45:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:45:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:45:09,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:45:09,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:45:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:45:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:45:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:45:09,182 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:45:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:45:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:45:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:45:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:45:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:45:09,185 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:45:09,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:45:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:45:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:45:10,955 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:45:10,955 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:45:10,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:10 BoogieIcfgContainer [2019-10-14 23:45:10,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:45:10,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:45:10,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:45:10,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:45:10,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:45:07" (1/3) ... [2019-10-14 23:45:10,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b297115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:10, skipping insertion in model container [2019-10-14 23:45:10,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:45:08" (2/3) ... [2019-10-14 23:45:10,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b297115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:45:10, skipping insertion in model container [2019-10-14 23:45:10,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:45:10" (3/3) ... [2019-10-14 23:45:10,977 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-14 23:45:10,990 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:45:11,000 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-14 23:45:11,014 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-14 23:45:11,049 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:45:11,050 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:45:11,050 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:45:11,050 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:45:11,051 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:45:11,051 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:45:11,051 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:45:11,051 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:45:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states. [2019-10-14 23:45:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-14 23:45:11,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:11,105 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:11,107 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 42890573, now seen corresponding path program 1 times [2019-10-14 23:45:11,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:11,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200156158] [2019-10-14 23:45:11,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:11,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:11,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:12,344 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:12,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200156158] [2019-10-14 23:45:12,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:12,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:12,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505189489] [2019-10-14 23:45:12,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:12,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:12,468 INFO L87 Difference]: Start difference. First operand 418 states. Second operand 5 states. [2019-10-14 23:45:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:16,297 INFO L93 Difference]: Finished difference Result 1212 states and 2155 transitions. [2019-10-14 23:45:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:45:16,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-14 23:45:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:16,322 INFO L225 Difference]: With dead ends: 1212 [2019-10-14 23:45:16,322 INFO L226 Difference]: Without dead ends: 799 [2019-10-14 23:45:16,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-14 23:45:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2019-10-14 23:45:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-14 23:45:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1109 transitions. [2019-10-14 23:45:16,452 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1109 transitions. Word has length 152 [2019-10-14 23:45:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:16,453 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1109 transitions. [2019-10-14 23:45:16,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1109 transitions. [2019-10-14 23:45:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-14 23:45:16,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:16,469 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:16,469 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:16,470 INFO L82 PathProgramCache]: Analyzing trace with hash -832663523, now seen corresponding path program 1 times [2019-10-14 23:45:16,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:16,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897778832] [2019-10-14 23:45:16,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:16,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:16,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:16,956 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:17,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897778832] [2019-10-14 23:45:17,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:17,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:17,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35187553] [2019-10-14 23:45:17,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:17,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:17,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:17,067 INFO L87 Difference]: Start difference. First operand 773 states and 1109 transitions. Second operand 4 states. [2019-10-14 23:45:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:19,321 INFO L93 Difference]: Finished difference Result 2273 states and 3257 transitions. [2019-10-14 23:45:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:19,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-14 23:45:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:19,330 INFO L225 Difference]: With dead ends: 2273 [2019-10-14 23:45:19,330 INFO L226 Difference]: Without dead ends: 1532 [2019-10-14 23:45:19,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2019-10-14 23:45:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 775. [2019-10-14 23:45:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-10-14 23:45:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1111 transitions. [2019-10-14 23:45:19,380 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1111 transitions. Word has length 153 [2019-10-14 23:45:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:19,380 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1111 transitions. [2019-10-14 23:45:19,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1111 transitions. [2019-10-14 23:45:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-14 23:45:19,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:19,384 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:19,384 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:19,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:19,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1878298894, now seen corresponding path program 1 times [2019-10-14 23:45:19,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:19,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934505658] [2019-10-14 23:45:19,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:19,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:19,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:20,050 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:20,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934505658] [2019-10-14 23:45:20,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:20,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:20,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717592168] [2019-10-14 23:45:20,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:20,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:20,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:20,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:20,130 INFO L87 Difference]: Start difference. First operand 775 states and 1111 transitions. Second operand 5 states. [2019-10-14 23:45:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:22,018 INFO L93 Difference]: Finished difference Result 1532 states and 2197 transitions. [2019-10-14 23:45:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:22,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-14 23:45:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:22,029 INFO L225 Difference]: With dead ends: 1532 [2019-10-14 23:45:22,029 INFO L226 Difference]: Without dead ends: 775 [2019-10-14 23:45:22,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-14 23:45:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 774. [2019-10-14 23:45:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-14 23:45:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1108 transitions. [2019-10-14 23:45:22,066 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1108 transitions. Word has length 154 [2019-10-14 23:45:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:22,067 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1108 transitions. [2019-10-14 23:45:22,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1108 transitions. [2019-10-14 23:45:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-14 23:45:22,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:22,070 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:22,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:22,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1636071890, now seen corresponding path program 1 times [2019-10-14 23:45:22,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:22,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147042689] [2019-10-14 23:45:22,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:22,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:22,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,570 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:22,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147042689] [2019-10-14 23:45:22,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:22,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:22,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320848229] [2019-10-14 23:45:22,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:22,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:22,622 INFO L87 Difference]: Start difference. First operand 774 states and 1108 transitions. Second operand 5 states. [2019-10-14 23:45:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:24,288 INFO L93 Difference]: Finished difference Result 1535 states and 2199 transitions. [2019-10-14 23:45:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:24,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-14 23:45:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:24,295 INFO L225 Difference]: With dead ends: 1535 [2019-10-14 23:45:24,295 INFO L226 Difference]: Without dead ends: 772 [2019-10-14 23:45:24,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-10-14 23:45:24,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2019-10-14 23:45:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-14 23:45:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1104 transitions. [2019-10-14 23:45:24,328 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1104 transitions. Word has length 154 [2019-10-14 23:45:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:24,329 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1104 transitions. [2019-10-14 23:45:24,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1104 transitions. [2019-10-14 23:45:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-14 23:45:24,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:24,332 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:24,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:24,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -674126987, now seen corresponding path program 1 times [2019-10-14 23:45:24,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:24,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26179340] [2019-10-14 23:45:24,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:24,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:24,720 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:24,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26179340] [2019-10-14 23:45:24,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:24,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:24,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764115459] [2019-10-14 23:45:24,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:24,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:24,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:24,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:24,773 INFO L87 Difference]: Start difference. First operand 772 states and 1104 transitions. Second operand 4 states. [2019-10-14 23:45:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:28,114 INFO L93 Difference]: Finished difference Result 1732 states and 2480 transitions. [2019-10-14 23:45:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:28,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-14 23:45:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:28,129 INFO L225 Difference]: With dead ends: 1732 [2019-10-14 23:45:28,129 INFO L226 Difference]: Without dead ends: 1156 [2019-10-14 23:45:28,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-10-14 23:45:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1130. [2019-10-14 23:45:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-10-14 23:45:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1602 transitions. [2019-10-14 23:45:28,178 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1602 transitions. Word has length 154 [2019-10-14 23:45:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:28,179 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1602 transitions. [2019-10-14 23:45:28,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1602 transitions. [2019-10-14 23:45:28,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-14 23:45:28,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:28,183 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:28,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:28,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:28,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1140766677, now seen corresponding path program 1 times [2019-10-14 23:45:28,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:28,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515343535] [2019-10-14 23:45:28,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:28,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:28,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:28,572 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:28,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515343535] [2019-10-14 23:45:28,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:28,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:28,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421427278] [2019-10-14 23:45:28,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:28,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:28,613 INFO L87 Difference]: Start difference. First operand 1130 states and 1602 transitions. Second operand 4 states. [2019-10-14 23:45:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:30,931 INFO L93 Difference]: Finished difference Result 2442 states and 3547 transitions. [2019-10-14 23:45:30,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:30,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-14 23:45:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:30,941 INFO L225 Difference]: With dead ends: 2442 [2019-10-14 23:45:30,941 INFO L226 Difference]: Without dead ends: 1501 [2019-10-14 23:45:30,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-10-14 23:45:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1342. [2019-10-14 23:45:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-14 23:45:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1945 transitions. [2019-10-14 23:45:30,993 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1945 transitions. Word has length 156 [2019-10-14 23:45:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:30,993 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1945 transitions. [2019-10-14 23:45:30,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1945 transitions. [2019-10-14 23:45:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-14 23:45:30,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:30,997 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:30,997 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:30,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1542236816, now seen corresponding path program 1 times [2019-10-14 23:45:30,998 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:30,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863774143] [2019-10-14 23:45:30,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:30,998 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:30,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:31,379 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:31,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863774143] [2019-10-14 23:45:31,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:31,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:31,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060859705] [2019-10-14 23:45:31,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:31,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:31,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:31,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:31,434 INFO L87 Difference]: Start difference. First operand 1342 states and 1945 transitions. Second operand 4 states. [2019-10-14 23:45:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:33,817 INFO L93 Difference]: Finished difference Result 2987 states and 4450 transitions. [2019-10-14 23:45:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:33,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-10-14 23:45:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:33,832 INFO L225 Difference]: With dead ends: 2987 [2019-10-14 23:45:33,833 INFO L226 Difference]: Without dead ends: 1918 [2019-10-14 23:45:33,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2019-10-14 23:45:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1719. [2019-10-14 23:45:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-10-14 23:45:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2553 transitions. [2019-10-14 23:45:33,908 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2553 transitions. Word has length 158 [2019-10-14 23:45:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:33,909 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2553 transitions. [2019-10-14 23:45:33,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2553 transitions. [2019-10-14 23:45:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:45:33,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:33,912 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:33,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:33,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:33,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1399172685, now seen corresponding path program 1 times [2019-10-14 23:45:33,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:33,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328838727] [2019-10-14 23:45:33,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:33,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:33,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:34,394 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:34,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328838727] [2019-10-14 23:45:34,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:34,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:34,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665995032] [2019-10-14 23:45:34,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:45:34,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:45:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:34,449 INFO L87 Difference]: Start difference. First operand 1719 states and 2553 transitions. Second operand 6 states. [2019-10-14 23:45:34,809 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 208 [2019-10-14 23:45:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:36,734 INFO L93 Difference]: Finished difference Result 4371 states and 6633 transitions. [2019-10-14 23:45:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:45:36,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-14 23:45:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:36,746 INFO L225 Difference]: With dead ends: 4371 [2019-10-14 23:45:36,747 INFO L226 Difference]: Without dead ends: 2835 [2019-10-14 23:45:36,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:45:36,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2019-10-14 23:45:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2833. [2019-10-14 23:45:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2833 states. [2019-10-14 23:45:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 4278 transitions. [2019-10-14 23:45:36,876 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 4278 transitions. Word has length 159 [2019-10-14 23:45:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:36,877 INFO L462 AbstractCegarLoop]: Abstraction has 2833 states and 4278 transitions. [2019-10-14 23:45:36,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:45:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 4278 transitions. [2019-10-14 23:45:36,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:45:36,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:36,881 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:36,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:36,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:36,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1519156504, now seen corresponding path program 1 times [2019-10-14 23:45:36,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:36,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968112466] [2019-10-14 23:45:36,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:36,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:36,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:37,396 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:37,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968112466] [2019-10-14 23:45:37,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:37,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:45:37,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510312311] [2019-10-14 23:45:37,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:45:37,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:45:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:45:37,446 INFO L87 Difference]: Start difference. First operand 2833 states and 4278 transitions. Second operand 5 states. [2019-10-14 23:45:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:40,302 INFO L93 Difference]: Finished difference Result 7338 states and 11090 transitions. [2019-10-14 23:45:40,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:45:40,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-14 23:45:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:40,323 INFO L225 Difference]: With dead ends: 7338 [2019-10-14 23:45:40,324 INFO L226 Difference]: Without dead ends: 4536 [2019-10-14 23:45:40,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:45:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-14 23:45:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4513. [2019-10-14 23:45:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4513 states. [2019-10-14 23:45:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6769 transitions. [2019-10-14 23:45:40,525 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6769 transitions. Word has length 159 [2019-10-14 23:45:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:40,526 INFO L462 AbstractCegarLoop]: Abstraction has 4513 states and 6769 transitions. [2019-10-14 23:45:40,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:45:40,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6769 transitions. [2019-10-14 23:45:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-14 23:45:40,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:40,531 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:40,531 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 779025742, now seen corresponding path program 1 times [2019-10-14 23:45:40,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:40,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823755596] [2019-10-14 23:45:40,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:40,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:40,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:40,871 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:40,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823755596] [2019-10-14 23:45:40,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:40,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:40,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900687400] [2019-10-14 23:45:40,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:40,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:40,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:40,932 INFO L87 Difference]: Start difference. First operand 4513 states and 6769 transitions. Second operand 4 states. [2019-10-14 23:45:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:45:42,972 INFO L93 Difference]: Finished difference Result 11128 states and 16749 transitions. [2019-10-14 23:45:42,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:45:42,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-14 23:45:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:45:42,995 INFO L225 Difference]: With dead ends: 11128 [2019-10-14 23:45:42,995 INFO L226 Difference]: Without dead ends: 6987 [2019-10-14 23:45:43,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2019-10-14 23:45:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6966. [2019-10-14 23:45:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-10-14 23:45:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 10335 transitions. [2019-10-14 23:45:43,345 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 10335 transitions. Word has length 161 [2019-10-14 23:45:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:45:43,346 INFO L462 AbstractCegarLoop]: Abstraction has 6966 states and 10335 transitions. [2019-10-14 23:45:43,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:45:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 10335 transitions. [2019-10-14 23:45:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-14 23:45:43,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:45:43,353 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 23:45:43,353 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:45:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:45:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -169339511, now seen corresponding path program 1 times [2019-10-14 23:45:43,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:45:43,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009234501] [2019-10-14 23:45:43,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:43,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:45:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:45:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:43,711 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2019-10-14 23:45:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:45:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:45:43,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009234501] [2019-10-14 23:45:43,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:45:43,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:45:43,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225551460] [2019-10-14 23:45:43,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:45:43,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:45:43,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:45:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:45:43,752 INFO L87 Difference]: Start difference. First operand 6966 states and 10335 transitions. Second operand 4 states.