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_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:44:09,757 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:44:09,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:44:09,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:44:09,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:44:09,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:44:09,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:44:09,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:44:09,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:44:09,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:44:09,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:44:09,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:44:09,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:44:09,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:44:09,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:44:09,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:44:09,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:44:09,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:44:09,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:44:09,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:44:09,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:44:09,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:44:09,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:44:09,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:44:09,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:44:09,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:44:09,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:44:09,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:44:09,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:44:09,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:44:09,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:44:09,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:44:09,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:44:09,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:44:09,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:44:09,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:44:09,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:44:09,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:44:09,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:44:09,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:44:09,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:44:09,820 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:44:09,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:44:09,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:44:09,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:44:09,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:44:09,837 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:44:09,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:44:09,837 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:44:09,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:44:09,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:44:09,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:44:09,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:44:09,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:44:09,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:44:09,839 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:44:09,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:44:09,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:44:09,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:44:09,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:44:09,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:44:09,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:44:09,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:44:09,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:44:09,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:44:09,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:44:09,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:44:09,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:44:09,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:44:09,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:44:09,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:44:10,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:44:10,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:44:10,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:44:10,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:44:10,161 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:44:10,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:44:10,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00ca1d7d/b859538220bd47dcaaa209c11322696a/FLAGbe23b4436 [2019-10-14 23:44:10,821 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:44:10,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:44:10,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00ca1d7d/b859538220bd47dcaaa209c11322696a/FLAGbe23b4436 [2019-10-14 23:44:11,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a00ca1d7d/b859538220bd47dcaaa209c11322696a [2019-10-14 23:44:11,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:44:11,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:44:11,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:11,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:44:11,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:44:11,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:11,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e550fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11, skipping insertion in model container [2019-10-14 23:44:11,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:11,123 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:44:11,190 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:44:11,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:11,753 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:44:11,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:44:11,976 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:44:11,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11 WrapperNode [2019-10-14 23:44:11,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:44:11,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:44:11,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:44:11,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:44:11,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:11,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:12,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:12,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:12,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:12,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:12,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... [2019-10-14 23:44:12,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:44:12,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:44:12,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:44:12,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:44:12,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:44:12,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:44:12,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:44:12,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:44:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:44:12,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:44:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-14 23:44:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-14 23:44:12,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:44:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-14 23:44:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-14 23:44:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-14 23:44:12,168 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-14 23:44:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-14 23:44:12,169 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-14 23:44:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-14 23:44:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:44:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:44:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:44:13,533 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:44:13,534 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:44:13,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:13 BoogieIcfgContainer [2019-10-14 23:44:13,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:44:13,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:44:13,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:44:13,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:44:13,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:44:11" (1/3) ... [2019-10-14 23:44:13,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c49a00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:13, skipping insertion in model container [2019-10-14 23:44:13,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:44:11" (2/3) ... [2019-10-14 23:44:13,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c49a00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:44:13, skipping insertion in model container [2019-10-14 23:44:13,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:44:13" (3/3) ... [2019-10-14 23:44:13,545 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-14 23:44:13,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:44:13,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:44:13,576 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:44:13,608 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:44:13,608 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:44:13,609 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:44:13,609 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:44:13,609 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:44:13,609 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:44:13,609 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:44:13,609 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:44:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states. [2019-10-14 23:44:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-14 23:44:13,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:13,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:13,657 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1545579630, now seen corresponding path program 1 times [2019-10-14 23:44:13,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:13,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041545869] [2019-10-14 23:44:13,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:13,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:13,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:14,625 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:14,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041545869] [2019-10-14 23:44:14,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:14,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:14,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724747181] [2019-10-14 23:44:14,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:14,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:14,760 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 4 states. [2019-10-14 23:44:15,051 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-10-14 23:44:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:16,683 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2019-10-14 23:44:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:16,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-14 23:44:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:16,707 INFO L225 Difference]: With dead ends: 569 [2019-10-14 23:44:16,708 INFO L226 Difference]: Without dead ends: 465 [2019-10-14 23:44:16,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:16,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-14 23:44:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-10-14 23:44:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-14 23:44:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 686 transitions. [2019-10-14 23:44:16,814 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 686 transitions. Word has length 145 [2019-10-14 23:44:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:16,815 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 686 transitions. [2019-10-14 23:44:16,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 686 transitions. [2019-10-14 23:44:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-14 23:44:16,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:16,819 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:16,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:16,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1852792009, now seen corresponding path program 1 times [2019-10-14 23:44:16,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:16,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662288358] [2019-10-14 23:44:16,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:16,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:16,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:17,432 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:17,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662288358] [2019-10-14 23:44:17,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:17,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:17,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104460414] [2019-10-14 23:44:17,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:17,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:17,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:17,492 INFO L87 Difference]: Start difference. First operand 463 states and 686 transitions. Second operand 5 states. [2019-10-14 23:44:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:19,641 INFO L93 Difference]: Finished difference Result 1349 states and 1997 transitions. [2019-10-14 23:44:19,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:19,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-14 23:44:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:19,647 INFO L225 Difference]: With dead ends: 1349 [2019-10-14 23:44:19,648 INFO L226 Difference]: Without dead ends: 899 [2019-10-14 23:44:19,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-14 23:44:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 897. [2019-10-14 23:44:19,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-10-14 23:44:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1319 transitions. [2019-10-14 23:44:19,714 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1319 transitions. Word has length 145 [2019-10-14 23:44:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:19,714 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1319 transitions. [2019-10-14 23:44:19,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1319 transitions. [2019-10-14 23:44:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-14 23:44:19,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:19,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:19,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1132437897, now seen corresponding path program 1 times [2019-10-14 23:44:19,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:19,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922567821] [2019-10-14 23:44:19,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:19,720 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:19,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:20,076 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:20,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922567821] [2019-10-14 23:44:20,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:20,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:20,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036381971] [2019-10-14 23:44:20,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:20,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:20,157 INFO L87 Difference]: Start difference. First operand 897 states and 1319 transitions. Second operand 4 states. [2019-10-14 23:44:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:22,490 INFO L93 Difference]: Finished difference Result 2645 states and 3887 transitions. [2019-10-14 23:44:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:22,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-14 23:44:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:22,501 INFO L225 Difference]: With dead ends: 2645 [2019-10-14 23:44:22,501 INFO L226 Difference]: Without dead ends: 1780 [2019-10-14 23:44:22,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-10-14 23:44:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 899. [2019-10-14 23:44:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-14 23:44:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1321 transitions. [2019-10-14 23:44:22,580 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1321 transitions. Word has length 146 [2019-10-14 23:44:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:22,580 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1321 transitions. [2019-10-14 23:44:22,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1321 transitions. [2019-10-14 23:44:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-14 23:44:22,589 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:22,589 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:22,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:22,590 INFO L82 PathProgramCache]: Analyzing trace with hash 18878169, now seen corresponding path program 1 times [2019-10-14 23:44:22,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:22,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627324092] [2019-10-14 23:44:22,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:22,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:22,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:23,026 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:23,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627324092] [2019-10-14 23:44:23,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:23,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:23,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227311354] [2019-10-14 23:44:23,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:23,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:23,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:23,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:23,119 INFO L87 Difference]: Start difference. First operand 899 states and 1321 transitions. Second operand 4 states. [2019-10-14 23:44:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:25,366 INFO L93 Difference]: Finished difference Result 2451 states and 3620 transitions. [2019-10-14 23:44:25,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:25,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-14 23:44:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:25,379 INFO L225 Difference]: With dead ends: 2451 [2019-10-14 23:44:25,379 INFO L226 Difference]: Without dead ends: 1734 [2019-10-14 23:44:25,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-14 23:44:25,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-10-14 23:44:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-14 23:44:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2523 transitions. [2019-10-14 23:44:25,503 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2523 transitions. Word has length 147 [2019-10-14 23:44:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:25,504 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2523 transitions. [2019-10-14 23:44:25,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2523 transitions. [2019-10-14 23:44:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-14 23:44:25,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:25,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:25,512 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1632040732, now seen corresponding path program 1 times [2019-10-14 23:44:25,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:25,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988818776] [2019-10-14 23:44:25,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:25,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:25,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:26,195 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:26,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-10-14 23:44:26,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988818776] [2019-10-14 23:44:26,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:26,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:26,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116750074] [2019-10-14 23:44:26,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:26,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:26,254 INFO L87 Difference]: Start difference. First operand 1732 states and 2523 transitions. Second operand 5 states. [2019-10-14 23:44:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:27,518 INFO L93 Difference]: Finished difference Result 2881 states and 4212 transitions. [2019-10-14 23:44:27,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:27,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-14 23:44:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:27,530 INFO L225 Difference]: With dead ends: 2881 [2019-10-14 23:44:27,531 INFO L226 Difference]: Without dead ends: 1321 [2019-10-14 23:44:27,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-10-14 23:44:27,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-10-14 23:44:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-10-14 23:44:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1916 transitions. [2019-10-14 23:44:27,628 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1916 transitions. Word has length 147 [2019-10-14 23:44:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:27,631 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1916 transitions. [2019-10-14 23:44:27,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1916 transitions. [2019-10-14 23:44:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-14 23:44:27,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:27,639 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:27,641 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:27,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1705432715, now seen corresponding path program 1 times [2019-10-14 23:44:27,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:27,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268045671] [2019-10-14 23:44:27,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:27,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:27,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:28,299 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:28,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268045671] [2019-10-14 23:44:28,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:28,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:44:28,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231952763] [2019-10-14 23:44:28,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:44:28,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:44:28,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:44:28,432 INFO L87 Difference]: Start difference. First operand 1321 states and 1916 transitions. Second operand 9 states. [2019-10-14 23:44:28,722 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-10-14 23:44:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:30,780 INFO L93 Difference]: Finished difference Result 3867 states and 5900 transitions. [2019-10-14 23:44:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-14 23:44:30,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-10-14 23:44:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:30,794 INFO L225 Difference]: With dead ends: 3867 [2019-10-14 23:44:30,795 INFO L226 Difference]: Without dead ends: 2751 [2019-10-14 23:44:30,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:44:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-10-14 23:44:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1652. [2019-10-14 23:44:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-10-14 23:44:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2413 transitions. [2019-10-14 23:44:30,910 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2413 transitions. Word has length 150 [2019-10-14 23:44:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:30,911 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2413 transitions. [2019-10-14 23:44:30,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:44:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2413 transitions. [2019-10-14 23:44:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-14 23:44:30,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:30,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:30,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash -912214424, now seen corresponding path program 1 times [2019-10-14 23:44:30,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:30,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561907969] [2019-10-14 23:44:30,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:30,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:30,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:31,319 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:31,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-10-14 23:44:31,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561907969] [2019-10-14 23:44:31,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:31,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:31,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282630801] [2019-10-14 23:44:31,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:31,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:31,369 INFO L87 Difference]: Start difference. First operand 1652 states and 2413 transitions. Second operand 5 states. [2019-10-14 23:44:33,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:33,399 INFO L93 Difference]: Finished difference Result 4332 states and 6340 transitions. [2019-10-14 23:44:33,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:33,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-14 23:44:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:33,413 INFO L225 Difference]: With dead ends: 4332 [2019-10-14 23:44:33,413 INFO L226 Difference]: Without dead ends: 2703 [2019-10-14 23:44:33,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-10-14 23:44:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2701. [2019-10-14 23:44:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-10-14 23:44:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3924 transitions. [2019-10-14 23:44:33,587 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3924 transitions. Word has length 150 [2019-10-14 23:44:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:33,588 INFO L462 AbstractCegarLoop]: Abstraction has 2701 states and 3924 transitions. [2019-10-14 23:44:33,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3924 transitions. [2019-10-14 23:44:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-14 23:44:33,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:33,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:33,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1681251574, now seen corresponding path program 1 times [2019-10-14 23:44:33,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:33,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717641583] [2019-10-14 23:44:33,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:33,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:33,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:33,941 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:33,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717641583] [2019-10-14 23:44:33,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:33,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:33,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421135766] [2019-10-14 23:44:33,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:33,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:33,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:33,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:33,990 INFO L87 Difference]: Start difference. First operand 2701 states and 3924 transitions. Second operand 4 states. [2019-10-14 23:44:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:36,425 INFO L93 Difference]: Finished difference Result 7038 states and 10298 transitions. [2019-10-14 23:44:36,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:44:36,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-14 23:44:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:36,446 INFO L225 Difference]: With dead ends: 7038 [2019-10-14 23:44:36,446 INFO L226 Difference]: Without dead ends: 4666 [2019-10-14 23:44:36,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-10-14 23:44:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4664. [2019-10-14 23:44:36,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-10-14 23:44:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 6720 transitions. [2019-10-14 23:44:36,796 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 6720 transitions. Word has length 152 [2019-10-14 23:44:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:36,797 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 6720 transitions. [2019-10-14 23:44:36,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 6720 transitions. [2019-10-14 23:44:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-14 23:44:36,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:36,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:36,804 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:36,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:36,805 INFO L82 PathProgramCache]: Analyzing trace with hash -344412185, now seen corresponding path program 1 times [2019-10-14 23:44:36,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:36,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634213855] [2019-10-14 23:44:36,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:36,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:36,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:37,205 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:37,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634213855] [2019-10-14 23:44:37,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:37,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:37,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572492157] [2019-10-14 23:44:37,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:37,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:37,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:37,249 INFO L87 Difference]: Start difference. First operand 4664 states and 6720 transitions. Second operand 5 states. [2019-10-14 23:44:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:38,527 INFO L93 Difference]: Finished difference Result 7769 states and 11256 transitions. [2019-10-14 23:44:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:38,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-14 23:44:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:38,547 INFO L225 Difference]: With dead ends: 7769 [2019-10-14 23:44:38,547 INFO L226 Difference]: Without dead ends: 4098 [2019-10-14 23:44:38,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:44:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-10-14 23:44:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-10-14 23:44:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-10-14 23:44:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5895 transitions. [2019-10-14 23:44:38,791 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5895 transitions. Word has length 152 [2019-10-14 23:44:38,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:38,791 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 5895 transitions. [2019-10-14 23:44:38,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:44:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5895 transitions. [2019-10-14 23:44:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-14 23:44:38,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:38,797 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:38,798 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:38,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash 71132805, now seen corresponding path program 1 times [2019-10-14 23:44:38,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:38,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10227598] [2019-10-14 23:44:38,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:38,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:38,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:39,062 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:39,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10227598] [2019-10-14 23:44:39,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:39,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:44:39,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942432401] [2019-10-14 23:44:39,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:44:39,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:44:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:44:39,097 INFO L87 Difference]: Start difference. First operand 4098 states and 5895 transitions. Second operand 4 states. [2019-10-14 23:44:39,338 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-10-14 23:44:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:44:40,837 INFO L93 Difference]: Finished difference Result 10865 states and 15855 transitions. [2019-10-14 23:44:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:44:40,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-14 23:44:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:44:40,870 INFO L225 Difference]: With dead ends: 10865 [2019-10-14 23:44:40,870 INFO L226 Difference]: Without dead ends: 7902 [2019-10-14 23:44:40,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2019-10-14 23:44:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7900. [2019-10-14 23:44:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-10-14 23:44:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11351 transitions. [2019-10-14 23:44:41,433 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11351 transitions. Word has length 155 [2019-10-14 23:44:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:44:41,433 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 11351 transitions. [2019-10-14 23:44:41,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:44:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11351 transitions. [2019-10-14 23:44:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-14 23:44:41,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:44:41,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:44:41,448 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:44:41,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:44:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1126763328, now seen corresponding path program 1 times [2019-10-14 23:44:41,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:44:41,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117295560] [2019-10-14 23:44:41,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:41,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:44:41,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:44:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:41,889 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-14 23:44:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:44:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:44:41,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117295560] [2019-10-14 23:44:41,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:44:41,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:44:41,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126944192] [2019-10-14 23:44:41,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:44:41,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:44:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:44:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:44:41,943 INFO L87 Difference]: Start difference. First operand 7900 states and 11351 transitions. Second operand 5 states.