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_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:50:26,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:50:26,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:50:26,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:50:26,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:50:26,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:50:26,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:50:26,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:50:26,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:50:26,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:50:26,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:50:26,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:50:26,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:50:26,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:50:26,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:50:26,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:50:26,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:50:26,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:50:26,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:50:26,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:50:26,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:50:26,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:50:26,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:50:26,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:50:26,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:50:26,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:50:26,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:50:26,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:50:26,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:50:26,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:50:26,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:50:26,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:50:26,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:50:26,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:50:26,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:50:26,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:50:26,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:50:26,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:50:26,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:50:26,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:50:26,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:50:26,864 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-09-08 10:50:26,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:50:26,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:50:26,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:50:26,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:50:26,895 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:50:26,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:50:26,896 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:50:26,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:50:26,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:50:26,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:50:26,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:50:26,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:50:26,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:50:26,902 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:50:26,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:50:26,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:50:26,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:50:26,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:50:26,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:50:26,905 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:50:26,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:50:26,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:50:26,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:50:26,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:50:26,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:50:26,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:50:26,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:50:26,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:50:26,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:50:26,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:50:26,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:50:26,982 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:50:26,983 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:50:26,984 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:50:26,984 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.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:50:27,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1a027cc/28baecb0bc28407dbb93c36f4f3a2b7c/FLAGf5d7ccf55 [2019-09-08 10:50:27,798 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:50:27,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:50:27,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1a027cc/28baecb0bc28407dbb93c36f4f3a2b7c/FLAGf5d7ccf55 [2019-09-08 10:50:28,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b1a027cc/28baecb0bc28407dbb93c36f4f3a2b7c [2019-09-08 10:50:28,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:50:28,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:50:28,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:50:28,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:50:28,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:50:28,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:50:28" (1/1) ... [2019-09-08 10:50:28,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c936716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:28, skipping insertion in model container [2019-09-08 10:50:28,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:50:28" (1/1) ... [2019-09-08 10:50:28,383 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:50:28,578 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:50:29,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:50:29,942 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:50:30,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:50:30,558 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:50:30,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30 WrapperNode [2019-09-08 10:50:30,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:50:30,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:50:30,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:50:30,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:50:30,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (1/1) ... [2019-09-08 10:50:30,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:50:30,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:50:30,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:50:30,898 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:50:30,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (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-09-08 10:50:30,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:50:30,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:50:30,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:50:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:50:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:50:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:50:30,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:50:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:50:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:50:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:50:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:50:30,968 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:50:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:50:30,969 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:50:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:50:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:50:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:50:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:50:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:50:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:50:35,851 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:50:35,852 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:50:35,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:50:35 BoogieIcfgContainer [2019-09-08 10:50:35,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:50:35,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:50:35,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:50:35,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:50:35,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:50:28" (1/3) ... [2019-09-08 10:50:35,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a4018d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:50:35, skipping insertion in model container [2019-09-08 10:50:35,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:50:30" (2/3) ... [2019-09-08 10:50:35,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a4018d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:50:35, skipping insertion in model container [2019-09-08 10:50:35,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:50:35" (3/3) ... [2019-09-08 10:50:35,871 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:50:35,885 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:50:35,913 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-08 10:50:35,936 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-08 10:50:36,007 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:50:36,008 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:50:36,009 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:50:36,009 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:50:36,009 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:50:36,009 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:50:36,010 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:50:36,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:50:36,010 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:50:36,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states. [2019-09-08 10:50:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:50:36,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:36,133 INFO L399 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] [2019-09-08 10:50:36,136 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:36,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 938283624, now seen corresponding path program 1 times [2019-09-08 10:50:36,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:36,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:36,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:36,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:50:36,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:50:36,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:50:36,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:50:36,854 INFO L87 Difference]: Start difference. First operand 2034 states. Second operand 5 states. [2019-09-08 10:50:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:40,451 INFO L93 Difference]: Finished difference Result 3998 states and 7075 transitions. [2019-09-08 10:50:40,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:50:40,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:50:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:40,488 INFO L225 Difference]: With dead ends: 3998 [2019-09-08 10:50:40,488 INFO L226 Difference]: Without dead ends: 2657 [2019-09-08 10:50:40,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-09-08 10:50:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2651. [2019-09-08 10:50:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2651 states. [2019-09-08 10:50:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3521 transitions. [2019-09-08 10:50:40,696 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3521 transitions. Word has length 68 [2019-09-08 10:50:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:40,698 INFO L475 AbstractCegarLoop]: Abstraction has 2651 states and 3521 transitions. [2019-09-08 10:50:40,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:50:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3521 transitions. [2019-09-08 10:50:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:50:40,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:40,709 INFO L399 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] [2019-09-08 10:50:40,710 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1195772802, now seen corresponding path program 1 times [2019-09-08 10:50:40,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:40,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:40,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:40,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:40,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:40,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:50:40,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:50:40,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:50:40,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:50:40,965 INFO L87 Difference]: Start difference. First operand 2651 states and 3521 transitions. Second operand 6 states. [2019-09-08 10:50:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:43,155 INFO L93 Difference]: Finished difference Result 4939 states and 6678 transitions. [2019-09-08 10:50:43,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:50:43,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:50:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:43,184 INFO L225 Difference]: With dead ends: 4939 [2019-09-08 10:50:43,184 INFO L226 Difference]: Without dead ends: 3334 [2019-09-08 10:50:43,192 INFO L628 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-09-08 10:50:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-09-08 10:50:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3317. [2019-09-08 10:50:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3317 states. [2019-09-08 10:50:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3317 states to 3317 states and 4521 transitions. [2019-09-08 10:50:43,353 INFO L78 Accepts]: Start accepts. Automaton has 3317 states and 4521 transitions. Word has length 69 [2019-09-08 10:50:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:43,354 INFO L475 AbstractCegarLoop]: Abstraction has 3317 states and 4521 transitions. [2019-09-08 10:50:43,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:50:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3317 states and 4521 transitions. [2019-09-08 10:50:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:50:43,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:43,362 INFO L399 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] [2019-09-08 10:50:43,363 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:43,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1930205448, now seen corresponding path program 1 times [2019-09-08 10:50:43,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:43,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:43,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:43,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:43,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:43,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:50:43,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:50:43,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:50:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:50:43,586 INFO L87 Difference]: Start difference. First operand 3317 states and 4521 transitions. Second operand 6 states. [2019-09-08 10:50:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:45,856 INFO L93 Difference]: Finished difference Result 8257 states and 11401 transitions. [2019-09-08 10:50:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:50:45,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:50:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:45,885 INFO L225 Difference]: With dead ends: 8257 [2019-09-08 10:50:45,886 INFO L226 Difference]: Without dead ends: 5812 [2019-09-08 10:50:45,893 INFO L628 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-09-08 10:50:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2019-09-08 10:50:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 5788. [2019-09-08 10:50:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5788 states. [2019-09-08 10:50:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 7922 transitions. [2019-09-08 10:50:46,105 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 7922 transitions. Word has length 69 [2019-09-08 10:50:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:46,106 INFO L475 AbstractCegarLoop]: Abstraction has 5788 states and 7922 transitions. [2019-09-08 10:50:46,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:50:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 7922 transitions. [2019-09-08 10:50:46,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:50:46,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:46,115 INFO L399 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] [2019-09-08 10:50:46,115 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1715973779, now seen corresponding path program 1 times [2019-09-08 10:50:46,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:46,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:46,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:46,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:50:46,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:50:46,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:50:46,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:50:46,441 INFO L87 Difference]: Start difference. First operand 5788 states and 7922 transitions. Second operand 9 states. [2019-09-08 10:50:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:50,838 INFO L93 Difference]: Finished difference Result 7554 states and 10651 transitions. [2019-09-08 10:50:50,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:50:50,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 10:50:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:50,874 INFO L225 Difference]: With dead ends: 7554 [2019-09-08 10:50:50,874 INFO L226 Difference]: Without dead ends: 7549 [2019-09-08 10:50:50,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:50:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7549 states. [2019-09-08 10:50:51,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7549 to 5788. [2019-09-08 10:50:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5788 states. [2019-09-08 10:50:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5788 states to 5788 states and 7921 transitions. [2019-09-08 10:50:51,128 INFO L78 Accepts]: Start accepts. Automaton has 5788 states and 7921 transitions. Word has length 70 [2019-09-08 10:50:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:51,129 INFO L475 AbstractCegarLoop]: Abstraction has 5788 states and 7921 transitions. [2019-09-08 10:50:51,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:50:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5788 states and 7921 transitions. [2019-09-08 10:50:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:50:51,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:51,137 INFO L399 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] [2019-09-08 10:50:51,138 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1147545370, now seen corresponding path program 1 times [2019-09-08 10:50:51,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:51,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:51,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:51,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:51,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:51,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:50:51,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:50:51,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:50:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:50:51,482 INFO L87 Difference]: Start difference. First operand 5788 states and 7921 transitions. Second operand 10 states. [2019-09-08 10:50:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:58,787 INFO L93 Difference]: Finished difference Result 18381 states and 27481 transitions. [2019-09-08 10:50:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:50:58,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-09-08 10:50:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:58,844 INFO L225 Difference]: With dead ends: 18381 [2019-09-08 10:50:58,845 INFO L226 Difference]: Without dead ends: 16714 [2019-09-08 10:50:58,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:50:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16714 states. [2019-09-08 10:50:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16714 to 5795. [2019-09-08 10:50:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5795 states. [2019-09-08 10:50:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5795 states to 5795 states and 7928 transitions. [2019-09-08 10:50:59,267 INFO L78 Accepts]: Start accepts. Automaton has 5795 states and 7928 transitions. Word has length 70 [2019-09-08 10:50:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:59,267 INFO L475 AbstractCegarLoop]: Abstraction has 5795 states and 7928 transitions. [2019-09-08 10:50:59,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:50:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5795 states and 7928 transitions. [2019-09-08 10:50:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:50:59,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:59,275 INFO L399 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] [2019-09-08 10:50:59,276 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2042672088, now seen corresponding path program 1 times [2019-09-08 10:50:59,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:59,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:59,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:59,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:59,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:50:59,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:50:59,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:50:59,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:50:59,766 INFO L87 Difference]: Start difference. First operand 5795 states and 7928 transitions. Second operand 12 states. [2019-09-08 10:51:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:05,564 INFO L93 Difference]: Finished difference Result 32269 states and 48405 transitions. [2019-09-08 10:51:05,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:51:05,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 10:51:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:05,641 INFO L225 Difference]: With dead ends: 32269 [2019-09-08 10:51:05,641 INFO L226 Difference]: Without dead ends: 32261 [2019-09-08 10:51:05,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:51:05,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32261 states. [2019-09-08 10:51:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32261 to 5787. [2019-09-08 10:51:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5787 states. [2019-09-08 10:51:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 7920 transitions. [2019-09-08 10:51:06,237 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 7920 transitions. Word has length 71 [2019-09-08 10:51:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:06,237 INFO L475 AbstractCegarLoop]: Abstraction has 5787 states and 7920 transitions. [2019-09-08 10:51:06,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:51:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 7920 transitions. [2019-09-08 10:51:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:51:06,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:06,247 INFO L399 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] [2019-09-08 10:51:06,248 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1298648854, now seen corresponding path program 1 times [2019-09-08 10:51:06,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:06,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:06,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:06,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:06,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:06,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:51:06,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:51:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:51:06,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:51:06,367 INFO L87 Difference]: Start difference. First operand 5787 states and 7920 transitions. Second operand 6 states. [2019-09-08 10:51:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:08,941 INFO L93 Difference]: Finished difference Result 13973 states and 19375 transitions. [2019-09-08 10:51:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:51:08,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:51:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:08,963 INFO L225 Difference]: With dead ends: 13973 [2019-09-08 10:51:08,963 INFO L226 Difference]: Without dead ends: 10272 [2019-09-08 10:51:08,974 INFO L628 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-09-08 10:51:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2019-09-08 10:51:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 10260. [2019-09-08 10:51:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10260 states. [2019-09-08 10:51:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10260 states to 10260 states and 14166 transitions. [2019-09-08 10:51:10,400 INFO L78 Accepts]: Start accepts. Automaton has 10260 states and 14166 transitions. Word has length 71 [2019-09-08 10:51:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:10,400 INFO L475 AbstractCegarLoop]: Abstraction has 10260 states and 14166 transitions. [2019-09-08 10:51:10,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:51:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10260 states and 14166 transitions. [2019-09-08 10:51:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:51:10,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:10,409 INFO L399 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] [2019-09-08 10:51:10,409 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1959113445, now seen corresponding path program 1 times [2019-09-08 10:51:10,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:10,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:10,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:10,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:51:10,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:51:10,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:51:10,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:51:10,804 INFO L87 Difference]: Start difference. First operand 10260 states and 14166 transitions. Second operand 12 states. [2019-09-08 10:51:16,011 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-09-08 10:51:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:19,785 INFO L93 Difference]: Finished difference Result 54052 states and 81825 transitions. [2019-09-08 10:51:19,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:51:19,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 10:51:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:19,886 INFO L225 Difference]: With dead ends: 54052 [2019-09-08 10:51:19,887 INFO L226 Difference]: Without dead ends: 50144 [2019-09-08 10:51:19,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:51:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50144 states. [2019-09-08 10:51:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50144 to 10134. [2019-09-08 10:51:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10134 states. [2019-09-08 10:51:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10134 states to 10134 states and 13980 transitions. [2019-09-08 10:51:21,116 INFO L78 Accepts]: Start accepts. Automaton has 10134 states and 13980 transitions. Word has length 71 [2019-09-08 10:51:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:21,116 INFO L475 AbstractCegarLoop]: Abstraction has 10134 states and 13980 transitions. [2019-09-08 10:51:21,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:51:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10134 states and 13980 transitions. [2019-09-08 10:51:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:51:21,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:21,124 INFO L399 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] [2019-09-08 10:51:21,124 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:21,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1685661044, now seen corresponding path program 1 times [2019-09-08 10:51:21,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:21,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:21,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:21,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:21,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:21,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:21,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:51:21,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:51:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:51:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:51:21,358 INFO L87 Difference]: Start difference. First operand 10134 states and 13980 transitions. Second operand 10 states. [2019-09-08 10:51:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:30,950 INFO L93 Difference]: Finished difference Result 34941 states and 51583 transitions. [2019-09-08 10:51:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:51:30,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-09-08 10:51:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:30,984 INFO L225 Difference]: With dead ends: 34941 [2019-09-08 10:51:30,984 INFO L226 Difference]: Without dead ends: 31088 [2019-09-08 10:51:30,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-08 10:51:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31088 states. [2019-09-08 10:51:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31088 to 10067. [2019-09-08 10:51:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2019-09-08 10:51:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13884 transitions. [2019-09-08 10:51:32,695 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13884 transitions. Word has length 72 [2019-09-08 10:51:32,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:32,695 INFO L475 AbstractCegarLoop]: Abstraction has 10067 states and 13884 transitions. [2019-09-08 10:51:32,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:51:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13884 transitions. [2019-09-08 10:51:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:51:32,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:32,701 INFO L399 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] [2019-09-08 10:51:32,702 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:32,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2102800860, now seen corresponding path program 1 times [2019-09-08 10:51:32,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:32,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:32,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:32,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:32,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:51:32,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:51:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:51:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:32,861 INFO L87 Difference]: Start difference. First operand 10067 states and 13884 transitions. Second operand 9 states. [2019-09-08 10:51:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:38,923 INFO L93 Difference]: Finished difference Result 20016 states and 29032 transitions. [2019-09-08 10:51:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:51:38,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:51:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:38,943 INFO L225 Difference]: With dead ends: 20016 [2019-09-08 10:51:38,943 INFO L226 Difference]: Without dead ends: 20008 [2019-09-08 10:51:38,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:51:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20008 states. [2019-09-08 10:51:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20008 to 10067. [2019-09-08 10:51:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10067 states. [2019-09-08 10:51:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13883 transitions. [2019-09-08 10:51:40,019 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13883 transitions. Word has length 73 [2019-09-08 10:51:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:40,020 INFO L475 AbstractCegarLoop]: Abstraction has 10067 states and 13883 transitions. [2019-09-08 10:51:40,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:51:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13883 transitions. [2019-09-08 10:51:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:51:40,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:40,026 INFO L399 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] [2019-09-08 10:51:40,027 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash -204470104, now seen corresponding path program 1 times [2019-09-08 10:51:40,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:40,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:40,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:40,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:40,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:40,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:51:40,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:51:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:51:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:51:40,629 INFO L87 Difference]: Start difference. First operand 10067 states and 13883 transitions. Second operand 13 states. [2019-09-08 10:51:41,596 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:51:41,874 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 10:51:42,144 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-09-08 10:51:42,510 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 10:51:42,746 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 10:51:43,006 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:51:43,730 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-08 10:51:44,468 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 10:51:46,639 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:51:47,451 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-08 10:51:48,055 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 10:51:48,708 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 10:51:49,293 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 10:51:50,719 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-09-08 10:51:51,430 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 10:51:52,241 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 10:51:53,034 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:52:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:00,241 INFO L93 Difference]: Finished difference Result 70846 states and 107880 transitions. [2019-09-08 10:52:00,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 10:52:00,242 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-08 10:52:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:00,316 INFO L225 Difference]: With dead ends: 70846 [2019-09-08 10:52:00,316 INFO L226 Difference]: Without dead ends: 66990 [2019-09-08 10:52:00,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 10:52:00,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66990 states. [2019-09-08 10:52:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66990 to 10077. [2019-09-08 10:52:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10077 states. [2019-09-08 10:52:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 13896 transitions. [2019-09-08 10:52:02,050 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 13896 transitions. Word has length 73 [2019-09-08 10:52:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:02,050 INFO L475 AbstractCegarLoop]: Abstraction has 10077 states and 13896 transitions. [2019-09-08 10:52:02,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:52:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 13896 transitions. [2019-09-08 10:52:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:52:02,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:02,057 INFO L399 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] [2019-09-08 10:52:02,057 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1308525850, now seen corresponding path program 1 times [2019-09-08 10:52:02,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:02,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:02,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:02,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:02,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:02,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:02,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:52:02,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:52:02,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:52:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:52:02,271 INFO L87 Difference]: Start difference. First operand 10077 states and 13896 transitions. Second operand 9 states. [2019-09-08 10:52:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:12,421 INFO L93 Difference]: Finished difference Result 30150 states and 44676 transitions. [2019-09-08 10:52:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:52:12,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2019-09-08 10:52:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:12,446 INFO L225 Difference]: With dead ends: 30150 [2019-09-08 10:52:12,446 INFO L226 Difference]: Without dead ends: 26345 [2019-09-08 10:52:12,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:52:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26345 states. [2019-09-08 10:52:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26345 to 10077. [2019-09-08 10:52:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10077 states. [2019-09-08 10:52:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 13895 transitions. [2019-09-08 10:52:13,790 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 13895 transitions. Word has length 74 [2019-09-08 10:52:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:13,790 INFO L475 AbstractCegarLoop]: Abstraction has 10077 states and 13895 transitions. [2019-09-08 10:52:13,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:52:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 13895 transitions. [2019-09-08 10:52:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:52:13,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:13,797 INFO L399 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] [2019-09-08 10:52:13,798 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1594234650, now seen corresponding path program 1 times [2019-09-08 10:52:13,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:13,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:14,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:14,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:52:14,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:52:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:52:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:52:14,332 INFO L87 Difference]: Start difference. First operand 10077 states and 13895 transitions. Second operand 13 states. [2019-09-08 10:52:15,010 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-08 10:52:15,213 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:52:15,414 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:52:15,682 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-08 10:52:15,883 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 10:52:18,995 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 10:52:19,913 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 10:52:23,935 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-08 10:52:25,038 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 10:52:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:34,555 INFO L93 Difference]: Finished difference Result 65922 states and 100222 transitions. [2019-09-08 10:52:34,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 10:52:34,555 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2019-09-08 10:52:34,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:34,624 INFO L225 Difference]: With dead ends: 65922 [2019-09-08 10:52:34,625 INFO L226 Difference]: Without dead ends: 61978 [2019-09-08 10:52:34,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 10:52:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61978 states. [2019-09-08 10:52:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61978 to 10087. [2019-09-08 10:52:36,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10087 states. [2019-09-08 10:52:36,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10087 states to 10087 states and 13908 transitions. [2019-09-08 10:52:36,523 INFO L78 Accepts]: Start accepts. Automaton has 10087 states and 13908 transitions. Word has length 74 [2019-09-08 10:52:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:36,523 INFO L475 AbstractCegarLoop]: Abstraction has 10087 states and 13908 transitions. [2019-09-08 10:52:36,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:52:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 10087 states and 13908 transitions. [2019-09-08 10:52:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:52:36,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:36,530 INFO L399 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] [2019-09-08 10:52:36,531 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1506198473, now seen corresponding path program 1 times [2019-09-08 10:52:36,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:36,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:36,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:36,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:36,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:36,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:36,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:36,603 INFO L87 Difference]: Start difference. First operand 10087 states and 13908 transitions. Second operand 3 states. [2019-09-08 10:52:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:38,919 INFO L93 Difference]: Finished difference Result 17011 states and 24460 transitions. [2019-09-08 10:52:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:38,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:52:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:38,930 INFO L225 Difference]: With dead ends: 17011 [2019-09-08 10:52:38,931 INFO L226 Difference]: Without dead ends: 10613 [2019-09-08 10:52:38,940 INFO L628 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-09-08 10:52:38,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10613 states. [2019-09-08 10:52:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10613 to 10609. [2019-09-08 10:52:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10609 states. [2019-09-08 10:52:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10609 states to 10609 states and 15167 transitions. [2019-09-08 10:52:41,188 INFO L78 Accepts]: Start accepts. Automaton has 10609 states and 15167 transitions. Word has length 74 [2019-09-08 10:52:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:41,188 INFO L475 AbstractCegarLoop]: Abstraction has 10609 states and 15167 transitions. [2019-09-08 10:52:41,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 10609 states and 15167 transitions. [2019-09-08 10:52:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:52:41,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:41,194 INFO L399 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] [2019-09-08 10:52:41,194 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1708091960, now seen corresponding path program 1 times [2019-09-08 10:52:41,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:41,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:41,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:41,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:41,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:41,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:41,263 INFO L87 Difference]: Start difference. First operand 10609 states and 15167 transitions. Second operand 3 states. [2019-09-08 10:52:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:44,795 INFO L93 Difference]: Finished difference Result 23509 states and 34400 transitions. [2019-09-08 10:52:44,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:44,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:52:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:44,810 INFO L225 Difference]: With dead ends: 23509 [2019-09-08 10:52:44,811 INFO L226 Difference]: Without dead ends: 14037 [2019-09-08 10:52:44,823 INFO L628 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-09-08 10:52:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-09-08 10:52:48,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 14033. [2019-09-08 10:52:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14033 states. [2019-09-08 10:52:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14033 states to 14033 states and 20543 transitions. [2019-09-08 10:52:48,156 INFO L78 Accepts]: Start accepts. Automaton has 14033 states and 20543 transitions. Word has length 74 [2019-09-08 10:52:48,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:48,156 INFO L475 AbstractCegarLoop]: Abstraction has 14033 states and 20543 transitions. [2019-09-08 10:52:48,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 14033 states and 20543 transitions. [2019-09-08 10:52:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:52:48,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:48,162 INFO L399 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] [2019-09-08 10:52:48,162 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1609177361, now seen corresponding path program 1 times [2019-09-08 10:52:48,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:48,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:48,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:48,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:48,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:48,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:48,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:48,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:48,252 INFO L87 Difference]: Start difference. First operand 14033 states and 20543 transitions. Second operand 3 states. [2019-09-08 10:52:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:54,961 INFO L93 Difference]: Finished difference Result 33325 states and 50382 transitions. [2019-09-08 10:52:54,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:54,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:52:54,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:54,986 INFO L225 Difference]: With dead ends: 33325 [2019-09-08 10:52:54,986 INFO L226 Difference]: Without dead ends: 22442 [2019-09-08 10:52:54,999 INFO L628 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-09-08 10:52:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22442 states. [2019-09-08 10:52:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22442 to 16428. [2019-09-08 10:52:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16428 states. [2019-09-08 10:52:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16428 states to 16428 states and 24256 transitions. [2019-09-08 10:52:59,506 INFO L78 Accepts]: Start accepts. Automaton has 16428 states and 24256 transitions. Word has length 75 [2019-09-08 10:52:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:59,507 INFO L475 AbstractCegarLoop]: Abstraction has 16428 states and 24256 transitions. [2019-09-08 10:52:59,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 16428 states and 24256 transitions. [2019-09-08 10:52:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:52:59,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:59,512 INFO L399 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] [2019-09-08 10:52:59,512 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:59,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash 646929734, now seen corresponding path program 1 times [2019-09-08 10:52:59,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:59,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:59,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:59,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:59,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:59,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:59,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:52:59,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:52:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:52:59,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:52:59,745 INFO L87 Difference]: Start difference. First operand 16428 states and 24256 transitions. Second operand 10 states. [2019-09-08 10:53:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:25,791 INFO L93 Difference]: Finished difference Result 70305 states and 105713 transitions. [2019-09-08 10:53:25,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:53:25,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-08 10:53:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:25,857 INFO L225 Difference]: With dead ends: 70305 [2019-09-08 10:53:25,858 INFO L226 Difference]: Without dead ends: 66282 [2019-09-08 10:53:25,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2019-09-08 10:53:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66282 states. [2019-09-08 10:53:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66282 to 16428. [2019-09-08 10:53:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16428 states. [2019-09-08 10:53:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16428 states to 16428 states and 24255 transitions. [2019-09-08 10:53:30,839 INFO L78 Accepts]: Start accepts. Automaton has 16428 states and 24255 transitions. Word has length 75 [2019-09-08 10:53:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:30,839 INFO L475 AbstractCegarLoop]: Abstraction has 16428 states and 24255 transitions. [2019-09-08 10:53:30,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:53:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 16428 states and 24255 transitions. [2019-09-08 10:53:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:53:30,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:30,844 INFO L399 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] [2019-09-08 10:53:30,845 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:30,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:30,845 INFO L82 PathProgramCache]: Analyzing trace with hash 651271719, now seen corresponding path program 1 times [2019-09-08 10:53:30,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:30,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:30,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:30,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:31,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:31,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:53:31,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:53:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:53:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:53:31,047 INFO L87 Difference]: Start difference. First operand 16428 states and 24255 transitions. Second operand 10 states. [2019-09-08 10:53:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:49,539 INFO L93 Difference]: Finished difference Result 45194 states and 68011 transitions. [2019-09-08 10:53:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:53:49,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-09-08 10:53:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:49,580 INFO L225 Difference]: With dead ends: 45194 [2019-09-08 10:53:49,580 INFO L226 Difference]: Without dead ends: 40816 [2019-09-08 10:53:49,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:53:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40816 states. [2019-09-08 10:53:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40816 to 16428. [2019-09-08 10:53:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16428 states. [2019-09-08 10:53:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16428 states to 16428 states and 24254 transitions. [2019-09-08 10:53:54,426 INFO L78 Accepts]: Start accepts. Automaton has 16428 states and 24254 transitions. Word has length 75 [2019-09-08 10:53:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:54,426 INFO L475 AbstractCegarLoop]: Abstraction has 16428 states and 24254 transitions. [2019-09-08 10:53:54,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:53:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 16428 states and 24254 transitions. [2019-09-08 10:53:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:53:54,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:54,431 INFO L399 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] [2019-09-08 10:53:54,432 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2070521782, now seen corresponding path program 1 times [2019-09-08 10:53:54,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:54,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:54,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:54,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:53:54,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:53:54,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:53:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:53:54,515 INFO L87 Difference]: Start difference. First operand 16428 states and 24254 transitions. Second operand 3 states. [2019-09-08 10:54:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:03,487 INFO L93 Difference]: Finished difference Result 42515 states and 63843 transitions. [2019-09-08 10:54:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:03,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:54:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:03,520 INFO L225 Difference]: With dead ends: 42515 [2019-09-08 10:54:03,520 INFO L226 Difference]: Without dead ends: 28673 [2019-09-08 10:54:03,535 INFO L628 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-09-08 10:54:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2019-09-08 10:54:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24429. [2019-09-08 10:54:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24429 states. [2019-09-08 10:54:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24429 states to 24429 states and 35908 transitions. [2019-09-08 10:54:11,356 INFO L78 Accepts]: Start accepts. Automaton has 24429 states and 35908 transitions. Word has length 76 [2019-09-08 10:54:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:11,357 INFO L475 AbstractCegarLoop]: Abstraction has 24429 states and 35908 transitions. [2019-09-08 10:54:11,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 24429 states and 35908 transitions. [2019-09-08 10:54:11,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:54:11,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:11,361 INFO L399 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] [2019-09-08 10:54:11,362 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:11,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:11,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1074481646, now seen corresponding path program 1 times [2019-09-08 10:54:11,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:11,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:11,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:11,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:11,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:11,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:11,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:54:11,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:54:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:54:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:54:11,425 INFO L87 Difference]: Start difference. First operand 24429 states and 35908 transitions. Second operand 3 states. [2019-09-08 10:54:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:26,511 INFO L93 Difference]: Finished difference Result 63421 states and 94881 transitions. [2019-09-08 10:54:26,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:26,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:54:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:26,555 INFO L225 Difference]: With dead ends: 63421 [2019-09-08 10:54:26,555 INFO L226 Difference]: Without dead ends: 41899 [2019-09-08 10:54:26,573 INFO L628 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-09-08 10:54:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41899 states. [2019-09-08 10:54:42,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41899 to 41897. [2019-09-08 10:54:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41897 states. [2019-09-08 10:54:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41897 states to 41897 states and 61700 transitions. [2019-09-08 10:54:42,401 INFO L78 Accepts]: Start accepts. Automaton has 41897 states and 61700 transitions. Word has length 76 [2019-09-08 10:54:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:42,402 INFO L475 AbstractCegarLoop]: Abstraction has 41897 states and 61700 transitions. [2019-09-08 10:54:42,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 41897 states and 61700 transitions. [2019-09-08 10:54:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:54:42,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:42,406 INFO L399 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] [2019-09-08 10:54:42,406 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1384207412, now seen corresponding path program 1 times [2019-09-08 10:54:42,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:42,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:42,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:42,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:54:42,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:54:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:54:42,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:54:42,577 INFO L87 Difference]: Start difference. First operand 41897 states and 61700 transitions. Second operand 9 states. [2019-09-08 10:55:22,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:22,801 INFO L93 Difference]: Finished difference Result 98143 states and 145154 transitions. [2019-09-08 10:55:22,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:55:22,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-08 10:55:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:22,913 INFO L225 Difference]: With dead ends: 98143 [2019-09-08 10:55:22,913 INFO L226 Difference]: Without dead ends: 96877 [2019-09-08 10:55:22,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:55:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96877 states. [2019-09-08 10:55:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96877 to 41897. [2019-09-08 10:55:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41897 states. [2019-09-08 10:55:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41897 states to 41897 states and 61698 transitions. [2019-09-08 10:55:40,293 INFO L78 Accepts]: Start accepts. Automaton has 41897 states and 61698 transitions. Word has length 77 [2019-09-08 10:55:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:40,293 INFO L475 AbstractCegarLoop]: Abstraction has 41897 states and 61698 transitions. [2019-09-08 10:55:40,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 41897 states and 61698 transitions. [2019-09-08 10:55:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:55:40,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:40,297 INFO L399 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] [2019-09-08 10:55:40,297 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:40,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1238767409, now seen corresponding path program 1 times [2019-09-08 10:55:40,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:40,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:40,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:55:40,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:40,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:55:40,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:55:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:55:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:55:40,436 INFO L87 Difference]: Start difference. First operand 41897 states and 61698 transitions. Second operand 3 states. [2019-09-08 10:56:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:07,819 INFO L93 Difference]: Finished difference Result 112301 states and 166874 transitions. [2019-09-08 10:56:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:56:07,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:56:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:07,917 INFO L225 Difference]: With dead ends: 112301 [2019-09-08 10:56:07,918 INFO L226 Difference]: Without dead ends: 71354 [2019-09-08 10:56:07,957 INFO L628 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-09-08 10:56:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71354 states. [2019-09-08 10:56:30,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71354 to 55108. [2019-09-08 10:56:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-08 10:56:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81784 transitions. [2019-09-08 10:56:30,220 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81784 transitions. Word has length 77 [2019-09-08 10:56:30,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:30,220 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81784 transitions. [2019-09-08 10:56:30,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:56:30,220 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81784 transitions. [2019-09-08 10:56:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:56:30,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:30,223 INFO L399 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] [2019-09-08 10:56:30,223 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 145235885, now seen corresponding path program 1 times [2019-09-08 10:56:30,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:30,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:30,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:30,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:30,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:56:30,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:56:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:56:30,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:56:30,432 INFO L87 Difference]: Start difference. First operand 55108 states and 81784 transitions. Second operand 10 states. [2019-09-08 10:57:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:19,745 INFO L93 Difference]: Finished difference Result 117424 states and 172727 transitions. [2019-09-08 10:57:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:57:19,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-09-08 10:57:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:19,883 INFO L225 Difference]: With dead ends: 117424 [2019-09-08 10:57:19,883 INFO L226 Difference]: Without dead ends: 116050 [2019-09-08 10:57:19,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:57:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116050 states. [2019-09-08 10:57:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116050 to 55108. [2019-09-08 10:57:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-08 10:57:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81783 transitions. [2019-09-08 10:57:43,045 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81783 transitions. Word has length 78 [2019-09-08 10:57:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:43,045 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81783 transitions. [2019-09-08 10:57:43,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:57:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81783 transitions. [2019-09-08 10:57:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:57:43,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:43,048 INFO L399 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] [2019-09-08 10:57:43,049 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash 125712707, now seen corresponding path program 1 times [2019-09-08 10:57:43,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:43,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:43,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:43,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:43,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:43,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:43,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:57:43,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:57:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:57:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:57:43,195 INFO L87 Difference]: Start difference. First operand 55108 states and 81783 transitions. Second operand 9 states. [2019-09-08 10:58:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:37,781 INFO L93 Difference]: Finished difference Result 130456 states and 193648 transitions. [2019-09-08 10:58:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:58:37,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:58:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:37,932 INFO L225 Difference]: With dead ends: 130456 [2019-09-08 10:58:37,932 INFO L226 Difference]: Without dead ends: 129196 [2019-09-08 10:58:37,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:58:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129196 states. [2019-09-08 10:59:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129196 to 55108. [2019-09-08 10:59:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-08 10:59:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81782 transitions. [2019-09-08 10:59:01,260 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81782 transitions. Word has length 78 [2019-09-08 10:59:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:01,260 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81782 transitions. [2019-09-08 10:59:01,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:59:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81782 transitions. [2019-09-08 10:59:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:59:01,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:01,263 INFO L399 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] [2019-09-08 10:59:01,264 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1261749334, now seen corresponding path program 1 times [2019-09-08 10:59:01,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:01,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:01,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:01,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:59:01,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:59:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:59:01,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:01,415 INFO L87 Difference]: Start difference. First operand 55108 states and 81782 transitions. Second operand 9 states. [2019-09-08 10:59:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:43,049 INFO L93 Difference]: Finished difference Result 98860 states and 146337 transitions. [2019-09-08 10:59:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:59:43,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:59:43,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:43,161 INFO L225 Difference]: With dead ends: 98860 [2019-09-08 10:59:43,162 INFO L226 Difference]: Without dead ends: 97581 [2019-09-08 10:59:43,181 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:59:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97581 states. [2019-09-08 11:00:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97581 to 55108. [2019-09-08 11:00:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-08 11:00:04,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81781 transitions. [2019-09-08 11:00:04,495 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81781 transitions. Word has length 78 [2019-09-08 11:00:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:04,495 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81781 transitions. [2019-09-08 11:00:04,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:00:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81781 transitions. [2019-09-08 11:00:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:00:04,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:04,499 INFO L399 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] [2019-09-08 11:00:04,499 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448037, now seen corresponding path program 1 times [2019-09-08 11:00:04,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:04,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:04,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:04,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:04,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:04,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:00:04,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:00:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:00:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:00:04,649 INFO L87 Difference]: Start difference. First operand 55108 states and 81781 transitions. Second operand 9 states. [2019-09-08 11:00:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:47,919 INFO L93 Difference]: Finished difference Result 98881 states and 146361 transitions. [2019-09-08 11:00:47,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:00:47,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 11:00:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:48,028 INFO L225 Difference]: With dead ends: 98881 [2019-09-08 11:00:48,028 INFO L226 Difference]: Without dead ends: 97581 [2019-09-08 11:00:48,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:00:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97581 states. [2019-09-08 11:01:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97581 to 55108. [2019-09-08 11:01:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-08 11:01:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81779 transitions. [2019-09-08 11:01:09,639 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81779 transitions. Word has length 78 [2019-09-08 11:01:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:09,639 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81779 transitions. [2019-09-08 11:01:09,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:01:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81779 transitions. [2019-09-08 11:01:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:01:09,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:09,642 INFO L399 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] [2019-09-08 11:01:09,643 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash -54132195, now seen corresponding path program 1 times [2019-09-08 11:01:09,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:09,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:09,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:09,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:09,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:01:09,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:01:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:01:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:01:09,814 INFO L87 Difference]: Start difference. First operand 55108 states and 81779 transitions. Second operand 9 states. [2019-09-08 11:02:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:05,004 INFO L93 Difference]: Finished difference Result 130458 states and 193646 transitions. [2019-09-08 11:02:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:02:05,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 11:02:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:05,164 INFO L225 Difference]: With dead ends: 130458 [2019-09-08 11:02:05,164 INFO L226 Difference]: Without dead ends: 129196 [2019-09-08 11:02:05,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:02:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129196 states. [2019-09-08 11:02:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129196 to 55108. [2019-09-08 11:02:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55108 states. [2019-09-08 11:02:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55108 states to 55108 states and 81777 transitions. [2019-09-08 11:02:28,839 INFO L78 Accepts]: Start accepts. Automaton has 55108 states and 81777 transitions. Word has length 78 [2019-09-08 11:02:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:28,839 INFO L475 AbstractCegarLoop]: Abstraction has 55108 states and 81777 transitions. [2019-09-08 11:02:28,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:02:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 55108 states and 81777 transitions. [2019-09-08 11:02:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:02:28,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:28,844 INFO L399 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] [2019-09-08 11:02:28,844 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1470820597, now seen corresponding path program 1 times [2019-09-08 11:02:28,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:28,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:28,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:28,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:28,927 INFO L87 Difference]: Start difference. First operand 55108 states and 81777 transitions. Second operand 3 states. [2019-09-08 11:03:09,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:09,460 INFO L93 Difference]: Finished difference Result 153562 states and 229018 transitions. [2019-09-08 11:03:09,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:03:09,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 11:03:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:09,587 INFO L225 Difference]: With dead ends: 153562 [2019-09-08 11:03:09,588 INFO L226 Difference]: Without dead ends: 100250 [2019-09-08 11:03:09,630 INFO L628 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-09-08 11:03:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100250 states. [2019-09-08 11:03:42,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100250 to 69224. [2019-09-08 11:03:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69224 states. [2019-09-08 11:03:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69224 states to 69224 states and 101691 transitions. [2019-09-08 11:03:42,443 INFO L78 Accepts]: Start accepts. Automaton has 69224 states and 101691 transitions. Word has length 78 [2019-09-08 11:03:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:42,443 INFO L475 AbstractCegarLoop]: Abstraction has 69224 states and 101691 transitions. [2019-09-08 11:03:42,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:03:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 69224 states and 101691 transitions. [2019-09-08 11:03:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:03:42,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:42,446 INFO L399 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] [2019-09-08 11:03:42,446 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash 176888478, now seen corresponding path program 1 times [2019-09-08 11:03:42,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:42,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:42,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:42,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-09-08 11:03:42,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:42,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:03:42,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:03:42,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:03:42,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:03:42,609 INFO L87 Difference]: Start difference. First operand 69224 states and 101691 transitions. Second operand 9 states.