/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:50:23,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:50:23,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:50:23,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:50:23,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:50:23,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:50:23,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:50:23,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:50:23,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:50:23,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:50:23,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:50:23,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:50:23,892 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:50:23,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:50:23,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:50:23,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:50:23,896 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:50:23,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:50:23,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:50:23,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:50:23,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:50:23,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:50:23,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:50:23,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:50:23,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:50:23,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:50:23,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:50:23,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:50:23,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:50:23,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:50:23,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:50:23,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:50:23,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:50:23,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:50:23,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:50:23,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:50:23,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:50:23,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:50:23,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:50:23,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:50:23,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:50:23,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:50:23,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:50:23,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:50:23,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:50:23,945 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:50:23,945 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:50:23,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:50:23,950 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:50:23,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:50:23,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:50:23,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:50:23,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:50:23,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:50:23,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:50:23,951 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:50:23,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:50:23,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:50:23,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:50:23,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:50:23,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:50:23,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:50:23,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:50:23,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:50:23,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:50:23,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:50:23,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:50:23,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:50:23,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:50:23,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:50:23,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:50:23,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:50:24,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:50:24,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:50:24,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:50:24,241 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:50:24,241 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:50:24,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-11-23 22:50:24,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27881f09/3fb73a13c906497a8f49f4ee1dd68602/FLAGc36e09afc [2019-11-23 22:50:24,769 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:50:24,773 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.06.cil.c [2019-11-23 22:50:24,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27881f09/3fb73a13c906497a8f49f4ee1dd68602/FLAGc36e09afc [2019-11-23 22:50:25,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27881f09/3fb73a13c906497a8f49f4ee1dd68602 [2019-11-23 22:50:25,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:50:25,156 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:50:25,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:25,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:50:25,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:50:25,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b998ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25, skipping insertion in model container [2019-11-23 22:50:25,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:50:25,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:50:25,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:25,499 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:50:25,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:50:25,703 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:50:25,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25 WrapperNode [2019-11-23 22:50:25,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:50:25,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:25,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:50:25,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:50:25,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:50:25,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:50:25,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:50:25,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:50:25,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... [2019-11-23 22:50:25,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:50:25,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:50:25,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:50:25,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:50:25,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:50:26,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:50:26,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:50:27,742 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:50:27,743 INFO L284 CfgBuilder]: Removed 218 assume(true) statements. [2019-11-23 22:50:27,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:27 BoogieIcfgContainer [2019-11-23 22:50:27,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:50:27,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:50:27,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:50:27,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:50:27,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:50:25" (1/3) ... [2019-11-23 22:50:27,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4556bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:27, skipping insertion in model container [2019-11-23 22:50:27,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:25" (2/3) ... [2019-11-23 22:50:27,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4556bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:27, skipping insertion in model container [2019-11-23 22:50:27,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:27" (3/3) ... [2019-11-23 22:50:27,754 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2019-11-23 22:50:27,764 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:50:27,775 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:50:27,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:50:27,820 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:50:27,820 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:50:27,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:50:27,820 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:50:27,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:50:27,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:50:27,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:50:27,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:50:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states. [2019-11-23 22:50:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:27,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:27,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:27,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:27,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1446466990, now seen corresponding path program 1 times [2019-11-23 22:50:27,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:27,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364453626] [2019-11-23 22:50:27,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:28,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364453626] [2019-11-23 22:50:28,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:28,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:28,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497058935] [2019-11-23 22:50:28,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:28,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:28,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:28,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,116 INFO L87 Difference]: Start difference. First operand 612 states. Second operand 3 states. [2019-11-23 22:50:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:28,223 INFO L93 Difference]: Finished difference Result 1219 states and 1883 transitions. [2019-11-23 22:50:28,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:28,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:28,245 INFO L225 Difference]: With dead ends: 1219 [2019-11-23 22:50:28,245 INFO L226 Difference]: Without dead ends: 608 [2019-11-23 22:50:28,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-11-23 22:50:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-11-23 22:50:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-11-23 22:50:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 919 transitions. [2019-11-23 22:50:28,333 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 919 transitions. Word has length 97 [2019-11-23 22:50:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:28,334 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 919 transitions. [2019-11-23 22:50:28,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 919 transitions. [2019-11-23 22:50:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:28,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:28,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:28,339 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash -562958000, now seen corresponding path program 1 times [2019-11-23 22:50:28,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:28,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93796658] [2019-11-23 22:50:28,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:28,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93796658] [2019-11-23 22:50:28,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:28,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:28,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462061972] [2019-11-23 22:50:28,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:28,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:28,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,460 INFO L87 Difference]: Start difference. First operand 608 states and 919 transitions. Second operand 3 states. [2019-11-23 22:50:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:28,601 INFO L93 Difference]: Finished difference Result 1678 states and 2529 transitions. [2019-11-23 22:50:28,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:28,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:28,608 INFO L225 Difference]: With dead ends: 1678 [2019-11-23 22:50:28,609 INFO L226 Difference]: Without dead ends: 1081 [2019-11-23 22:50:28,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-11-23 22:50:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2019-11-23 22:50:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1615 transitions. [2019-11-23 22:50:28,671 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1615 transitions. Word has length 97 [2019-11-23 22:50:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:28,672 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1615 transitions. [2019-11-23 22:50:28,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1615 transitions. [2019-11-23 22:50:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:28,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:28,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:28,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:28,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1257513425, now seen corresponding path program 1 times [2019-11-23 22:50:28,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:28,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713665753] [2019-11-23 22:50:28,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:28,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713665753] [2019-11-23 22:50:28,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:28,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:28,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804502602] [2019-11-23 22:50:28,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:28,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:28,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,742 INFO L87 Difference]: Start difference. First operand 1079 states and 1615 transitions. Second operand 3 states. [2019-11-23 22:50:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:28,799 INFO L93 Difference]: Finished difference Result 2146 states and 3211 transitions. [2019-11-23 22:50:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:28,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:28,806 INFO L225 Difference]: With dead ends: 2146 [2019-11-23 22:50:28,806 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:28,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1607 transitions. [2019-11-23 22:50:28,856 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1607 transitions. Word has length 97 [2019-11-23 22:50:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:28,857 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1607 transitions. [2019-11-23 22:50:28,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1607 transitions. [2019-11-23 22:50:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:28,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:28,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:28,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:28,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash 538513, now seen corresponding path program 1 times [2019-11-23 22:50:28,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:28,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853024609] [2019-11-23 22:50:28,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:28,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853024609] [2019-11-23 22:50:28,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:28,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:28,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799178967] [2019-11-23 22:50:28,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:28,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,920 INFO L87 Difference]: Start difference. First operand 1079 states and 1607 transitions. Second operand 3 states. [2019-11-23 22:50:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:28,980 INFO L93 Difference]: Finished difference Result 2144 states and 3192 transitions. [2019-11-23 22:50:28,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:28,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:28,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:28,986 INFO L225 Difference]: With dead ends: 2144 [2019-11-23 22:50:28,987 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:28,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1599 transitions. [2019-11-23 22:50:29,031 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1599 transitions. Word has length 97 [2019-11-23 22:50:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:29,031 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1599 transitions. [2019-11-23 22:50:29,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1599 transitions. [2019-11-23 22:50:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:29,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:29,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:29,033 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:29,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash -492389039, now seen corresponding path program 1 times [2019-11-23 22:50:29,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:29,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069966250] [2019-11-23 22:50:29,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:29,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069966250] [2019-11-23 22:50:29,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:29,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:29,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549844904] [2019-11-23 22:50:29,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:29,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:29,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:29,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,120 INFO L87 Difference]: Start difference. First operand 1079 states and 1599 transitions. Second operand 3 states. [2019-11-23 22:50:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,180 INFO L93 Difference]: Finished difference Result 2143 states and 3175 transitions. [2019-11-23 22:50:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,187 INFO L225 Difference]: With dead ends: 2143 [2019-11-23 22:50:29,187 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:29,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:29,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1591 transitions. [2019-11-23 22:50:29,232 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1591 transitions. Word has length 97 [2019-11-23 22:50:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:29,232 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1591 transitions. [2019-11-23 22:50:29,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1591 transitions. [2019-11-23 22:50:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:29,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:29,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:29,234 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash 322994065, now seen corresponding path program 1 times [2019-11-23 22:50:29,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:29,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614674946] [2019-11-23 22:50:29,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:29,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614674946] [2019-11-23 22:50:29,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:29,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:29,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611504283] [2019-11-23 22:50:29,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:29,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,293 INFO L87 Difference]: Start difference. First operand 1079 states and 1591 transitions. Second operand 3 states. [2019-11-23 22:50:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,352 INFO L93 Difference]: Finished difference Result 2142 states and 3158 transitions. [2019-11-23 22:50:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,358 INFO L225 Difference]: With dead ends: 2142 [2019-11-23 22:50:29,358 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:29,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1583 transitions. [2019-11-23 22:50:29,416 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1583 transitions. Word has length 97 [2019-11-23 22:50:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:29,418 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1583 transitions. [2019-11-23 22:50:29,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1583 transitions. [2019-11-23 22:50:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:29,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:29,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:29,420 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash -481987247, now seen corresponding path program 1 times [2019-11-23 22:50:29,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:29,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510383207] [2019-11-23 22:50:29,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:29,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510383207] [2019-11-23 22:50:29,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:29,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:29,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472701736] [2019-11-23 22:50:29,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:29,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,497 INFO L87 Difference]: Start difference. First operand 1079 states and 1583 transitions. Second operand 3 states. [2019-11-23 22:50:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,559 INFO L93 Difference]: Finished difference Result 2141 states and 3141 transitions. [2019-11-23 22:50:29,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,566 INFO L225 Difference]: With dead ends: 2141 [2019-11-23 22:50:29,566 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:29,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1575 transitions. [2019-11-23 22:50:29,637 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1575 transitions. Word has length 97 [2019-11-23 22:50:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:29,637 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1575 transitions. [2019-11-23 22:50:29,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1575 transitions. [2019-11-23 22:50:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:29,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:29,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:29,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1477785711, now seen corresponding path program 1 times [2019-11-23 22:50:29,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:29,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820993658] [2019-11-23 22:50:29,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:29,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820993658] [2019-11-23 22:50:29,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:29,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:29,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894616169] [2019-11-23 22:50:29,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:29,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:29,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,684 INFO L87 Difference]: Start difference. First operand 1079 states and 1575 transitions. Second operand 3 states. [2019-11-23 22:50:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,765 INFO L93 Difference]: Finished difference Result 2140 states and 3124 transitions. [2019-11-23 22:50:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,771 INFO L225 Difference]: With dead ends: 2140 [2019-11-23 22:50:29,771 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:29,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:29,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1553 transitions. [2019-11-23 22:50:29,819 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1553 transitions. Word has length 97 [2019-11-23 22:50:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:29,821 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1553 transitions. [2019-11-23 22:50:29,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1553 transitions. [2019-11-23 22:50:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:29,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:29,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:29,823 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1674679119, now seen corresponding path program 1 times [2019-11-23 22:50:29,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:29,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034723084] [2019-11-23 22:50:29,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:29,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-11-23 22:50:29,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034723084] [2019-11-23 22:50:29,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:29,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:29,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798970154] [2019-11-23 22:50:29,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:29,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:29,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:29,866 INFO L87 Difference]: Start difference. First operand 1079 states and 1553 transitions. Second operand 3 states. [2019-11-23 22:50:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:29,986 INFO L93 Difference]: Finished difference Result 2139 states and 3079 transitions. [2019-11-23 22:50:29,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:29,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:29,995 INFO L225 Difference]: With dead ends: 2139 [2019-11-23 22:50:29,995 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:29,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1531 transitions. [2019-11-23 22:50:30,061 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1531 transitions. Word has length 97 [2019-11-23 22:50:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:30,061 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1531 transitions. [2019-11-23 22:50:30,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1531 transitions. [2019-11-23 22:50:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:30,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:30,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:30,065 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:30,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1485529776, now seen corresponding path program 1 times [2019-11-23 22:50:30,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:30,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029845127] [2019-11-23 22:50:30,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:30,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029845127] [2019-11-23 22:50:30,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:30,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:30,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889717828] [2019-11-23 22:50:30,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:30,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:30,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:30,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,134 INFO L87 Difference]: Start difference. First operand 1079 states and 1531 transitions. Second operand 3 states. [2019-11-23 22:50:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:30,322 INFO L93 Difference]: Finished difference Result 2138 states and 3034 transitions. [2019-11-23 22:50:30,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:30,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:30,330 INFO L225 Difference]: With dead ends: 2138 [2019-11-23 22:50:30,331 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:30,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:30,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:30,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1509 transitions. [2019-11-23 22:50:30,406 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1509 transitions. Word has length 97 [2019-11-23 22:50:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:30,417 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1509 transitions. [2019-11-23 22:50:30,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1509 transitions. [2019-11-23 22:50:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:30,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:30,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:30,422 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 734904209, now seen corresponding path program 1 times [2019-11-23 22:50:30,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:30,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638622638] [2019-11-23 22:50:30,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:30,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638622638] [2019-11-23 22:50:30,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:30,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:30,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280548267] [2019-11-23 22:50:30,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:30,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,478 INFO L87 Difference]: Start difference. First operand 1079 states and 1509 transitions. Second operand 3 states. [2019-11-23 22:50:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:30,600 INFO L93 Difference]: Finished difference Result 2136 states and 2987 transitions. [2019-11-23 22:50:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:30,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:30,608 INFO L225 Difference]: With dead ends: 2136 [2019-11-23 22:50:30,609 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:30,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:30,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1487 transitions. [2019-11-23 22:50:30,685 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1487 transitions. Word has length 97 [2019-11-23 22:50:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:30,686 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1487 transitions. [2019-11-23 22:50:30,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1487 transitions. [2019-11-23 22:50:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:30,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:30,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:30,689 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash 978799442, now seen corresponding path program 1 times [2019-11-23 22:50:30,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:30,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490198185] [2019-11-23 22:50:30,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:30,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490198185] [2019-11-23 22:50:30,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:30,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:30,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147527889] [2019-11-23 22:50:30,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:30,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:30,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:30,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,731 INFO L87 Difference]: Start difference. First operand 1079 states and 1487 transitions. Second operand 3 states. [2019-11-23 22:50:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:30,830 INFO L93 Difference]: Finished difference Result 2135 states and 2942 transitions. [2019-11-23 22:50:30,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:30,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:30,836 INFO L225 Difference]: With dead ends: 2135 [2019-11-23 22:50:30,836 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:30,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1465 transitions. [2019-11-23 22:50:30,892 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1465 transitions. Word has length 97 [2019-11-23 22:50:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1465 transitions. [2019-11-23 22:50:30,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1465 transitions. [2019-11-23 22:50:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:30,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:30,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:30,894 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:30,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:30,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1895255442, now seen corresponding path program 1 times [2019-11-23 22:50:30,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:30,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95344320] [2019-11-23 22:50:30,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:30,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95344320] [2019-11-23 22:50:30,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:30,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:30,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182234661] [2019-11-23 22:50:30,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:30,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:30,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:30,973 INFO L87 Difference]: Start difference. First operand 1079 states and 1465 transitions. Second operand 3 states. [2019-11-23 22:50:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:31,068 INFO L93 Difference]: Finished difference Result 2145 states and 2910 transitions. [2019-11-23 22:50:31,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:31,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:31,075 INFO L225 Difference]: With dead ends: 2145 [2019-11-23 22:50:31,076 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:31,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:31,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:31,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1457 transitions. [2019-11-23 22:50:31,132 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1457 transitions. Word has length 97 [2019-11-23 22:50:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:31,133 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1457 transitions. [2019-11-23 22:50:31,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1457 transitions. [2019-11-23 22:50:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:31,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:31,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:31,135 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:31,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:31,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1917887696, now seen corresponding path program 1 times [2019-11-23 22:50:31,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:31,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207193706] [2019-11-23 22:50:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:31,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207193706] [2019-11-23 22:50:31,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:31,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:31,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141634275] [2019-11-23 22:50:31,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:31,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:31,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,191 INFO L87 Difference]: Start difference. First operand 1079 states and 1457 transitions. Second operand 3 states. [2019-11-23 22:50:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:31,286 INFO L93 Difference]: Finished difference Result 2137 states and 2886 transitions. [2019-11-23 22:50:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:31,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:31,292 INFO L225 Difference]: With dead ends: 2137 [2019-11-23 22:50:31,293 INFO L226 Difference]: Without dead ends: 1079 [2019-11-23 22:50:31,295 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-23 22:50:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-23 22:50:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-23 22:50:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1435 transitions. [2019-11-23 22:50:31,344 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1435 transitions. Word has length 97 [2019-11-23 22:50:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:31,345 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1435 transitions. [2019-11-23 22:50:31,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1435 transitions. [2019-11-23 22:50:31,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:50:31,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:31,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:31,346 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash 2136742414, now seen corresponding path program 1 times [2019-11-23 22:50:31,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:31,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162868064] [2019-11-23 22:50:31,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:31,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162868064] [2019-11-23 22:50:31,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:31,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:31,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313382772] [2019-11-23 22:50:31,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:31,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,387 INFO L87 Difference]: Start difference. First operand 1079 states and 1435 transitions. Second operand 3 states. [2019-11-23 22:50:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:31,533 INFO L93 Difference]: Finished difference Result 3090 states and 4090 transitions. [2019-11-23 22:50:31,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:31,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:50:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:31,545 INFO L225 Difference]: With dead ends: 3090 [2019-11-23 22:50:31,545 INFO L226 Difference]: Without dead ends: 2096 [2019-11-23 22:50:31,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-11-23 22:50:31,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2004. [2019-11-23 22:50:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2004 states. [2019-11-23 22:50:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2635 transitions. [2019-11-23 22:50:31,696 INFO L78 Accepts]: Start accepts. Automaton has 2004 states and 2635 transitions. Word has length 97 [2019-11-23 22:50:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:31,696 INFO L462 AbstractCegarLoop]: Abstraction has 2004 states and 2635 transitions. [2019-11-23 22:50:31,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2004 states and 2635 transitions. [2019-11-23 22:50:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:50:31,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:31,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:31,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:31,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1565375973, now seen corresponding path program 1 times [2019-11-23 22:50:31,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:31,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957694555] [2019-11-23 22:50:31,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:31,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957694555] [2019-11-23 22:50:31,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:31,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:31,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843186098] [2019-11-23 22:50:31,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:31,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,743 INFO L87 Difference]: Start difference. First operand 2004 states and 2635 transitions. Second operand 3 states. [2019-11-23 22:50:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:31,914 INFO L93 Difference]: Finished difference Result 5582 states and 7337 transitions. [2019-11-23 22:50:31,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:31,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:50:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:31,932 INFO L225 Difference]: With dead ends: 5582 [2019-11-23 22:50:31,933 INFO L226 Difference]: Without dead ends: 3744 [2019-11-23 22:50:31,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:31,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2019-11-23 22:50:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3590. [2019-11-23 22:50:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-11-23 22:50:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 4700 transitions. [2019-11-23 22:50:32,102 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 4700 transitions. Word has length 98 [2019-11-23 22:50:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:32,102 INFO L462 AbstractCegarLoop]: Abstraction has 3590 states and 4700 transitions. [2019-11-23 22:50:32,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 4700 transitions. [2019-11-23 22:50:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:50:32,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:32,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:32,105 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:32,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:32,105 INFO L82 PathProgramCache]: Analyzing trace with hash -899648987, now seen corresponding path program 1 times [2019-11-23 22:50:32,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:32,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760923396] [2019-11-23 22:50:32,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:32,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760923396] [2019-11-23 22:50:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599483847] [2019-11-23 22:50:32,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:32,151 INFO L87 Difference]: Start difference. First operand 3590 states and 4700 transitions. Second operand 3 states. [2019-11-23 22:50:32,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:32,441 INFO L93 Difference]: Finished difference Result 10380 states and 13568 transitions. [2019-11-23 22:50:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:32,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:50:32,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:32,488 INFO L225 Difference]: With dead ends: 10380 [2019-11-23 22:50:32,488 INFO L226 Difference]: Without dead ends: 6956 [2019-11-23 22:50:32,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6956 states. [2019-11-23 22:50:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6956 to 6706. [2019-11-23 22:50:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-11-23 22:50:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 8738 transitions. [2019-11-23 22:50:32,910 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 8738 transitions. Word has length 99 [2019-11-23 22:50:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:32,910 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 8738 transitions. [2019-11-23 22:50:32,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 8738 transitions. [2019-11-23 22:50:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:50:32,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:32,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:32,914 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1957924123, now seen corresponding path program 1 times [2019-11-23 22:50:32,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:32,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63410834] [2019-11-23 22:50:32,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:32,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63410834] [2019-11-23 22:50:32,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:32,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:32,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335738667] [2019-11-23 22:50:32,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:32,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:32,938 INFO L87 Difference]: Start difference. First operand 6706 states and 8738 transitions. Second operand 3 states. [2019-11-23 22:50:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:33,162 INFO L93 Difference]: Finished difference Result 13170 states and 17175 transitions. [2019-11-23 22:50:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:33,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:50:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:33,176 INFO L225 Difference]: With dead ends: 13170 [2019-11-23 22:50:33,177 INFO L226 Difference]: Without dead ends: 6548 [2019-11-23 22:50:33,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2019-11-23 22:50:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6548. [2019-11-23 22:50:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2019-11-23 22:50:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 8542 transitions. [2019-11-23 22:50:33,506 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 8542 transitions. Word has length 99 [2019-11-23 22:50:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:33,507 INFO L462 AbstractCegarLoop]: Abstraction has 6548 states and 8542 transitions. [2019-11-23 22:50:33,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:33,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 8542 transitions. [2019-11-23 22:50:33,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:50:33,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:33,509 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:33,509 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:33,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash 431706625, now seen corresponding path program 1 times [2019-11-23 22:50:33,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:33,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354609204] [2019-11-23 22:50:33,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:33,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354609204] [2019-11-23 22:50:33,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:33,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:33,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185261159] [2019-11-23 22:50:33,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:33,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:33,550 INFO L87 Difference]: Start difference. First operand 6548 states and 8542 transitions. Second operand 3 states. [2019-11-23 22:50:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:33,951 INFO L93 Difference]: Finished difference Result 18954 states and 24694 transitions. [2019-11-23 22:50:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:33,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:50:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:33,980 INFO L225 Difference]: With dead ends: 18954 [2019-11-23 22:50:33,980 INFO L226 Difference]: Without dead ends: 12572 [2019-11-23 22:50:33,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2019-11-23 22:50:34,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 12186. [2019-11-23 22:50:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12186 states. [2019-11-23 22:50:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12186 states to 12186 states and 15836 transitions. [2019-11-23 22:50:34,456 INFO L78 Accepts]: Start accepts. Automaton has 12186 states and 15836 transitions. Word has length 100 [2019-11-23 22:50:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:34,456 INFO L462 AbstractCegarLoop]: Abstraction has 12186 states and 15836 transitions. [2019-11-23 22:50:34,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12186 states and 15836 transitions. [2019-11-23 22:50:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:50:34,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:34,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:34,460 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:34,461 INFO L82 PathProgramCache]: Analyzing trace with hash -311249283, now seen corresponding path program 1 times [2019-11-23 22:50:34,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:34,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493767029] [2019-11-23 22:50:34,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:34,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493767029] [2019-11-23 22:50:34,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:34,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:34,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785466115] [2019-11-23 22:50:34,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:34,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:34,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:34,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:34,483 INFO L87 Difference]: Start difference. First operand 12186 states and 15836 transitions. Second operand 3 states. [2019-11-23 22:50:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:35,230 INFO L93 Difference]: Finished difference Result 24118 states and 31359 transitions. [2019-11-23 22:50:35,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:35,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:50:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:35,254 INFO L225 Difference]: With dead ends: 24118 [2019-11-23 22:50:35,254 INFO L226 Difference]: Without dead ends: 12030 [2019-11-23 22:50:35,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12030 states. [2019-11-23 22:50:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12030 to 12030. [2019-11-23 22:50:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12030 states. [2019-11-23 22:50:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 15644 transitions. [2019-11-23 22:50:35,665 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 15644 transitions. Word has length 100 [2019-11-23 22:50:35,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:35,666 INFO L462 AbstractCegarLoop]: Abstraction has 12030 states and 15644 transitions. [2019-11-23 22:50:35,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:35,666 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 15644 transitions. [2019-11-23 22:50:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:50:35,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:35,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:35,669 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:35,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:35,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2093313545, now seen corresponding path program 1 times [2019-11-23 22:50:35,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:35,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547939243] [2019-11-23 22:50:35,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:35,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547939243] [2019-11-23 22:50:35,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:35,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:35,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164202450] [2019-11-23 22:50:35,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:35,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:35,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:35,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:35,723 INFO L87 Difference]: Start difference. First operand 12030 states and 15644 transitions. Second operand 3 states. [2019-11-23 22:50:36,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:36,367 INFO L93 Difference]: Finished difference Result 34684 states and 45044 transitions. [2019-11-23 22:50:36,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:36,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:50:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:36,399 INFO L225 Difference]: With dead ends: 34684 [2019-11-23 22:50:36,400 INFO L226 Difference]: Without dead ends: 22820 [2019-11-23 22:50:36,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:36,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22820 states. [2019-11-23 22:50:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22820 to 22274. [2019-11-23 22:50:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22274 states. [2019-11-23 22:50:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22274 states to 22274 states and 28858 transitions. [2019-11-23 22:50:37,153 INFO L78 Accepts]: Start accepts. Automaton has 22274 states and 28858 transitions. Word has length 101 [2019-11-23 22:50:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:37,153 INFO L462 AbstractCegarLoop]: Abstraction has 22274 states and 28858 transitions. [2019-11-23 22:50:37,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 22274 states and 28858 transitions. [2019-11-23 22:50:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 22:50:37,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:37,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:37,157 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash 474338631, now seen corresponding path program 1 times [2019-11-23 22:50:37,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:37,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235502203] [2019-11-23 22:50:37,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:37,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235502203] [2019-11-23 22:50:37,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:37,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:37,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984474144] [2019-11-23 22:50:37,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:37,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:37,186 INFO L87 Difference]: Start difference. First operand 22274 states and 28858 transitions. Second operand 3 states. [2019-11-23 22:50:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:37,859 INFO L93 Difference]: Finished difference Result 44282 states and 57391 transitions. [2019-11-23 22:50:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:37,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-23 22:50:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:37,888 INFO L225 Difference]: With dead ends: 44282 [2019-11-23 22:50:37,888 INFO L226 Difference]: Without dead ends: 22120 [2019-11-23 22:50:37,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:37,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22120 states. [2019-11-23 22:50:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22120 to 22120. [2019-11-23 22:50:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22120 states. [2019-11-23 22:50:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22120 states to 22120 states and 28670 transitions. [2019-11-23 22:50:39,310 INFO L78 Accepts]: Start accepts. Automaton has 22120 states and 28670 transitions. Word has length 101 [2019-11-23 22:50:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:39,311 INFO L462 AbstractCegarLoop]: Abstraction has 22120 states and 28670 transitions. [2019-11-23 22:50:39,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 22120 states and 28670 transitions. [2019-11-23 22:50:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:50:39,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:39,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:39,315 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1617049117, now seen corresponding path program 1 times [2019-11-23 22:50:39,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:39,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729367062] [2019-11-23 22:50:39,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:39,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729367062] [2019-11-23 22:50:39,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:39,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:39,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639491951] [2019-11-23 22:50:39,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:39,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:39,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:39,376 INFO L87 Difference]: Start difference. First operand 22120 states and 28670 transitions. Second operand 3 states. [2019-11-23 22:50:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:40,471 INFO L93 Difference]: Finished difference Result 63294 states and 81910 transitions. [2019-11-23 22:50:40,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:40,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:50:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:40,508 INFO L225 Difference]: With dead ends: 63294 [2019-11-23 22:50:40,508 INFO L226 Difference]: Without dead ends: 41340 [2019-11-23 22:50:40,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41340 states. [2019-11-23 22:50:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41340 to 40698. [2019-11-23 22:50:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40698 states. [2019-11-23 22:50:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40698 states to 40698 states and 52536 transitions. [2019-11-23 22:50:41,692 INFO L78 Accepts]: Start accepts. Automaton has 40698 states and 52536 transitions. Word has length 102 [2019-11-23 22:50:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:41,693 INFO L462 AbstractCegarLoop]: Abstraction has 40698 states and 52536 transitions. [2019-11-23 22:50:41,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 40698 states and 52536 transitions. [2019-11-23 22:50:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 22:50:41,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:41,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:41,696 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2051313639, now seen corresponding path program 1 times [2019-11-23 22:50:41,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:41,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474256609] [2019-11-23 22:50:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:41,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474256609] [2019-11-23 22:50:41,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:41,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:41,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582999326] [2019-11-23 22:50:41,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:41,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:41,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:41,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:41,724 INFO L87 Difference]: Start difference. First operand 40698 states and 52536 transitions. Second operand 3 states. [2019-11-23 22:50:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:44,014 INFO L93 Difference]: Finished difference Result 81118 states and 104735 transitions. [2019-11-23 22:50:44,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:44,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 22:50:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:44,051 INFO L225 Difference]: With dead ends: 81118 [2019-11-23 22:50:44,051 INFO L226 Difference]: Without dead ends: 40546 [2019-11-23 22:50:44,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-11-23 22:50:45,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 40546. [2019-11-23 22:50:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40546 states. [2019-11-23 22:50:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40546 states to 40546 states and 52352 transitions. [2019-11-23 22:50:45,225 INFO L78 Accepts]: Start accepts. Automaton has 40546 states and 52352 transitions. Word has length 102 [2019-11-23 22:50:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:45,225 INFO L462 AbstractCegarLoop]: Abstraction has 40546 states and 52352 transitions. [2019-11-23 22:50:45,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 40546 states and 52352 transitions. [2019-11-23 22:50:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 22:50:45,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:45,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:45,226 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:45,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1246479891, now seen corresponding path program 1 times [2019-11-23 22:50:45,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:45,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478524242] [2019-11-23 22:50:45,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:45,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478524242] [2019-11-23 22:50:45,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:45,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:50:45,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517585885] [2019-11-23 22:50:45,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:45,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:45,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:45,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:45,308 INFO L87 Difference]: Start difference. First operand 40546 states and 52352 transitions. Second operand 3 states. [2019-11-23 22:50:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:48,739 INFO L93 Difference]: Finished difference Result 120634 states and 155801 transitions. [2019-11-23 22:50:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:48,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-23 22:50:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:48,816 INFO L225 Difference]: With dead ends: 120634 [2019-11-23 22:50:48,816 INFO L226 Difference]: Without dead ends: 80218 [2019-11-23 22:50:48,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80218 states. [2019-11-23 22:50:50,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80218 to 79962. [2019-11-23 22:50:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79962 states. [2019-11-23 22:50:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79962 states to 79962 states and 102646 transitions. [2019-11-23 22:50:51,061 INFO L78 Accepts]: Start accepts. Automaton has 79962 states and 102646 transitions. Word has length 103 [2019-11-23 22:50:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:50:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 79962 states and 102646 transitions. [2019-11-23 22:50:51,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:50:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 79962 states and 102646 transitions. [2019-11-23 22:50:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-23 22:50:51,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:50:51,078 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:50:51,078 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:50:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:50:51,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1486765359, now seen corresponding path program 1 times [2019-11-23 22:50:51,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:50:51,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454886872] [2019-11-23 22:50:51,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:50:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:50:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:50:51,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454886872] [2019-11-23 22:50:51,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:50:51,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:50:51,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220237294] [2019-11-23 22:50:51,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:50:51,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:50:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:50:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:51,120 INFO L87 Difference]: Start difference. First operand 79962 states and 102646 transitions. Second operand 3 states. [2019-11-23 22:50:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:50:56,869 INFO L93 Difference]: Finished difference Result 238808 states and 306317 transitions. [2019-11-23 22:50:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:50:56,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-23 22:50:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:50:57,084 INFO L225 Difference]: With dead ends: 238808 [2019-11-23 22:50:57,084 INFO L226 Difference]: Without dead ends: 159010 [2019-11-23 22:50:57,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:50:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159010 states. [2019-11-23 22:51:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159010 to 159010. [2019-11-23 22:51:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159010 states. [2019-11-23 22:51:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159010 states to 159010 states and 203596 transitions. [2019-11-23 22:51:01,854 INFO L78 Accepts]: Start accepts. Automaton has 159010 states and 203596 transitions. Word has length 126 [2019-11-23 22:51:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:01,855 INFO L462 AbstractCegarLoop]: Abstraction has 159010 states and 203596 transitions. [2019-11-23 22:51:01,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 159010 states and 203596 transitions. [2019-11-23 22:51:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 22:51:01,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:01,923 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:51:01,923 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:01,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:01,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1457951616, now seen corresponding path program 1 times [2019-11-23 22:51:01,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:01,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247873854] [2019-11-23 22:51:01,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-23 22:51:01,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247873854] [2019-11-23 22:51:01,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:01,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:51:01,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454393808] [2019-11-23 22:51:01,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:51:01,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:51:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:01,992 INFO L87 Difference]: Start difference. First operand 159010 states and 203596 transitions. Second operand 3 states. [2019-11-23 22:51:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:09,688 INFO L93 Difference]: Finished difference Result 389914 states and 498910 transitions. [2019-11-23 22:51:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:09,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 22:51:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:09,922 INFO L225 Difference]: With dead ends: 389914 [2019-11-23 22:51:09,922 INFO L226 Difference]: Without dead ends: 231008 [2019-11-23 22:51:10,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231008 states. [2019-11-23 22:51:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231008 to 230494. [2019-11-23 22:51:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230494 states. [2019-11-23 22:51:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230494 states to 230494 states and 293636 transitions. [2019-11-23 22:51:23,153 INFO L78 Accepts]: Start accepts. Automaton has 230494 states and 293636 transitions. Word has length 173 [2019-11-23 22:51:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:51:23,154 INFO L462 AbstractCegarLoop]: Abstraction has 230494 states and 293636 transitions. [2019-11-23 22:51:23,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:51:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 230494 states and 293636 transitions. [2019-11-23 22:51:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 22:51:23,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:51:23,240 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:51:23,241 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:51:23,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:51:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1345889829, now seen corresponding path program 1 times [2019-11-23 22:51:23,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:51:23,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564153236] [2019-11-23 22:51:23,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:51:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:51:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 22:51:23,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564153236] [2019-11-23 22:51:23,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:51:23,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:51:23,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695268733] [2019-11-23 22:51:23,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:51:23,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:51:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:51:23,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:23,302 INFO L87 Difference]: Start difference. First operand 230494 states and 293636 transitions. Second operand 3 states. [2019-11-23 22:51:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:51:33,600 INFO L93 Difference]: Finished difference Result 565434 states and 720114 transitions. [2019-11-23 22:51:33,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:51:33,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 22:51:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:51:33,921 INFO L225 Difference]: With dead ends: 565434 [2019-11-23 22:51:33,921 INFO L226 Difference]: Without dead ends: 335068 [2019-11-23 22:51:34,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:51:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335068 states.