/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/seq-pthread/cs_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:46:23,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:46:23,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:46:23,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:46:23,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:46:23,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:46:23,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:46:23,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:46:23,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:46:23,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:46:23,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:46:23,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:46:23,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:46:23,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:46:23,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:46:23,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:46:23,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:46:23,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:46:23,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:46:23,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:46:23,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:46:23,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:46:23,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:46:23,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:46:23,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:46:23,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:46:23,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:46:23,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:46:23,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:46:23,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:46:23,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:46:23,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:46:23,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:46:23,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:46:23,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:46:23,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:46:23,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:46:23,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:46:23,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:46:23,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:46:23,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:46:23,829 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:46:23,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:46:23,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:46:23,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:46:23,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:46:23,846 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:46:23,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:46:23,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:46:23,846 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:46:23,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:46:23,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:46:23,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:46:23,847 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:46:23,847 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:46:23,847 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:46:23,848 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:46:23,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:46:23,848 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:46:23,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:46:23,848 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:46:23,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:46:23,849 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:46:23,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:46:23,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:46:23,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:46:23,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:46:23,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:46:23,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:46:23,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:46:23,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:46:23,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:46:24,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:46:24,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:46:24,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:46:24,156 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:46:24,156 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:46:24,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_lamport.i [2019-11-23 22:46:24,239 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d701947a/4a58bc9ecc9042aea10ada4b0435566a/FLAG38d2c778b [2019-11-23 22:46:24,844 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:46:24,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lamport.i [2019-11-23 22:46:24,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d701947a/4a58bc9ecc9042aea10ada4b0435566a/FLAG38d2c778b [2019-11-23 22:46:25,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d701947a/4a58bc9ecc9042aea10ada4b0435566a [2019-11-23 22:46:25,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:46:25,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:46:25,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:46:25,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:46:25,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:46:25,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:46:25" (1/1) ... [2019-11-23 22:46:25,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2780706e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:25, skipping insertion in model container [2019-11-23 22:46:25,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:46:25" (1/1) ... [2019-11-23 22:46:25,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:46:25,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:46:25,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:46:25,795 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:46:25,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:46:26,004 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:46:26,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26 WrapperNode [2019-11-23 22:46:26,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:46:26,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:46:26,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:46:26,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:46:26,016 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:46:26" (1/1) ... [2019-11-23 22:46:26,047 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:46:26" (1/1) ... [2019-11-23 22:46:26,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:46:26,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:46:26,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:46:26,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:46:26,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (1/1) ... [2019-11-23 22:46:26,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:46:26,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:46:26,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:46:26,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:46:26,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (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:46:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-23 22:46:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-23 22:46:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-23 22:46:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 22:46:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-23 22:46:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-23 22:46:26,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-23 22:46:26,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-23 22:46:26,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:46:26,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:46:30,147 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:46:30,148 INFO L284 CfgBuilder]: Removed 74 assume(true) statements. [2019-11-23 22:46:30,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:46:30 BoogieIcfgContainer [2019-11-23 22:46:30,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:46:30,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:46:30,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:46:30,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:46:30,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:46:25" (1/3) ... [2019-11-23 22:46:30,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138d815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:46:30, skipping insertion in model container [2019-11-23 22:46:30,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:46:26" (2/3) ... [2019-11-23 22:46:30,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@138d815f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:46:30, skipping insertion in model container [2019-11-23 22:46:30,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:46:30" (3/3) ... [2019-11-23 22:46:30,158 INFO L109 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2019-11-23 22:46:30,168 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:46:30,176 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:46:30,187 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:46:30,213 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:46:30,213 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:46:30,214 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:46:30,214 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:46:30,214 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:46:30,214 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:46:30,215 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:46:30,215 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:46:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2019-11-23 22:46:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:46:30,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:30,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:46:30,251 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1639723903, now seen corresponding path program 1 times [2019-11-23 22:46:30,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:30,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722684091] [2019-11-23 22:46:30,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:30,755 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:46:30,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722684091] [2019-11-23 22:46:30,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:30,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:30,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610991327] [2019-11-23 22:46:30,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:30,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:30,778 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 3 states. [2019-11-23 22:46:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:30,905 INFO L93 Difference]: Finished difference Result 234 states and 378 transitions. [2019-11-23 22:46:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:30,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-23 22:46:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:30,921 INFO L225 Difference]: With dead ends: 234 [2019-11-23 22:46:30,921 INFO L226 Difference]: Without dead ends: 116 [2019-11-23 22:46:30,925 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:46:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-23 22:46:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2019-11-23 22:46:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-23 22:46:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 180 transitions. [2019-11-23 22:46:30,976 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 180 transitions. Word has length 12 [2019-11-23 22:46:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:30,977 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 180 transitions. [2019-11-23 22:46:30,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 180 transitions. [2019-11-23 22:46:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:46:30,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:30,978 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:46:30,979 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1335455317, now seen corresponding path program 1 times [2019-11-23 22:46:30,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:30,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432284755] [2019-11-23 22:46:30,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:46:31,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432284755] [2019-11-23 22:46:31,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:31,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:31,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87256741] [2019-11-23 22:46:31,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:31,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:31,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:31,093 INFO L87 Difference]: Start difference. First operand 113 states and 180 transitions. Second operand 3 states. [2019-11-23 22:46:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:31,146 INFO L93 Difference]: Finished difference Result 225 states and 360 transitions. [2019-11-23 22:46:31,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:31,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:46:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:31,152 INFO L225 Difference]: With dead ends: 225 [2019-11-23 22:46:31,152 INFO L226 Difference]: Without dead ends: 115 [2019-11-23 22:46:31,155 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:46:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-23 22:46:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-11-23 22:46:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 22:46:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 181 transitions. [2019-11-23 22:46:31,178 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 181 transitions. Word has length 15 [2019-11-23 22:46:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:31,179 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 181 transitions. [2019-11-23 22:46:31,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 181 transitions. [2019-11-23 22:46:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:46:31,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:31,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:46:31,183 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1209488173, now seen corresponding path program 1 times [2019-11-23 22:46:31,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:31,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193751215] [2019-11-23 22:46:31,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:46:31,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193751215] [2019-11-23 22:46:31,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:31,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:31,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556692720] [2019-11-23 22:46:31,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:46:31,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:46:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:46:31,663 INFO L87 Difference]: Start difference. First operand 114 states and 181 transitions. Second operand 4 states. [2019-11-23 22:46:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:31,747 INFO L93 Difference]: Finished difference Result 201 states and 320 transitions. [2019-11-23 22:46:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:46:31,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 22:46:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:31,750 INFO L225 Difference]: With dead ends: 201 [2019-11-23 22:46:31,751 INFO L226 Difference]: Without dead ends: 190 [2019-11-23 22:46:31,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:46:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-23 22:46:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-23 22:46:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-23 22:46:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 300 transitions. [2019-11-23 22:46:31,767 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 300 transitions. Word has length 17 [2019-11-23 22:46:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:31,768 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 300 transitions. [2019-11-23 22:46:31,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:46:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 300 transitions. [2019-11-23 22:46:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:46:31,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:31,770 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] [2019-11-23 22:46:31,771 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1684253607, now seen corresponding path program 1 times [2019-11-23 22:46:31,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:31,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85104969] [2019-11-23 22:46:31,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:46:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85104969] [2019-11-23 22:46:31,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:31,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:31,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087569548] [2019-11-23 22:46:31,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:31,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:31,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:31,949 INFO L87 Difference]: Start difference. First operand 190 states and 300 transitions. Second operand 3 states. [2019-11-23 22:46:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:34,170 INFO L93 Difference]: Finished difference Result 537 states and 852 transitions. [2019-11-23 22:46:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:34,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-23 22:46:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:34,175 INFO L225 Difference]: With dead ends: 537 [2019-11-23 22:46:34,177 INFO L226 Difference]: Without dead ends: 366 [2019-11-23 22:46:34,180 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:46:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-23 22:46:34,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 323. [2019-11-23 22:46:34,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 22:46:34,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 506 transitions. [2019-11-23 22:46:34,219 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 506 transitions. Word has length 38 [2019-11-23 22:46:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:34,219 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 506 transitions. [2019-11-23 22:46:34,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 506 transitions. [2019-11-23 22:46:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:46:34,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:34,223 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] [2019-11-23 22:46:34,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash -663185253, now seen corresponding path program 1 times [2019-11-23 22:46:34,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:34,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368167440] [2019-11-23 22:46:34,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:46:34,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368167440] [2019-11-23 22:46:34,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331129720] [2019-11-23 22:46:34,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:35,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 22:46:35,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:46:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:46:35,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:46:35,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-23 22:46:35,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991350307] [2019-11-23 22:46:35,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:46:35,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:46:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:46:35,154 INFO L87 Difference]: Start difference. First operand 323 states and 506 transitions. Second operand 5 states. [2019-11-23 22:46:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:35,196 INFO L93 Difference]: Finished difference Result 646 states and 1013 transitions. [2019-11-23 22:46:35,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:46:35,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-23 22:46:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:35,199 INFO L225 Difference]: With dead ends: 646 [2019-11-23 22:46:35,199 INFO L226 Difference]: Without dead ends: 326 [2019-11-23 22:46:35,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:46:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-23 22:46:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-11-23 22:46:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-11-23 22:46:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 508 transitions. [2019-11-23 22:46:35,227 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 508 transitions. Word has length 38 [2019-11-23 22:46:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:35,227 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 508 transitions. [2019-11-23 22:46:35,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:46:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 508 transitions. [2019-11-23 22:46:35,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:46:35,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:35,237 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:46:35,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:35,443 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:35,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1068940071, now seen corresponding path program 2 times [2019-11-23 22:46:35,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:35,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913842116] [2019-11-23 22:46:35,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:35,999 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-11-23 22:46:36,181 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-23 22:46:36,348 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-23 22:46:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 22:46:36,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913842116] [2019-11-23 22:46:36,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:36,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:46:36,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392001208] [2019-11-23 22:46:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:46:36,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:46:36,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:36,386 INFO L87 Difference]: Start difference. First operand 325 states and 508 transitions. Second operand 6 states. [2019-11-23 22:46:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:39,228 INFO L93 Difference]: Finished difference Result 388 states and 598 transitions. [2019-11-23 22:46:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:46:39,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-11-23 22:46:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:39,230 INFO L225 Difference]: With dead ends: 388 [2019-11-23 22:46:39,231 INFO L226 Difference]: Without dead ends: 334 [2019-11-23 22:46:39,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:46:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-23 22:46:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-11-23 22:46:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-23 22:46:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 518 transitions. [2019-11-23 22:46:39,258 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 518 transitions. Word has length 40 [2019-11-23 22:46:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:39,258 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 518 transitions. [2019-11-23 22:46:39,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:46:39,258 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 518 transitions. [2019-11-23 22:46:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:46:39,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:39,262 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:46:39,262 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:39,263 INFO L82 PathProgramCache]: Analyzing trace with hash 788080403, now seen corresponding path program 1 times [2019-11-23 22:46:39,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:39,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732232347] [2019-11-23 22:46:39,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-23 22:46:39,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732232347] [2019-11-23 22:46:39,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:39,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:46:39,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295744519] [2019-11-23 22:46:39,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:46:39,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:46:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:46:39,445 INFO L87 Difference]: Start difference. First operand 333 states and 518 transitions. Second operand 3 states. [2019-11-23 22:46:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:39,573 INFO L93 Difference]: Finished difference Result 505 states and 784 transitions. [2019-11-23 22:46:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:46:39,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-23 22:46:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:39,578 INFO L225 Difference]: With dead ends: 505 [2019-11-23 22:46:39,578 INFO L226 Difference]: Without dead ends: 329 [2019-11-23 22:46:39,579 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:46:39,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-23 22:46:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-11-23 22:46:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-23 22:46:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 511 transitions. [2019-11-23 22:46:39,590 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 511 transitions. Word has length 40 [2019-11-23 22:46:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:39,590 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 511 transitions. [2019-11-23 22:46:39,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:46:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 511 transitions. [2019-11-23 22:46:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-23 22:46:39,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:39,591 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 22:46:39,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:39,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1017357931, now seen corresponding path program 1 times [2019-11-23 22:46:39,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:39,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868426399] [2019-11-23 22:46:39,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 22:46:40,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868426399] [2019-11-23 22:46:40,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571670212] [2019-11-23 22:46:40,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:40,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:46:40,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:46:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:46:40,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:46:40,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-23 22:46:40,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997215259] [2019-11-23 22:46:40,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:46:40,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:46:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:46:40,399 INFO L87 Difference]: Start difference. First operand 329 states and 511 transitions. Second operand 7 states. [2019-11-23 22:46:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:40,628 INFO L93 Difference]: Finished difference Result 674 states and 1044 transitions. [2019-11-23 22:46:40,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:46:40,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-23 22:46:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:40,631 INFO L225 Difference]: With dead ends: 674 [2019-11-23 22:46:40,631 INFO L226 Difference]: Without dead ends: 348 [2019-11-23 22:46:40,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:46:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-23 22:46:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2019-11-23 22:46:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-23 22:46:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 523 transitions. [2019-11-23 22:46:40,646 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 523 transitions. Word has length 40 [2019-11-23 22:46:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:40,646 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 523 transitions. [2019-11-23 22:46:40,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:46:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 523 transitions. [2019-11-23 22:46:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:46:40,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:40,648 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-11-23 22:46:40,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:40,854 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1483602939, now seen corresponding path program 2 times [2019-11-23 22:46:40,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:40,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754746399] [2019-11-23 22:46:40,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:42,478 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2019-11-23 22:46:42,679 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-11-23 22:46:42,828 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-11-23 22:46:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-23 22:46:42,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754746399] [2019-11-23 22:46:42,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:42,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:46:42,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502484776] [2019-11-23 22:46:42,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:46:42,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:42,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:46:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:42,878 INFO L87 Difference]: Start difference. First operand 340 states and 523 transitions. Second operand 6 states. [2019-11-23 22:46:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:45,659 INFO L93 Difference]: Finished difference Result 508 states and 782 transitions. [2019-11-23 22:46:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:46:45,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-23 22:46:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:45,664 INFO L225 Difference]: With dead ends: 508 [2019-11-23 22:46:45,664 INFO L226 Difference]: Without dead ends: 331 [2019-11-23 22:46:45,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:46:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-23 22:46:45,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2019-11-23 22:46:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-11-23 22:46:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 510 transitions. [2019-11-23 22:46:45,676 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 510 transitions. Word has length 51 [2019-11-23 22:46:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:45,677 INFO L462 AbstractCegarLoop]: Abstraction has 331 states and 510 transitions. [2019-11-23 22:46:45,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:46:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 510 transitions. [2019-11-23 22:46:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:46:45,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:45,678 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-11-23 22:46:45,679 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2114843715, now seen corresponding path program 1 times [2019-11-23 22:46:45,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:45,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839520563] [2019-11-23 22:46:45,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-23 22:46:46,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839520563] [2019-11-23 22:46:46,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:46,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:46:46,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791328459] [2019-11-23 22:46:46,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:46:46,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:46,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:46:46,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:46:46,346 INFO L87 Difference]: Start difference. First operand 331 states and 510 transitions. Second operand 4 states. [2019-11-23 22:46:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:46,537 INFO L93 Difference]: Finished difference Result 470 states and 720 transitions. [2019-11-23 22:46:46,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:46:46,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-23 22:46:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:46,540 INFO L225 Difference]: With dead ends: 470 [2019-11-23 22:46:46,540 INFO L226 Difference]: Without dead ends: 299 [2019-11-23 22:46:46,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:46:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-23 22:46:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2019-11-23 22:46:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-11-23 22:46:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 453 transitions. [2019-11-23 22:46:46,551 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 453 transitions. Word has length 51 [2019-11-23 22:46:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:46,552 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 453 transitions. [2019-11-23 22:46:46,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:46:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 453 transitions. [2019-11-23 22:46:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:46:46,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:46,553 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-11-23 22:46:46,553 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:46,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:46,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1362475131, now seen corresponding path program 1 times [2019-11-23 22:46:46,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:46,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696139825] [2019-11-23 22:46:46,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 22:46:48,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696139825] [2019-11-23 22:46:48,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847934066] [2019-11-23 22:46:48,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:48,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-23 22:46:48,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:46:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-23 22:46:48,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:46:48,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-23 22:46:48,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276322862] [2019-11-23 22:46:48,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:46:48,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:46:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:48,347 INFO L87 Difference]: Start difference. First operand 299 states and 453 transitions. Second operand 6 states. [2019-11-23 22:46:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:48,453 INFO L93 Difference]: Finished difference Result 586 states and 893 transitions. [2019-11-23 22:46:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:46:48,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-23 22:46:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:48,455 INFO L225 Difference]: With dead ends: 586 [2019-11-23 22:46:48,455 INFO L226 Difference]: Without dead ends: 308 [2019-11-23 22:46:48,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:46:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-23 22:46:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-11-23 22:46:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-23 22:46:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 463 transitions. [2019-11-23 22:46:48,468 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 463 transitions. Word has length 51 [2019-11-23 22:46:48,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:48,468 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 463 transitions. [2019-11-23 22:46:48,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:46:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 463 transitions. [2019-11-23 22:46:48,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:46:48,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:48,469 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:48,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:46:48,674 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:48,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:48,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1349588215, now seen corresponding path program 2 times [2019-11-23 22:46:48,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:48,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432267114] [2019-11-23 22:46:48,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:46:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:46:52,552 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-11-23 22:46:52,744 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-11-23 22:46:52,943 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-11-23 22:46:53,153 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2019-11-23 22:46:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:46:53,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432267114] [2019-11-23 22:46:53,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:46:53,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:46:53,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857738600] [2019-11-23 22:46:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:46:53,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:46:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:46:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:46:53,235 INFO L87 Difference]: Start difference. First operand 308 states and 463 transitions. Second operand 11 states. [2019-11-23 22:46:55,710 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-23 22:46:56,025 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-23 22:46:56,390 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-11-23 22:46:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:46:58,541 INFO L93 Difference]: Finished difference Result 594 states and 899 transitions. [2019-11-23 22:46:58,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:46:58,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-11-23 22:46:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:46:58,545 INFO L225 Difference]: With dead ends: 594 [2019-11-23 22:46:58,546 INFO L226 Difference]: Without dead ends: 468 [2019-11-23 22:46:58,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:46:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-23 22:46:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 316. [2019-11-23 22:46:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-23 22:46:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 474 transitions. [2019-11-23 22:46:58,563 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 474 transitions. Word has length 60 [2019-11-23 22:46:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:46:58,563 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 474 transitions. [2019-11-23 22:46:58,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:46:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 474 transitions. [2019-11-23 22:46:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:46:58,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:46:58,564 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:58,564 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:46:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:46:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1139940747, now seen corresponding path program 1 times [2019-11-23 22:46:58,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:46:58,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013082388] [2019-11-23 22:46:58,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:02,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013082388] [2019-11-23 22:47:02,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:02,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:47:02,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664618988] [2019-11-23 22:47:02,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:47:02,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:02,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:47:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:47:02,734 INFO L87 Difference]: Start difference. First operand 316 states and 474 transitions. Second operand 5 states. [2019-11-23 22:47:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:03,319 INFO L93 Difference]: Finished difference Result 772 states and 1139 transitions. [2019-11-23 22:47:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:47:03,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-23 22:47:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:03,324 INFO L225 Difference]: With dead ends: 772 [2019-11-23 22:47:03,324 INFO L226 Difference]: Without dead ends: 474 [2019-11-23 22:47:03,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:47:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-23 22:47:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 368. [2019-11-23 22:47:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-23 22:47:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 515 transitions. [2019-11-23 22:47:03,346 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 515 transitions. Word has length 60 [2019-11-23 22:47:03,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:03,346 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 515 transitions. [2019-11-23 22:47:03,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:47:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 515 transitions. [2019-11-23 22:47:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:47:03,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:03,347 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:03,348 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:03,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1363677049, now seen corresponding path program 1 times [2019-11-23 22:47:03,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:03,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434378871] [2019-11-23 22:47:03,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:04,031 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2019-11-23 22:47:04,219 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-11-23 22:47:04,454 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-23 22:47:04,628 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-23 22:47:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:04,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434378871] [2019-11-23 22:47:04,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:04,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:47:04,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105288720] [2019-11-23 22:47:04,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:47:04,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:04,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:47:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:47:04,775 INFO L87 Difference]: Start difference. First operand 368 states and 515 transitions. Second operand 12 states. [2019-11-23 22:47:07,285 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-11-23 22:47:07,482 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-11-23 22:47:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:09,100 INFO L93 Difference]: Finished difference Result 677 states and 946 transitions. [2019-11-23 22:47:09,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:47:09,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-11-23 22:47:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:09,104 INFO L225 Difference]: With dead ends: 677 [2019-11-23 22:47:09,105 INFO L226 Difference]: Without dead ends: 519 [2019-11-23 22:47:09,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-11-23 22:47:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-11-23 22:47:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 368. [2019-11-23 22:47:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-11-23 22:47:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 514 transitions. [2019-11-23 22:47:09,130 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 514 transitions. Word has length 60 [2019-11-23 22:47:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:09,132 INFO L462 AbstractCegarLoop]: Abstraction has 368 states and 514 transitions. [2019-11-23 22:47:09,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:47:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 514 transitions. [2019-11-23 22:47:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:47:09,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:09,135 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,135 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1678839526, now seen corresponding path program 1 times [2019-11-23 22:47:09,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:09,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373483132] [2019-11-23 22:47:09,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:09,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373483132] [2019-11-23 22:47:09,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:09,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:47:09,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612530694] [2019-11-23 22:47:09,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:47:09,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:09,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:47:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:47:09,320 INFO L87 Difference]: Start difference. First operand 368 states and 514 transitions. Second operand 3 states. [2019-11-23 22:47:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:09,425 INFO L93 Difference]: Finished difference Result 679 states and 970 transitions. [2019-11-23 22:47:09,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:47:09,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:47:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:09,427 INFO L225 Difference]: With dead ends: 679 [2019-11-23 22:47:09,427 INFO L226 Difference]: Without dead ends: 382 [2019-11-23 22:47:09,428 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:47:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-23 22:47:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-23 22:47:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:47:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2019-11-23 22:47:09,451 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 63 [2019-11-23 22:47:09,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:09,451 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2019-11-23 22:47:09,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:47:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2019-11-23 22:47:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:47:09,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:09,457 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,457 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:09,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash 90491624, now seen corresponding path program 1 times [2019-11-23 22:47:09,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:09,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584092913] [2019-11-23 22:47:09,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:15,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584092913] [2019-11-23 22:47:15,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:15,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:47:15,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927330820] [2019-11-23 22:47:15,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:47:15,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:47:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:47:15,520 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand 11 states. [2019-11-23 22:47:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:18,887 INFO L93 Difference]: Finished difference Result 503 states and 685 transitions. [2019-11-23 22:47:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:47:18,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-23 22:47:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:18,890 INFO L225 Difference]: With dead ends: 503 [2019-11-23 22:47:18,890 INFO L226 Difference]: Without dead ends: 409 [2019-11-23 22:47:18,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:47:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-11-23 22:47:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 382. [2019-11-23 22:47:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:47:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 524 transitions. [2019-11-23 22:47:18,910 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 524 transitions. Word has length 63 [2019-11-23 22:47:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:18,910 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 524 transitions. [2019-11-23 22:47:18,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:47:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 524 transitions. [2019-11-23 22:47:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 22:47:18,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:18,912 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,912 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash -734954826, now seen corresponding path program 1 times [2019-11-23 22:47:18,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:18,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256154869] [2019-11-23 22:47:18,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:23,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256154869] [2019-11-23 22:47:23,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:23,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:47:23,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140764694] [2019-11-23 22:47:23,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:47:23,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:23,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:47:23,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:47:23,526 INFO L87 Difference]: Start difference. First operand 382 states and 524 transitions. Second operand 6 states. [2019-11-23 22:47:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:24,176 INFO L93 Difference]: Finished difference Result 806 states and 1106 transitions. [2019-11-23 22:47:24,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:47:24,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-23 22:47:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:24,179 INFO L225 Difference]: With dead ends: 806 [2019-11-23 22:47:24,179 INFO L226 Difference]: Without dead ends: 493 [2019-11-23 22:47:24,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:47:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-11-23 22:47:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 434. [2019-11-23 22:47:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-23 22:47:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 587 transitions. [2019-11-23 22:47:24,210 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 587 transitions. Word has length 69 [2019-11-23 22:47:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:24,211 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 587 transitions. [2019-11-23 22:47:24,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:47:24,211 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 587 transitions. [2019-11-23 22:47:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 22:47:24,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:24,212 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:24,213 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:24,213 INFO L82 PathProgramCache]: Analyzing trace with hash -677696524, now seen corresponding path program 1 times [2019-11-23 22:47:24,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:24,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020375819] [2019-11-23 22:47:24,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:30,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020375819] [2019-11-23 22:47:30,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:30,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:47:30,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202086388] [2019-11-23 22:47:30,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:47:30,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:47:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:47:30,138 INFO L87 Difference]: Start difference. First operand 434 states and 587 transitions. Second operand 11 states. [2019-11-23 22:47:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:33,368 INFO L93 Difference]: Finished difference Result 474 states and 633 transitions. [2019-11-23 22:47:33,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:47:33,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-11-23 22:47:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:33,372 INFO L225 Difference]: With dead ends: 474 [2019-11-23 22:47:33,372 INFO L226 Difference]: Without dead ends: 470 [2019-11-23 22:47:33,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:47:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-23 22:47:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 442. [2019-11-23 22:47:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-11-23 22:47:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 596 transitions. [2019-11-23 22:47:33,400 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 596 transitions. Word has length 69 [2019-11-23 22:47:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:33,401 INFO L462 AbstractCegarLoop]: Abstraction has 442 states and 596 transitions. [2019-11-23 22:47:33,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:47:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 596 transitions. [2019-11-23 22:47:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 22:47:33,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:33,403 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,403 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1168578161, now seen corresponding path program 1 times [2019-11-23 22:47:33,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:33,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092271821] [2019-11-23 22:47:33,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:47:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:47:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-23 22:47:35,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092271821] [2019-11-23 22:47:35,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:47:35,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:47:35,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594189027] [2019-11-23 22:47:35,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:47:35,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:47:35,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:47:35,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:47:35,734 INFO L87 Difference]: Start difference. First operand 442 states and 596 transitions. Second operand 10 states. [2019-11-23 22:47:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:47:42,769 INFO L93 Difference]: Finished difference Result 786 states and 1060 transitions. [2019-11-23 22:47:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:47:42,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-11-23 22:47:42,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:47:42,774 INFO L225 Difference]: With dead ends: 786 [2019-11-23 22:47:42,774 INFO L226 Difference]: Without dead ends: 598 [2019-11-23 22:47:42,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:47:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-23 22:47:42,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 462. [2019-11-23 22:47:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-23 22:47:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 620 transitions. [2019-11-23 22:47:42,803 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 620 transitions. Word has length 71 [2019-11-23 22:47:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:47:42,804 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 620 transitions. [2019-11-23 22:47:42,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:47:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 620 transitions. [2019-11-23 22:47:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:47:42,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:47:42,805 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:42,805 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:47:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:47:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1409056674, now seen corresponding path program 1 times [2019-11-23 22:47:42,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:47:42,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871110826] [2019-11-23 22:47:42,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY