./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8822f5291178e45ba1da62c4d4636880280d6cc4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 19:38:40,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 19:38:40,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 19:38:40,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 19:38:40,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 19:38:40,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 19:38:40,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 19:38:40,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 19:38:40,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 19:38:40,813 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 19:38:40,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 19:38:40,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 19:38:40,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 19:38:40,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 19:38:40,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 19:38:40,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 19:38:40,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 19:38:40,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 19:38:40,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 19:38:40,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 19:38:40,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 19:38:40,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 19:38:40,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 19:38:40,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 19:38:40,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 19:38:40,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 19:38:40,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 19:38:40,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 19:38:40,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 19:38:40,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 19:38:40,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 19:38:40,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 19:38:40,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 19:38:40,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 19:38:40,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 19:38:40,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 19:38:40,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 19:38:40,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 19:38:40,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 19:38:40,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 19:38:40,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 19:38:40,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 19:38:40,928 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 19:38:40,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 19:38:40,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 19:38:40,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 19:38:40,930 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 19:38:40,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 19:38:40,931 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 19:38:40,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 19:38:40,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 19:38:40,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 19:38:40,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 19:38:40,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 19:38:40,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 19:38:40,933 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 19:38:40,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 19:38:40,933 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 19:38:40,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 19:38:40,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 19:38:40,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 19:38:40,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 19:38:40,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 19:38:40,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 19:38:40,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 19:38:40,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 19:38:40,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 19:38:40,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 19:38:40,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 19:38:40,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 19:38:40,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 19:38:40,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8822f5291178e45ba1da62c4d4636880280d6cc4 [2020-10-25 19:38:41,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 19:38:41,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 19:38:41,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 19:38:41,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 19:38:41,332 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 19:38:41,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2020-10-25 19:38:41,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5492a5e/d275dbd6f7eb4cb887bd3a4eee396595/FLAGee52710b2 [2020-10-25 19:38:42,107 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 19:38:42,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl-simplified/s3_srvr_12.cil.c [2020-10-25 19:38:42,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5492a5e/d275dbd6f7eb4cb887bd3a4eee396595/FLAGee52710b2 [2020-10-25 19:38:42,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5492a5e/d275dbd6f7eb4cb887bd3a4eee396595 [2020-10-25 19:38:42,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 19:38:42,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 19:38:42,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 19:38:42,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 19:38:42,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 19:38:42,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:38:42" (1/1) ... [2020-10-25 19:38:42,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51bcaf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:42, skipping insertion in model container [2020-10-25 19:38:42,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 07:38:42" (1/1) ... [2020-10-25 19:38:42,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 19:38:42,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 19:38:42,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:38:42,917 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 19:38:43,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 19:38:43,051 INFO L208 MainTranslator]: Completed translation [2020-10-25 19:38:43,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43 WrapperNode [2020-10-25 19:38:43,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 19:38:43,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 19:38:43,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 19:38:43,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 19:38:43,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 19:38:43,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 19:38:43,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 19:38:43,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 19:38:43,149 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (1/1) ... [2020-10-25 19:38:43,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 19:38:43,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 19:38:43,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 19:38:43,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 19:38:43,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (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 [2020-10-25 19:38:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 19:38:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 19:38:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 19:38:43,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 19:38:43,481 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-25 19:38:44,226 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2020-10-25 19:38:44,226 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2020-10-25 19:38:44,236 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 19:38:44,237 INFO L298 CfgBuilder]: Removed 9 assume(true) statements. [2020-10-25 19:38:44,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:38:44 BoogieIcfgContainer [2020-10-25 19:38:44,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 19:38:44,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 19:38:44,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 19:38:44,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 19:38:44,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 07:38:42" (1/3) ... [2020-10-25 19:38:44,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d33065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:38:44, skipping insertion in model container [2020-10-25 19:38:44,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 07:38:43" (2/3) ... [2020-10-25 19:38:44,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d33065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 07:38:44, skipping insertion in model container [2020-10-25 19:38:44,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:38:44" (3/3) ... [2020-10-25 19:38:44,256 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2020-10-25 19:38:44,267 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 19:38:44,272 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 19:38:44,286 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 19:38:44,314 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 19:38:44,314 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 19:38:44,314 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 19:38:44,315 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 19:38:44,315 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 19:38:44,315 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 19:38:44,315 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 19:38:44,315 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 19:38:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2020-10-25 19:38:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-25 19:38:44,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:44,344 INFO L422 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] [2020-10-25 19:38:44,344 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:44,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1659372905, now seen corresponding path program 1 times [2020-10-25 19:38:44,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:44,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039618617] [2020-10-25 19:38:44,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:44,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039618617] [2020-10-25 19:38:44,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:44,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:44,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857496225] [2020-10-25 19:38:44,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:44,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:44,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:44,665 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 3 states. [2020-10-25 19:38:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:45,077 INFO L93 Difference]: Finished difference Result 354 states and 614 transitions. [2020-10-25 19:38:45,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:45,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-25 19:38:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:45,093 INFO L225 Difference]: With dead ends: 354 [2020-10-25 19:38:45,094 INFO L226 Difference]: Without dead ends: 174 [2020-10-25 19:38:45,106 INFO L677 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 [2020-10-25 19:38:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-25 19:38:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2020-10-25 19:38:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-25 19:38:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 277 transitions. [2020-10-25 19:38:45,184 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 277 transitions. Word has length 28 [2020-10-25 19:38:45,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:45,184 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 277 transitions. [2020-10-25 19:38:45,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 277 transitions. [2020-10-25 19:38:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:38:45,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:45,187 INFO L422 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] [2020-10-25 19:38:45,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 19:38:45,187 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1067837001, now seen corresponding path program 1 times [2020-10-25 19:38:45,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:45,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277844965] [2020-10-25 19:38:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:45,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277844965] [2020-10-25 19:38:45,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:45,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:45,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229888834] [2020-10-25 19:38:45,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:45,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:45,265 INFO L87 Difference]: Start difference. First operand 172 states and 277 transitions. Second operand 3 states. [2020-10-25 19:38:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:45,577 INFO L93 Difference]: Finished difference Result 358 states and 575 transitions. [2020-10-25 19:38:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:45,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:38:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:45,583 INFO L225 Difference]: With dead ends: 358 [2020-10-25 19:38:45,583 INFO L226 Difference]: Without dead ends: 194 [2020-10-25 19:38:45,586 INFO L677 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 [2020-10-25 19:38:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-25 19:38:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-25 19:38:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-25 19:38:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 307 transitions. [2020-10-25 19:38:45,606 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 307 transitions. Word has length 29 [2020-10-25 19:38:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:45,606 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 307 transitions. [2020-10-25 19:38:45,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 307 transitions. [2020-10-25 19:38:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:38:45,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:45,609 INFO L422 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] [2020-10-25 19:38:45,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 19:38:45,610 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1369735938, now seen corresponding path program 1 times [2020-10-25 19:38:45,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:45,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386595320] [2020-10-25 19:38:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:45,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386595320] [2020-10-25 19:38:45,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:45,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:45,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862239601] [2020-10-25 19:38:45,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:45,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:45,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:45,752 INFO L87 Difference]: Start difference. First operand 194 states and 307 transitions. Second operand 3 states. [2020-10-25 19:38:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:46,085 INFO L93 Difference]: Finished difference Result 388 states and 616 transitions. [2020-10-25 19:38:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:46,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:38:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:46,089 INFO L225 Difference]: With dead ends: 388 [2020-10-25 19:38:46,090 INFO L226 Difference]: Without dead ends: 202 [2020-10-25 19:38:46,091 INFO L677 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 [2020-10-25 19:38:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-10-25 19:38:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2020-10-25 19:38:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-25 19:38:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2020-10-25 19:38:46,115 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 29 [2020-10-25 19:38:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:46,116 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2020-10-25 19:38:46,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2020-10-25 19:38:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-25 19:38:46,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:46,119 INFO L422 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] [2020-10-25 19:38:46,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 19:38:46,121 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1614302654, now seen corresponding path program 1 times [2020-10-25 19:38:46,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:46,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630282721] [2020-10-25 19:38:46,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:46,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630282721] [2020-10-25 19:38:46,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:46,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:46,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513788589] [2020-10-25 19:38:46,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:46,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:46,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:46,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:46,262 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2020-10-25 19:38:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:46,535 INFO L93 Difference]: Finished difference Result 393 states and 626 transitions. [2020-10-25 19:38:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:46,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-10-25 19:38:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:46,538 INFO L225 Difference]: With dead ends: 393 [2020-10-25 19:38:46,538 INFO L226 Difference]: Without dead ends: 201 [2020-10-25 19:38:46,541 INFO L677 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 [2020-10-25 19:38:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-10-25 19:38:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2020-10-25 19:38:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-10-25 19:38:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 319 transitions. [2020-10-25 19:38:46,578 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 319 transitions. Word has length 29 [2020-10-25 19:38:46,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:46,578 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 319 transitions. [2020-10-25 19:38:46,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 319 transitions. [2020-10-25 19:38:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-25 19:38:46,583 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:46,583 INFO L422 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] [2020-10-25 19:38:46,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 19:38:46,584 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:46,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:46,585 INFO L82 PathProgramCache]: Analyzing trace with hash -210698213, now seen corresponding path program 1 times [2020-10-25 19:38:46,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:46,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628120676] [2020-10-25 19:38:46,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:46,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628120676] [2020-10-25 19:38:46,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:46,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:46,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377879168] [2020-10-25 19:38:46,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:46,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:46,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:46,678 INFO L87 Difference]: Start difference. First operand 201 states and 319 transitions. Second operand 3 states. [2020-10-25 19:38:46,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:46,872 INFO L93 Difference]: Finished difference Result 404 states and 638 transitions. [2020-10-25 19:38:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:46,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-10-25 19:38:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:46,874 INFO L225 Difference]: With dead ends: 404 [2020-10-25 19:38:46,875 INFO L226 Difference]: Without dead ends: 211 [2020-10-25 19:38:46,876 INFO L677 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 [2020-10-25 19:38:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-25 19:38:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2020-10-25 19:38:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-10-25 19:38:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 317 transitions. [2020-10-25 19:38:46,904 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 317 transitions. Word has length 30 [2020-10-25 19:38:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:46,907 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 317 transitions. [2020-10-25 19:38:46,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 317 transitions. [2020-10-25 19:38:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-10-25 19:38:46,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:46,913 INFO L422 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] [2020-10-25 19:38:46,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 19:38:46,913 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -852120702, now seen corresponding path program 1 times [2020-10-25 19:38:46,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:46,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406451695] [2020-10-25 19:38:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:46,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406451695] [2020-10-25 19:38:46,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:46,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:46,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901902894] [2020-10-25 19:38:46,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:46,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:46,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:46,970 INFO L87 Difference]: Start difference. First operand 201 states and 317 transitions. Second operand 3 states. [2020-10-25 19:38:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:47,120 INFO L93 Difference]: Finished difference Result 404 states and 634 transitions. [2020-10-25 19:38:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:47,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-10-25 19:38:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:47,124 INFO L225 Difference]: With dead ends: 404 [2020-10-25 19:38:47,124 INFO L226 Difference]: Without dead ends: 211 [2020-10-25 19:38:47,125 INFO L677 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 [2020-10-25 19:38:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-25 19:38:47,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2020-10-25 19:38:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-10-25 19:38:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 315 transitions. [2020-10-25 19:38:47,148 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 315 transitions. Word has length 31 [2020-10-25 19:38:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:47,148 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 315 transitions. [2020-10-25 19:38:47,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 315 transitions. [2020-10-25 19:38:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 19:38:47,155 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:47,156 INFO L422 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] [2020-10-25 19:38:47,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 19:38:47,157 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1795373184, now seen corresponding path program 1 times [2020-10-25 19:38:47,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:47,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436741347] [2020-10-25 19:38:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:47,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436741347] [2020-10-25 19:38:47,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:47,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:47,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396370752] [2020-10-25 19:38:47,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:47,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:47,238 INFO L87 Difference]: Start difference. First operand 201 states and 315 transitions. Second operand 3 states. [2020-10-25 19:38:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:47,392 INFO L93 Difference]: Finished difference Result 404 states and 630 transitions. [2020-10-25 19:38:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:47,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2020-10-25 19:38:47,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:47,395 INFO L225 Difference]: With dead ends: 404 [2020-10-25 19:38:47,395 INFO L226 Difference]: Without dead ends: 211 [2020-10-25 19:38:47,396 INFO L677 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 [2020-10-25 19:38:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2020-10-25 19:38:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 201. [2020-10-25 19:38:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-10-25 19:38:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 313 transitions. [2020-10-25 19:38:47,406 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 313 transitions. Word has length 32 [2020-10-25 19:38:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:47,406 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 313 transitions. [2020-10-25 19:38:47,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 313 transitions. [2020-10-25 19:38:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-25 19:38:47,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:47,408 INFO L422 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] [2020-10-25 19:38:47,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 19:38:47,408 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1439838815, now seen corresponding path program 1 times [2020-10-25 19:38:47,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:47,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970499293] [2020-10-25 19:38:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:47,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970499293] [2020-10-25 19:38:47,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:47,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 19:38:47,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487565008] [2020-10-25 19:38:47,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 19:38:47,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:47,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 19:38:47,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 19:38:47,516 INFO L87 Difference]: Start difference. First operand 201 states and 313 transitions. Second operand 4 states. [2020-10-25 19:38:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:47,828 INFO L93 Difference]: Finished difference Result 600 states and 930 transitions. [2020-10-25 19:38:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 19:38:47,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-10-25 19:38:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:47,832 INFO L225 Difference]: With dead ends: 600 [2020-10-25 19:38:47,832 INFO L226 Difference]: Without dead ends: 407 [2020-10-25 19:38:47,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 19:38:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-25 19:38:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 383. [2020-10-25 19:38:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-25 19:38:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 595 transitions. [2020-10-25 19:38:47,854 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 595 transitions. Word has length 32 [2020-10-25 19:38:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:47,854 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 595 transitions. [2020-10-25 19:38:47,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 19:38:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 595 transitions. [2020-10-25 19:38:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-25 19:38:47,856 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:47,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:47,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 19:38:47,856 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash -443745160, now seen corresponding path program 1 times [2020-10-25 19:38:47,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:47,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717875791] [2020-10-25 19:38:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:47,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717875791] [2020-10-25 19:38:47,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:47,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:47,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005944110] [2020-10-25 19:38:47,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:47,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:47,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:47,912 INFO L87 Difference]: Start difference. First operand 383 states and 595 transitions. Second operand 3 states. [2020-10-25 19:38:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:48,146 INFO L93 Difference]: Finished difference Result 842 states and 1324 transitions. [2020-10-25 19:38:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:48,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-10-25 19:38:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:48,150 INFO L225 Difference]: With dead ends: 842 [2020-10-25 19:38:48,151 INFO L226 Difference]: Without dead ends: 467 [2020-10-25 19:38:48,152 INFO L677 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 [2020-10-25 19:38:48,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-10-25 19:38:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 449. [2020-10-25 19:38:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-10-25 19:38:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 710 transitions. [2020-10-25 19:38:48,177 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 710 transitions. Word has length 44 [2020-10-25 19:38:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:48,178 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 710 transitions. [2020-10-25 19:38:48,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 710 transitions. [2020-10-25 19:38:48,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-25 19:38:48,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:48,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:48,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 19:38:48,180 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 974176282, now seen corresponding path program 1 times [2020-10-25 19:38:48,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:48,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375316578] [2020-10-25 19:38:48,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:48,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375316578] [2020-10-25 19:38:48,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:48,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:48,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851693431] [2020-10-25 19:38:48,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:48,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:48,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:48,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:48,229 INFO L87 Difference]: Start difference. First operand 449 states and 710 transitions. Second operand 3 states. [2020-10-25 19:38:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:48,455 INFO L93 Difference]: Finished difference Result 931 states and 1482 transitions. [2020-10-25 19:38:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:48,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-10-25 19:38:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:48,459 INFO L225 Difference]: With dead ends: 931 [2020-10-25 19:38:48,460 INFO L226 Difference]: Without dead ends: 490 [2020-10-25 19:38:48,461 INFO L677 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 [2020-10-25 19:38:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-25 19:38:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2020-10-25 19:38:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-25 19:38:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 753 transitions. [2020-10-25 19:38:48,486 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 753 transitions. Word has length 45 [2020-10-25 19:38:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:48,486 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 753 transitions. [2020-10-25 19:38:48,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 753 transitions. [2020-10-25 19:38:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-10-25 19:38:48,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:48,489 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:48,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 19:38:48,489 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:48,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1540899075, now seen corresponding path program 1 times [2020-10-25 19:38:48,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:48,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072564457] [2020-10-25 19:38:48,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 19:38:48,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072564457] [2020-10-25 19:38:48,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:48,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:48,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502855578] [2020-10-25 19:38:48,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:48,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:48,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:48,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:48,586 INFO L87 Difference]: Start difference. First operand 472 states and 753 transitions. Second operand 3 states. [2020-10-25 19:38:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:48,809 INFO L93 Difference]: Finished difference Result 988 states and 1578 transitions. [2020-10-25 19:38:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:48,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-10-25 19:38:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:48,815 INFO L225 Difference]: With dead ends: 988 [2020-10-25 19:38:48,815 INFO L226 Difference]: Without dead ends: 524 [2020-10-25 19:38:48,817 INFO L677 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 [2020-10-25 19:38:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-10-25 19:38:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2020-10-25 19:38:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-10-25 19:38:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 804 transitions. [2020-10-25 19:38:48,847 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 804 transitions. Word has length 56 [2020-10-25 19:38:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:48,847 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 804 transitions. [2020-10-25 19:38:48,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 804 transitions. [2020-10-25 19:38:48,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-25 19:38:48,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:48,850 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:48,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 19:38:48,850 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:48,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1188180310, now seen corresponding path program 1 times [2020-10-25 19:38:48,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:48,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764144433] [2020-10-25 19:38:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 19:38:48,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764144433] [2020-10-25 19:38:48,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:48,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:48,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979756672] [2020-10-25 19:38:48,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:48,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:48,916 INFO L87 Difference]: Start difference. First operand 506 states and 804 transitions. Second operand 3 states. [2020-10-25 19:38:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:49,111 INFO L93 Difference]: Finished difference Result 1022 states and 1626 transitions. [2020-10-25 19:38:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:49,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-10-25 19:38:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:49,117 INFO L225 Difference]: With dead ends: 1022 [2020-10-25 19:38:49,117 INFO L226 Difference]: Without dead ends: 524 [2020-10-25 19:38:49,118 INFO L677 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 [2020-10-25 19:38:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-10-25 19:38:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 506. [2020-10-25 19:38:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2020-10-25 19:38:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 801 transitions. [2020-10-25 19:38:49,158 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 801 transitions. Word has length 57 [2020-10-25 19:38:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:49,158 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 801 transitions. [2020-10-25 19:38:49,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 801 transitions. [2020-10-25 19:38:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-25 19:38:49,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:49,160 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:49,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 19:38:49,161 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:49,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2067348000, now seen corresponding path program 1 times [2020-10-25 19:38:49,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:49,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60076620] [2020-10-25 19:38:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-25 19:38:49,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60076620] [2020-10-25 19:38:49,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:49,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:49,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307678333] [2020-10-25 19:38:49,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:49,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:49,227 INFO L87 Difference]: Start difference. First operand 506 states and 801 transitions. Second operand 3 states. [2020-10-25 19:38:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:49,397 INFO L93 Difference]: Finished difference Result 1069 states and 1697 transitions. [2020-10-25 19:38:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:49,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-10-25 19:38:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:49,402 INFO L225 Difference]: With dead ends: 1069 [2020-10-25 19:38:49,402 INFO L226 Difference]: Without dead ends: 571 [2020-10-25 19:38:49,404 INFO L677 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 [2020-10-25 19:38:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2020-10-25 19:38:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2020-10-25 19:38:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2020-10-25 19:38:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 898 transitions. [2020-10-25 19:38:49,434 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 898 transitions. Word has length 57 [2020-10-25 19:38:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:49,438 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 898 transitions. [2020-10-25 19:38:49,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 898 transitions. [2020-10-25 19:38:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 19:38:49,440 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:49,440 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:49,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 19:38:49,440 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash -583256949, now seen corresponding path program 1 times [2020-10-25 19:38:49,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:49,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027436953] [2020-10-25 19:38:49,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:49,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027436953] [2020-10-25 19:38:49,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:49,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:49,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341885456] [2020-10-25 19:38:49,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:49,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:49,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:49,540 INFO L87 Difference]: Start difference. First operand 569 states and 898 transitions. Second operand 3 states. [2020-10-25 19:38:49,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:49,787 INFO L93 Difference]: Finished difference Result 1179 states and 1859 transitions. [2020-10-25 19:38:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:49,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-10-25 19:38:49,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:49,792 INFO L225 Difference]: With dead ends: 1179 [2020-10-25 19:38:49,792 INFO L226 Difference]: Without dead ends: 618 [2020-10-25 19:38:49,793 INFO L677 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 [2020-10-25 19:38:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-25 19:38:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2020-10-25 19:38:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-25 19:38:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 962 transitions. [2020-10-25 19:38:49,827 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 962 transitions. Word has length 79 [2020-10-25 19:38:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:49,827 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 962 transitions. [2020-10-25 19:38:49,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 962 transitions. [2020-10-25 19:38:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-25 19:38:49,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:49,830 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:49,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 19:38:49,830 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1357251849, now seen corresponding path program 1 times [2020-10-25 19:38:49,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:49,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845563456] [2020-10-25 19:38:49,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 19:38:49,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845563456] [2020-10-25 19:38:49,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:49,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:49,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582922603] [2020-10-25 19:38:49,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:49,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:49,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:49,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:49,894 INFO L87 Difference]: Start difference. First operand 612 states and 962 transitions. Second operand 3 states. [2020-10-25 19:38:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:50,139 INFO L93 Difference]: Finished difference Result 1222 states and 1920 transitions. [2020-10-25 19:38:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:50,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-10-25 19:38:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:50,144 INFO L225 Difference]: With dead ends: 1222 [2020-10-25 19:38:50,144 INFO L226 Difference]: Without dead ends: 618 [2020-10-25 19:38:50,146 INFO L677 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 [2020-10-25 19:38:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-25 19:38:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2020-10-25 19:38:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-25 19:38:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 959 transitions. [2020-10-25 19:38:50,184 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 959 transitions. Word has length 80 [2020-10-25 19:38:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:50,184 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 959 transitions. [2020-10-25 19:38:50,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 959 transitions. [2020-10-25 19:38:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-10-25 19:38:50,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:50,187 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:50,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 19:38:50,187 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2054627548, now seen corresponding path program 1 times [2020-10-25 19:38:50,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:50,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939588572] [2020-10-25 19:38:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-25 19:38:50,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939588572] [2020-10-25 19:38:50,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:50,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:50,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245431506] [2020-10-25 19:38:50,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:50,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:50,239 INFO L87 Difference]: Start difference. First operand 612 states and 959 transitions. Second operand 3 states. [2020-10-25 19:38:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:50,435 INFO L93 Difference]: Finished difference Result 1218 states and 1908 transitions. [2020-10-25 19:38:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:50,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2020-10-25 19:38:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:50,439 INFO L225 Difference]: With dead ends: 1218 [2020-10-25 19:38:50,439 INFO L226 Difference]: Without dead ends: 614 [2020-10-25 19:38:50,441 INFO L677 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 [2020-10-25 19:38:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2020-10-25 19:38:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2020-10-25 19:38:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-25 19:38:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 954 transitions. [2020-10-25 19:38:50,477 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 954 transitions. Word has length 85 [2020-10-25 19:38:50,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:50,477 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 954 transitions. [2020-10-25 19:38:50,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 954 transitions. [2020-10-25 19:38:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-25 19:38:50,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:50,479 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:50,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 19:38:50,480 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1047765588, now seen corresponding path program 1 times [2020-10-25 19:38:50,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:50,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054065914] [2020-10-25 19:38:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-25 19:38:50,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054065914] [2020-10-25 19:38:50,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:50,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:50,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900274884] [2020-10-25 19:38:50,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:50,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:50,532 INFO L87 Difference]: Start difference. First operand 612 states and 954 transitions. Second operand 3 states. [2020-10-25 19:38:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:50,726 INFO L93 Difference]: Finished difference Result 1276 states and 1991 transitions. [2020-10-25 19:38:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:50,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-10-25 19:38:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:50,731 INFO L225 Difference]: With dead ends: 1276 [2020-10-25 19:38:50,731 INFO L226 Difference]: Without dead ends: 672 [2020-10-25 19:38:50,733 INFO L677 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 [2020-10-25 19:38:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-10-25 19:38:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644. [2020-10-25 19:38:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-10-25 19:38:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 997 transitions. [2020-10-25 19:38:50,779 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 997 transitions. Word has length 93 [2020-10-25 19:38:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:50,779 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 997 transitions. [2020-10-25 19:38:50,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:50,779 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 997 transitions. [2020-10-25 19:38:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-10-25 19:38:50,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:50,781 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-10-25 19:38:50,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 19:38:50,782 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:50,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:50,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1111400187, now seen corresponding path program 1 times [2020-10-25 19:38:50,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:50,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83037063] [2020-10-25 19:38:50,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-10-25 19:38:50,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83037063] [2020-10-25 19:38:50,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:50,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:50,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990403071] [2020-10-25 19:38:50,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:50,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:50,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:50,834 INFO L87 Difference]: Start difference. First operand 644 states and 997 transitions. Second operand 3 states. [2020-10-25 19:38:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:51,038 INFO L93 Difference]: Finished difference Result 1308 states and 2028 transitions. [2020-10-25 19:38:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:51,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-10-25 19:38:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:51,043 INFO L225 Difference]: With dead ends: 1308 [2020-10-25 19:38:51,043 INFO L226 Difference]: Without dead ends: 672 [2020-10-25 19:38:51,045 INFO L677 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 [2020-10-25 19:38:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2020-10-25 19:38:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 644. [2020-10-25 19:38:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-10-25 19:38:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 991 transitions. [2020-10-25 19:38:51,082 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 991 transitions. Word has length 94 [2020-10-25 19:38:51,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:51,082 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 991 transitions. [2020-10-25 19:38:51,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 991 transitions. [2020-10-25 19:38:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-10-25 19:38:51,085 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:51,085 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:51,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 19:38:51,086 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:51,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash -51700436, now seen corresponding path program 1 times [2020-10-25 19:38:51,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:51,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701183656] [2020-10-25 19:38:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-25 19:38:51,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701183656] [2020-10-25 19:38:51,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:51,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:51,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220591878] [2020-10-25 19:38:51,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:51,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:51,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:51,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:51,139 INFO L87 Difference]: Start difference. First operand 644 states and 991 transitions. Second operand 3 states. [2020-10-25 19:38:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:51,367 INFO L93 Difference]: Finished difference Result 1344 states and 2068 transitions. [2020-10-25 19:38:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-10-25 19:38:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:51,372 INFO L225 Difference]: With dead ends: 1344 [2020-10-25 19:38:51,372 INFO L226 Difference]: Without dead ends: 708 [2020-10-25 19:38:51,374 INFO L677 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 [2020-10-25 19:38:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2020-10-25 19:38:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2020-10-25 19:38:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-10-25 19:38:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2020-10-25 19:38:51,422 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2020-10-25 19:38:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:51,423 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2020-10-25 19:38:51,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2020-10-25 19:38:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-25 19:38:51,425 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:51,425 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:51,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 19:38:51,425 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:51,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:51,426 INFO L82 PathProgramCache]: Analyzing trace with hash -530812530, now seen corresponding path program 1 times [2020-10-25 19:38:51,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:51,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583162503] [2020-10-25 19:38:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-25 19:38:51,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583162503] [2020-10-25 19:38:51,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:51,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:51,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669189192] [2020-10-25 19:38:51,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:51,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:51,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:51,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:51,482 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2020-10-25 19:38:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:51,742 INFO L93 Difference]: Finished difference Result 1401 states and 2150 transitions. [2020-10-25 19:38:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:51,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-10-25 19:38:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:51,747 INFO L225 Difference]: With dead ends: 1401 [2020-10-25 19:38:51,748 INFO L226 Difference]: Without dead ends: 709 [2020-10-25 19:38:51,749 INFO L677 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 [2020-10-25 19:38:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2020-10-25 19:38:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 697. [2020-10-25 19:38:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-10-25 19:38:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1068 transitions. [2020-10-25 19:38:51,787 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1068 transitions. Word has length 101 [2020-10-25 19:38:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:51,787 INFO L481 AbstractCegarLoop]: Abstraction has 697 states and 1068 transitions. [2020-10-25 19:38:51,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1068 transitions. [2020-10-25 19:38:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-10-25 19:38:51,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:51,790 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:51,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 19:38:51,790 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1306174224, now seen corresponding path program 1 times [2020-10-25 19:38:51,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:51,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549258314] [2020-10-25 19:38:51,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-25 19:38:51,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549258314] [2020-10-25 19:38:51,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:51,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:51,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84872462] [2020-10-25 19:38:51,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:51,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:51,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:51,854 INFO L87 Difference]: Start difference. First operand 697 states and 1068 transitions. Second operand 3 states. [2020-10-25 19:38:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:52,077 INFO L93 Difference]: Finished difference Result 1433 states and 2192 transitions. [2020-10-25 19:38:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:52,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2020-10-25 19:38:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:52,083 INFO L225 Difference]: With dead ends: 1433 [2020-10-25 19:38:52,084 INFO L226 Difference]: Without dead ends: 744 [2020-10-25 19:38:52,086 INFO L677 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 [2020-10-25 19:38:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2020-10-25 19:38:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2020-10-25 19:38:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2020-10-25 19:38:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1123 transitions. [2020-10-25 19:38:52,134 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1123 transitions. Word has length 112 [2020-10-25 19:38:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:52,134 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 1123 transitions. [2020-10-25 19:38:52,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1123 transitions. [2020-10-25 19:38:52,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-25 19:38:52,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:52,137 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:52,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 19:38:52,138 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash -142977294, now seen corresponding path program 1 times [2020-10-25 19:38:52,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:52,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407819981] [2020-10-25 19:38:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-10-25 19:38:52,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407819981] [2020-10-25 19:38:52,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:52,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:52,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283971599] [2020-10-25 19:38:52,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:52,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:52,204 INFO L87 Difference]: Start difference. First operand 738 states and 1123 transitions. Second operand 3 states. [2020-10-25 19:38:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:52,439 INFO L93 Difference]: Finished difference Result 1474 states and 2242 transitions. [2020-10-25 19:38:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-10-25 19:38:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:52,445 INFO L225 Difference]: With dead ends: 1474 [2020-10-25 19:38:52,445 INFO L226 Difference]: Without dead ends: 744 [2020-10-25 19:38:52,447 INFO L677 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 [2020-10-25 19:38:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2020-10-25 19:38:52,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 738. [2020-10-25 19:38:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2020-10-25 19:38:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1118 transitions. [2020-10-25 19:38:52,489 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1118 transitions. Word has length 113 [2020-10-25 19:38:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:52,489 INFO L481 AbstractCegarLoop]: Abstraction has 738 states and 1118 transitions. [2020-10-25 19:38:52,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1118 transitions. [2020-10-25 19:38:52,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-25 19:38:52,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:52,492 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2020-10-25 19:38:52,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 19:38:52,492 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1809562376, now seen corresponding path program 1 times [2020-10-25 19:38:52,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:52,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904575775] [2020-10-25 19:38:52,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-10-25 19:38:52,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904575775] [2020-10-25 19:38:52,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:52,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:52,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137390623] [2020-10-25 19:38:52,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:52,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:52,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:52,539 INFO L87 Difference]: Start difference. First operand 738 states and 1118 transitions. Second operand 3 states. [2020-10-25 19:38:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:52,736 INFO L93 Difference]: Finished difference Result 1510 states and 2285 transitions. [2020-10-25 19:38:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:52,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2020-10-25 19:38:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:52,742 INFO L225 Difference]: With dead ends: 1510 [2020-10-25 19:38:52,743 INFO L226 Difference]: Without dead ends: 780 [2020-10-25 19:38:52,744 INFO L677 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 [2020-10-25 19:38:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-25 19:38:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2020-10-25 19:38:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-10-25 19:38:52,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1156 transitions. [2020-10-25 19:38:52,787 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1156 transitions. Word has length 115 [2020-10-25 19:38:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:52,788 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1156 transitions. [2020-10-25 19:38:52,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1156 transitions. [2020-10-25 19:38:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-25 19:38:52,790 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:52,791 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-10-25 19:38:52,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 19:38:52,791 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash 172042817, now seen corresponding path program 1 times [2020-10-25 19:38:52,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:52,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597816081] [2020-10-25 19:38:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-10-25 19:38:52,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597816081] [2020-10-25 19:38:52,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:52,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:52,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323531070] [2020-10-25 19:38:52,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:52,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:52,836 INFO L87 Difference]: Start difference. First operand 770 states and 1156 transitions. Second operand 3 states. [2020-10-25 19:38:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:53,017 INFO L93 Difference]: Finished difference Result 1542 states and 2314 transitions. [2020-10-25 19:38:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:53,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-10-25 19:38:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:53,023 INFO L225 Difference]: With dead ends: 1542 [2020-10-25 19:38:53,023 INFO L226 Difference]: Without dead ends: 780 [2020-10-25 19:38:53,025 INFO L677 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 [2020-10-25 19:38:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-25 19:38:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 770. [2020-10-25 19:38:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2020-10-25 19:38:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1147 transitions. [2020-10-25 19:38:53,078 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1147 transitions. Word has length 116 [2020-10-25 19:38:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:53,078 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1147 transitions. [2020-10-25 19:38:53,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1147 transitions. [2020-10-25 19:38:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-25 19:38:53,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:53,082 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:53,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 19:38:53,082 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1961382768, now seen corresponding path program 1 times [2020-10-25 19:38:53,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:53,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294535213] [2020-10-25 19:38:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-10-25 19:38:53,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294535213] [2020-10-25 19:38:53,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:53,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:53,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969282235] [2020-10-25 19:38:53,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:53,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:53,136 INFO L87 Difference]: Start difference. First operand 770 states and 1147 transitions. Second operand 3 states. [2020-10-25 19:38:53,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:53,349 INFO L93 Difference]: Finished difference Result 1568 states and 2335 transitions. [2020-10-25 19:38:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:53,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2020-10-25 19:38:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:53,355 INFO L225 Difference]: With dead ends: 1568 [2020-10-25 19:38:53,356 INFO L226 Difference]: Without dead ends: 806 [2020-10-25 19:38:53,358 INFO L677 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 [2020-10-25 19:38:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-10-25 19:38:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798. [2020-10-25 19:38:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-10-25 19:38:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1178 transitions. [2020-10-25 19:38:53,413 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1178 transitions. Word has length 137 [2020-10-25 19:38:53,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:53,413 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1178 transitions. [2020-10-25 19:38:53,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1178 transitions. [2020-10-25 19:38:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-10-25 19:38:53,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:53,419 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:53,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 19:38:53,420 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1483046825, now seen corresponding path program 1 times [2020-10-25 19:38:53,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:53,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559262637] [2020-10-25 19:38:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-10-25 19:38:53,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559262637] [2020-10-25 19:38:53,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:53,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:53,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513013147] [2020-10-25 19:38:53,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:53,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:53,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:53,508 INFO L87 Difference]: Start difference. First operand 798 states and 1178 transitions. Second operand 3 states. [2020-10-25 19:38:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:53,721 INFO L93 Difference]: Finished difference Result 1596 states and 2356 transitions. [2020-10-25 19:38:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:53,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2020-10-25 19:38:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:53,727 INFO L225 Difference]: With dead ends: 1596 [2020-10-25 19:38:53,727 INFO L226 Difference]: Without dead ends: 806 [2020-10-25 19:38:53,729 INFO L677 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 [2020-10-25 19:38:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2020-10-25 19:38:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 798. [2020-10-25 19:38:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-10-25 19:38:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1168 transitions. [2020-10-25 19:38:53,772 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1168 transitions. Word has length 138 [2020-10-25 19:38:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:53,773 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 1168 transitions. [2020-10-25 19:38:53,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1168 transitions. [2020-10-25 19:38:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2020-10-25 19:38:53,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:53,777 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:53,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 19:38:53,777 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:53,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:53,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1313212300, now seen corresponding path program 1 times [2020-10-25 19:38:53,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:53,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43905565] [2020-10-25 19:38:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-25 19:38:53,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43905565] [2020-10-25 19:38:53,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:53,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:53,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655450498] [2020-10-25 19:38:53,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:53,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:53,848 INFO L87 Difference]: Start difference. First operand 798 states and 1168 transitions. Second operand 3 states. [2020-10-25 19:38:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:54,101 INFO L93 Difference]: Finished difference Result 1651 states and 2410 transitions. [2020-10-25 19:38:54,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:54,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2020-10-25 19:38:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:54,107 INFO L225 Difference]: With dead ends: 1651 [2020-10-25 19:38:54,108 INFO L226 Difference]: Without dead ends: 861 [2020-10-25 19:38:54,110 INFO L677 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 [2020-10-25 19:38:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2020-10-25 19:38:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 847. [2020-10-25 19:38:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-10-25 19:38:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1229 transitions. [2020-10-25 19:38:54,157 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1229 transitions. Word has length 141 [2020-10-25 19:38:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:54,158 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 1229 transitions. [2020-10-25 19:38:54,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1229 transitions. [2020-10-25 19:38:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-10-25 19:38:54,161 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:54,162 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:54,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 19:38:54,162 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:54,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:54,163 INFO L82 PathProgramCache]: Analyzing trace with hash 75909554, now seen corresponding path program 1 times [2020-10-25 19:38:54,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:54,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770285172] [2020-10-25 19:38:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-10-25 19:38:54,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770285172] [2020-10-25 19:38:54,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:54,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:54,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577820354] [2020-10-25 19:38:54,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:54,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:54,232 INFO L87 Difference]: Start difference. First operand 847 states and 1229 transitions. Second operand 3 states. [2020-10-25 19:38:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:54,457 INFO L93 Difference]: Finished difference Result 1700 states and 2468 transitions. [2020-10-25 19:38:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:54,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-10-25 19:38:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:54,463 INFO L225 Difference]: With dead ends: 1700 [2020-10-25 19:38:54,463 INFO L226 Difference]: Without dead ends: 845 [2020-10-25 19:38:54,465 INFO L677 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 [2020-10-25 19:38:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-10-25 19:38:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 831. [2020-10-25 19:38:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2020-10-25 19:38:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1206 transitions. [2020-10-25 19:38:54,508 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1206 transitions. Word has length 142 [2020-10-25 19:38:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:54,509 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 1206 transitions. [2020-10-25 19:38:54,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1206 transitions. [2020-10-25 19:38:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2020-10-25 19:38:54,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:54,512 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2020-10-25 19:38:54,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 19:38:54,513 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2072592764, now seen corresponding path program 1 times [2020-10-25 19:38:54,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:54,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983990524] [2020-10-25 19:38:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2020-10-25 19:38:54,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983990524] [2020-10-25 19:38:54,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:54,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:54,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138776308] [2020-10-25 19:38:54,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:54,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:54,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:54,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:54,576 INFO L87 Difference]: Start difference. First operand 831 states and 1206 transitions. Second operand 3 states. [2020-10-25 19:38:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:54,776 INFO L93 Difference]: Finished difference Result 1666 states and 2418 transitions. [2020-10-25 19:38:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:54,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2020-10-25 19:38:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:54,782 INFO L225 Difference]: With dead ends: 1666 [2020-10-25 19:38:54,784 INFO L226 Difference]: Without dead ends: 843 [2020-10-25 19:38:54,789 INFO L677 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 [2020-10-25 19:38:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-10-25 19:38:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 831. [2020-10-25 19:38:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2020-10-25 19:38:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1199 transitions. [2020-10-25 19:38:54,834 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1199 transitions. Word has length 146 [2020-10-25 19:38:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:54,835 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 1199 transitions. [2020-10-25 19:38:54,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1199 transitions. [2020-10-25 19:38:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-10-25 19:38:54,838 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:54,838 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2020-10-25 19:38:54,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 19:38:54,839 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:54,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 369501830, now seen corresponding path program 1 times [2020-10-25 19:38:54,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:54,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823537593] [2020-10-25 19:38:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2020-10-25 19:38:54,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823537593] [2020-10-25 19:38:54,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:54,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:54,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426323526] [2020-10-25 19:38:54,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:54,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:54,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:54,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:54,920 INFO L87 Difference]: Start difference. First operand 831 states and 1199 transitions. Second operand 3 states. [2020-10-25 19:38:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,134 INFO L93 Difference]: Finished difference Result 1666 states and 2404 transitions. [2020-10-25 19:38:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-10-25 19:38:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,142 INFO L225 Difference]: With dead ends: 1666 [2020-10-25 19:38:55,142 INFO L226 Difference]: Without dead ends: 826 [2020-10-25 19:38:55,147 INFO L677 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 [2020-10-25 19:38:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2020-10-25 19:38:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 814. [2020-10-25 19:38:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2020-10-25 19:38:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1170 transitions. [2020-10-25 19:38:55,193 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1170 transitions. Word has length 147 [2020-10-25 19:38:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,194 INFO L481 AbstractCegarLoop]: Abstraction has 814 states and 1170 transitions. [2020-10-25 19:38:55,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1170 transitions. [2020-10-25 19:38:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-25 19:38:55,197 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,197 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:55,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-25 19:38:55,198 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1770310156, now seen corresponding path program 1 times [2020-10-25 19:38:55,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297503749] [2020-10-25 19:38:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-10-25 19:38:55,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297503749] [2020-10-25 19:38:55,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366980186] [2020-10-25 19:38:55,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,272 INFO L87 Difference]: Start difference. First operand 814 states and 1170 transitions. Second operand 3 states. [2020-10-25 19:38:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,349 INFO L93 Difference]: Finished difference Result 2412 states and 3460 transitions. [2020-10-25 19:38:55,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2020-10-25 19:38:55,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,359 INFO L225 Difference]: With dead ends: 2412 [2020-10-25 19:38:55,360 INFO L226 Difference]: Without dead ends: 1606 [2020-10-25 19:38:55,362 INFO L677 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 [2020-10-25 19:38:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2020-10-25 19:38:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 816. [2020-10-25 19:38:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2020-10-25 19:38:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1172 transitions. [2020-10-25 19:38:55,420 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1172 transitions. Word has length 154 [2020-10-25 19:38:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,420 INFO L481 AbstractCegarLoop]: Abstraction has 816 states and 1172 transitions. [2020-10-25 19:38:55,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1172 transitions. [2020-10-25 19:38:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-10-25 19:38:55,423 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,423 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:55,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-25 19:38:55,424 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1570716982, now seen corresponding path program 1 times [2020-10-25 19:38:55,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931917151] [2020-10-25 19:38:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2020-10-25 19:38:55,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931917151] [2020-10-25 19:38:55,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383983837] [2020-10-25 19:38:55,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,511 INFO L87 Difference]: Start difference. First operand 816 states and 1172 transitions. Second operand 3 states. [2020-10-25 19:38:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:55,610 INFO L93 Difference]: Finished difference Result 2411 states and 3456 transitions. [2020-10-25 19:38:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:55,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2020-10-25 19:38:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:55,620 INFO L225 Difference]: With dead ends: 2411 [2020-10-25 19:38:55,620 INFO L226 Difference]: Without dead ends: 1603 [2020-10-25 19:38:55,623 INFO L677 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 [2020-10-25 19:38:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2020-10-25 19:38:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1601. [2020-10-25 19:38:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2020-10-25 19:38:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2292 transitions. [2020-10-25 19:38:55,734 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2292 transitions. Word has length 154 [2020-10-25 19:38:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:55,735 INFO L481 AbstractCegarLoop]: Abstraction has 1601 states and 2292 transitions. [2020-10-25 19:38:55,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2292 transitions. [2020-10-25 19:38:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-10-25 19:38:55,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:55,738 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:55,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-25 19:38:55,739 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash -362729202, now seen corresponding path program 1 times [2020-10-25 19:38:55,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:55,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914354944] [2020-10-25 19:38:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-10-25 19:38:55,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914354944] [2020-10-25 19:38:55,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:55,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:55,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867282400] [2020-10-25 19:38:55,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:55,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:55,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:55,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:55,906 INFO L87 Difference]: Start difference. First operand 1601 states and 2292 transitions. Second operand 3 states. [2020-10-25 19:38:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:56,166 INFO L93 Difference]: Finished difference Result 4747 states and 6780 transitions. [2020-10-25 19:38:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:56,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-10-25 19:38:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:56,185 INFO L225 Difference]: With dead ends: 4747 [2020-10-25 19:38:56,185 INFO L226 Difference]: Without dead ends: 3154 [2020-10-25 19:38:56,191 INFO L677 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 [2020-10-25 19:38:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2020-10-25 19:38:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 1601. [2020-10-25 19:38:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2020-10-25 19:38:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2288 transitions. [2020-10-25 19:38:56,355 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2288 transitions. Word has length 156 [2020-10-25 19:38:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:56,355 INFO L481 AbstractCegarLoop]: Abstraction has 1601 states and 2288 transitions. [2020-10-25 19:38:56,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2288 transitions. [2020-10-25 19:38:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-10-25 19:38:56,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:56,359 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:56,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-25 19:38:56,359 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -957693967, now seen corresponding path program 1 times [2020-10-25 19:38:56,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:56,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663733289] [2020-10-25 19:38:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 19:38:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-25 19:38:56,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663733289] [2020-10-25 19:38:56,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 19:38:56,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 19:38:56,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679988687] [2020-10-25 19:38:56,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 19:38:56,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 19:38:56,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 19:38:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 19:38:56,438 INFO L87 Difference]: Start difference. First operand 1601 states and 2288 transitions. Second operand 3 states. [2020-10-25 19:38:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 19:38:56,760 INFO L93 Difference]: Finished difference Result 4783 states and 6836 transitions. [2020-10-25 19:38:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 19:38:56,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2020-10-25 19:38:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 19:38:56,777 INFO L225 Difference]: With dead ends: 4783 [2020-10-25 19:38:56,778 INFO L226 Difference]: Without dead ends: 3190 [2020-10-25 19:38:56,780 INFO L677 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 [2020-10-25 19:38:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2020-10-25 19:38:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3188. [2020-10-25 19:38:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2020-10-25 19:38:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4472 transitions. [2020-10-25 19:38:56,959 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4472 transitions. Word has length 157 [2020-10-25 19:38:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 19:38:56,960 INFO L481 AbstractCegarLoop]: Abstraction has 3188 states and 4472 transitions. [2020-10-25 19:38:56,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 19:38:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4472 transitions. [2020-10-25 19:38:56,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-10-25 19:38:56,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 19:38:56,965 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 19:38:56,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-25 19:38:56,965 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 19:38:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 19:38:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -3753809, now seen corresponding path program 1 times [2020-10-25 19:38:56,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 19:38:56,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964066995] [2020-10-25 19:38:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 19:38:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:38:57,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:38:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 19:38:57,040 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 19:38:57,130 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 19:38:57,131 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 19:38:57,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-25 19:38:57,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 07:38:57 BoogieIcfgContainer [2020-10-25 19:38:57,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 19:38:57,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 19:38:57,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 19:38:57,266 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 19:38:57,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 07:38:44" (3/4) ... [2020-10-25 19:38:57,269 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 19:38:57,401 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 19:38:57,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 19:38:57,404 INFO L168 Benchmark]: Toolchain (without parser) took 14976.51 ms. Allocated memory was 41.9 MB in the beginning and 251.7 MB in the end (delta: 209.7 MB). Free memory was 19.6 MB in the beginning and 95.2 MB in the end (delta: -75.7 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,405 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 41.9 MB. Free memory was 22.7 MB in the beginning and 22.6 MB in the end (delta: 42.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 19:38:57,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.98 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 18.9 MB in the beginning and 36.3 MB in the end (delta: -17.4 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.32 ms. Allocated memory is still 54.5 MB. Free memory was 36.1 MB in the beginning and 33.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,406 INFO L168 Benchmark]: Boogie Preprocessor took 91.65 ms. Allocated memory is still 54.5 MB. Free memory was 33.2 MB in the beginning and 30.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,407 INFO L168 Benchmark]: RCFGBuilder took 1010.80 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 19.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,407 INFO L168 Benchmark]: TraceAbstraction took 13016.48 ms. Allocated memory was 67.1 MB in the beginning and 251.7 MB in the end (delta: 184.5 MB). Free memory was 48.6 MB in the beginning and 113.1 MB in the end (delta: -64.5 MB). Peak memory consumption was 119.4 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,408 INFO L168 Benchmark]: Witness Printer took 136.53 ms. Allocated memory is still 251.7 MB. Free memory was 113.1 MB in the beginning and 95.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-10-25 19:38:57,410 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 41.9 MB. Free memory was 22.7 MB in the beginning and 22.6 MB in the end (delta: 42.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 617.98 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 18.9 MB in the beginning and 36.3 MB in the end (delta: -17.4 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.32 ms. Allocated memory is still 54.5 MB. Free memory was 36.1 MB in the beginning and 33.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.65 ms. Allocated memory is still 54.5 MB. Free memory was 33.2 MB in the beginning and 30.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1010.80 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 19.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13016.48 ms. Allocated memory was 67.1 MB in the beginning and 251.7 MB in the end (delta: 184.5 MB). Free memory was 48.6 MB in the beginning and 113.1 MB in the end (delta: -64.5 MB). Peak memory consumption was 119.4 MB. Max. memory is 16.1 GB. * Witness Printer took 136.53 ms. Allocated memory is still 251.7 MB. Free memory was 113.1 MB in the beginning and 95.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L704] int s ; [L705] int tmp ; [L709] s = 8464 [L14] int s__info_callback = __VERIFIER_nondet_int() ; [L15] int s__in_handshake = __VERIFIER_nondet_int() ; [L16] int s__state ; [L17] int s__new_session ; [L18] int s__server ; [L19] int s__version = __VERIFIER_nondet_int() ; [L20] int s__type ; [L21] int s__init_num ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__cert = __VERIFIER_nondet_int() ; [L28] int s__options = __VERIFIER_nondet_int() ; [L29] int s__verify_mode = __VERIFIER_nondet_int() ; [L30] int s__session__peer = __VERIFIER_nondet_int() ; [L31] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L32] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L35] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__cert_request ; [L37] int s__s3__tmp__reuse_message ; [L38] int s__s3__tmp__use_rsa_tmp ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_cipher__algo_strength ; [L43] int s__session__cipher ; [L44] int buf ; [L45] unsigned long l ; [L46] unsigned long Time ; [L47] unsigned long tmp ; [L48] int cb ; [L49] long num1 = __VERIFIER_nondet_long() ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int got_new_session ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 ; [L62] long tmp___8 = __VERIFIER_nondet_long() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int tmp___10 = __VERIFIER_nondet_int() ; [L65] int blastFlag ; [L66] int __cil_tmp55 ; [L67] unsigned long __cil_tmp56 ; [L68] unsigned long __cil_tmp57 ; [L69] unsigned long __cil_tmp58 ; [L70] unsigned long __cil_tmp59 ; [L71] int __cil_tmp60 ; [L72] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L76] s__state = initial_state [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] Time = tmp [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] got_new_session = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 + 12288) [L97] COND FALSE !(s__cert == 0) [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND TRUE s__state == 8464 [L274] s__shutdown = 0 [L275] ret = __VERIFIER_nondet_int() [L276] COND TRUE blastFlag == 0 [L277] blastFlag = 1 [L279] COND FALSE !(ret <= 0) [L282] got_new_session = 1 [L283] s__state = 8496 [L284] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND TRUE s__state == 8496 [L288] ret = __VERIFIER_nondet_int() [L289] COND TRUE blastFlag == 1 [L290] blastFlag = 2 [L292] COND FALSE !(ret <= 0) [L295] COND FALSE !(\read(s__hit)) [L298] s__state = 8512 [L300] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND TRUE s__state == 8512 [L305] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L306] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L307] COND TRUE __cil_tmp56 + 256UL [L308] __cil_tmp56 = 256345 [L309] skip = 1 [L320] s__state = 8528 [L321] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND TRUE s__state == 8528 [L325] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L326] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L328] __cil_tmp57 = (unsigned long )s__options [L329] COND TRUE __cil_tmp57 + 2097152UL [L330] s__s3__tmp__use_rsa_tmp = 1 [L335] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L363] ret = __VERIFIER_nondet_int() [L364] COND FALSE !(blastFlag == 3) [L367] COND FALSE !(ret <= 0) [L384] s__state = 8544 [L385] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND TRUE s__state == 8544 [L389] COND TRUE s__verify_mode + 1 [L390] COND TRUE s__session__peer != 0 [L391] COND TRUE s__verify_mode + 4 [L392] s__verify_mode = 123 [L393] skip = 1 [L394] s__s3__tmp__cert_request = 0 [L395] s__state = 8560 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND FALSE !(! s__s3__tmp__reuse_message) [L688] skip = 0 [L101] COND TRUE 1 [L103] state = s__state [L104] COND FALSE !(s__state == 12292) [L107] COND FALSE !(s__state == 16384) [L110] COND FALSE !(s__state == 8192) [L113] COND FALSE !(s__state == 24576) [L116] COND FALSE !(s__state == 8195) [L119] COND FALSE !(s__state == 8480) [L122] COND FALSE !(s__state == 8481) [L125] COND FALSE !(s__state == 8482) [L128] COND FALSE !(s__state == 8464) [L131] COND FALSE !(s__state == 8465) [L134] COND FALSE !(s__state == 8466) [L137] COND FALSE !(s__state == 8496) [L140] COND FALSE !(s__state == 8497) [L143] COND FALSE !(s__state == 8512) [L146] COND FALSE !(s__state == 8513) [L149] COND FALSE !(s__state == 8528) [L152] COND FALSE !(s__state == 8529) [L155] COND FALSE !(s__state == 8544) [L158] COND FALSE !(s__state == 8545) [L161] COND TRUE s__state == 8560 [L439] ret = __VERIFIER_nondet_int() [L440] COND FALSE !(ret <= 0) [L443] s__s3__tmp__next_state___0 = 8576 [L444] s__state = 8448 [L445] s__init_num = 0 [L653] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L654] COND TRUE ! s__s3__tmp__reuse_message [L655] COND TRUE ! skip [L656] COND TRUE state == 8560 [L657] COND TRUE s__state == 8448 [L658] COND TRUE s__verify_mode != -1 [L659] COND TRUE s__verify_mode != -2 [L660] COND TRUE __cil_tmp61 != 9021 [L661] COND TRUE __cil_tmp58 != 4294967294 [L662] COND TRUE blastFlag != 4 [L663] COND TRUE tmp___7 != 1024 [L3] __assert_fail("0", "s3_srvr_12.cil.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 168 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7183 SDtfs, 6874 SDslu, 1823 SDs, 0 SdLazy, 2872 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3188occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3216 NumberOfCodeBlocks, 3216 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3025 ConstructedInterpolants, 0 QuantifiedInterpolants, 576216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...