./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c981d0a5b920acef2c10b7dfe7c826834e0e2e3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.1.24-cad4683 [2019-10-22 09:01:18,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:18,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:18,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:18,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:18,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:18,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:18,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:18,444 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:18,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:18,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:18,447 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:18,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:18,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:18,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:18,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:18,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:18,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:18,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:18,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:18,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:18,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:18,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:18,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:18,460 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:18,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:18,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:18,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:18,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:18,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:18,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:18,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:18,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:18,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:18,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:18,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:18,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:18,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:18,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:18,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:18,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:18,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:18,480 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:18,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:18,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:18,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:18,482 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:18,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:18,482 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:18,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:18,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:18,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:18,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:18,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:18,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:18,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:18,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:18,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:18,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:18,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:18,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:18,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:18,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:18,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:18,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer 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(__VERIFIER_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 -> 7c981d0a5b920acef2c10b7dfe7c826834e0e2e3 [2019-10-22 09:01:18,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:18,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:18,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:18,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:18,523 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:18,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-10-22 09:01:18,568 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/data/f5e62684f/23b65a2cca1f40cbb6ed939b86e4080c/FLAG4e84bbcaf [2019-10-22 09:01:18,962 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:18,966 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-10-22 09:01:18,978 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/data/f5e62684f/23b65a2cca1f40cbb6ed939b86e4080c/FLAG4e84bbcaf [2019-10-22 09:01:19,354 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/data/f5e62684f/23b65a2cca1f40cbb6ed939b86e4080c [2019-10-22 09:01:19,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:19,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:19,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:19,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:19,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:19,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@842d0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19, skipping insertion in model container [2019-10-22 09:01:19,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,373 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:19,417 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:19,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:19,684 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:19,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:19,762 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:19,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19 WrapperNode [2019-10-22 09:01:19,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:19,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:19,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:19,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:19,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:19,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:19,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:19,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:19,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... [2019-10-22 09:01:19,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:19,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:19,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:19,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:19,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:19,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:20,130 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:01:20,727 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 09:01:20,728 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 09:01:20,729 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:20,729 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:20,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:20 BoogieIcfgContainer [2019-10-22 09:01:20,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:20,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:20,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:20,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:20,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:19" (1/3) ... [2019-10-22 09:01:20,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50401de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:20, skipping insertion in model container [2019-10-22 09:01:20,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:19" (2/3) ... [2019-10-22 09:01:20,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50401de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:20, skipping insertion in model container [2019-10-22 09:01:20,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:20" (3/3) ... [2019-10-22 09:01:20,736 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-10-22 09:01:20,745 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:20,752 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:20,763 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:20,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:20,784 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:20,784 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:20,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:20,784 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:20,785 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:20,785 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:20,785 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-10-22 09:01:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 09:01:20,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:20,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:20,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-10-22 09:01:20,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:20,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504682831] [2019-10-22 09:01:20,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:20,823 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:20,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:20,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504682831] [2019-10-22 09:01:20,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:20,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:20,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525000938] [2019-10-22 09:01:20,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:20,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,012 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-10-22 09:01:21,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:21,219 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-10-22 09:01:21,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:21,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 09:01:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:21,230 INFO L225 Difference]: With dead ends: 315 [2019-10-22 09:01:21,230 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 09:01:21,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 09:01:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-10-22 09:01:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-22 09:01:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-10-22 09:01:21,281 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-10-22 09:01:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:21,281 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-10-22 09:01:21,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-10-22 09:01:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:01:21,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:21,287 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:21,288 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:21,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-10-22 09:01:21,288 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:21,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20617056] [2019-10-22 09:01:21,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:21,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:21,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:21,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20617056] [2019-10-22 09:01:21,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:21,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:21,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508258559] [2019-10-22 09:01:21,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:21,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:21,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,366 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-10-22 09:01:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:21,538 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-10-22 09:01:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:21,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:01:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:21,540 INFO L225 Difference]: With dead ends: 318 [2019-10-22 09:01:21,540 INFO L226 Difference]: Without dead ends: 173 [2019-10-22 09:01:21,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-10-22 09:01:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-10-22 09:01:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-10-22 09:01:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-10-22 09:01:21,565 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-10-22 09:01:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:21,566 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-10-22 09:01:21,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-10-22 09:01:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:01:21,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:21,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:21,567 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-10-22 09:01:21,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:21,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319580183] [2019-10-22 09:01:21,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:21,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:21,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:21,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319580183] [2019-10-22 09:01:21,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:21,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:21,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294042915] [2019-10-22 09:01:21,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:21,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:21,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:21,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,655 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-10-22 09:01:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:21,815 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-10-22 09:01:21,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:21,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:01:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:21,817 INFO L225 Difference]: With dead ends: 347 [2019-10-22 09:01:21,817 INFO L226 Difference]: Without dead ends: 181 [2019-10-22 09:01:21,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-22 09:01:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-10-22 09:01:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-22 09:01:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-10-22 09:01:21,850 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-10-22 09:01:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:21,851 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-10-22 09:01:21,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-10-22 09:01:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 09:01:21,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:21,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:21,852 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-10-22 09:01:21,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:21,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747093753] [2019-10-22 09:01:21,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:21,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:21,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:21,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747093753] [2019-10-22 09:01:21,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:21,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:21,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377193233] [2019-10-22 09:01:21,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:21,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:21,918 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-10-22 09:01:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:22,050 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-10-22 09:01:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:22,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 09:01:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:22,052 INFO L225 Difference]: With dead ends: 352 [2019-10-22 09:01:22,052 INFO L226 Difference]: Without dead ends: 180 [2019-10-22 09:01:22,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-22 09:01:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-10-22 09:01:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 09:01:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-10-22 09:01:22,072 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-10-22 09:01:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:22,072 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-10-22 09:01:22,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-10-22 09:01:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:01:22,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:22,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,075 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:22,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-10-22 09:01:22,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120792427] [2019-10-22 09:01:22,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120792427] [2019-10-22 09:01:22,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:22,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:22,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873014470] [2019-10-22 09:01:22,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:22,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:22,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:22,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,117 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-10-22 09:01:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:22,255 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-10-22 09:01:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:22,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:01:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:22,257 INFO L225 Difference]: With dead ends: 363 [2019-10-22 09:01:22,257 INFO L226 Difference]: Without dead ends: 190 [2019-10-22 09:01:22,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-22 09:01:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-10-22 09:01:22,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 09:01:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-10-22 09:01:22,268 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-10-22 09:01:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:22,269 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-10-22 09:01:22,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-10-22 09:01:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:01:22,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:22,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,270 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-10-22 09:01:22,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376990034] [2019-10-22 09:01:22,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376990034] [2019-10-22 09:01:22,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:22,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:22,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058350165] [2019-10-22 09:01:22,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:22,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,313 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-10-22 09:01:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:22,449 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-10-22 09:01:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:22,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 09:01:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:22,450 INFO L225 Difference]: With dead ends: 363 [2019-10-22 09:01:22,450 INFO L226 Difference]: Without dead ends: 190 [2019-10-22 09:01:22,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-22 09:01:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-10-22 09:01:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 09:01:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-10-22 09:01:22,466 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-10-22 09:01:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:22,467 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-10-22 09:01:22,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-10-22 09:01:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:01:22,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:22,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,468 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:22,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-10-22 09:01:22,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252106634] [2019-10-22 09:01:22,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252106634] [2019-10-22 09:01:22,504 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:22,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:22,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381703307] [2019-10-22 09:01:22,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:22,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:22,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,505 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-10-22 09:01:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:22,608 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-10-22 09:01:22,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:22,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:01:22,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:22,610 INFO L225 Difference]: With dead ends: 363 [2019-10-22 09:01:22,610 INFO L226 Difference]: Without dead ends: 190 [2019-10-22 09:01:22,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-22 09:01:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-10-22 09:01:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-22 09:01:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-10-22 09:01:22,617 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-10-22 09:01:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:22,617 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-10-22 09:01:22,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-10-22 09:01:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:01:22,618 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:22,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,619 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-10-22 09:01:22,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146068471] [2019-10-22 09:01:22,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,649 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146068471] [2019-10-22 09:01:22,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:22,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:22,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637163163] [2019-10-22 09:01:22,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:22,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:22,650 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-10-22 09:01:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:22,855 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-10-22 09:01:22,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:22,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-22 09:01:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:22,857 INFO L225 Difference]: With dead ends: 511 [2019-10-22 09:01:22,857 INFO L226 Difference]: Without dead ends: 338 [2019-10-22 09:01:22,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-22 09:01:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-10-22 09:01:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-10-22 09:01:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-10-22 09:01:22,871 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-10-22 09:01:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:22,871 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-10-22 09:01:22,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:22,871 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-10-22 09:01:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 09:01:22,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:22,872 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,872 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-10-22 09:01:22,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167806823] [2019-10-22 09:01:22,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:22,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167806823] [2019-10-22 09:01:22,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:22,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:22,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390651341] [2019-10-22 09:01:22,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:22,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:22,903 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-10-22 09:01:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:23,052 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-10-22 09:01:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:23,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 09:01:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:23,054 INFO L225 Difference]: With dead ends: 698 [2019-10-22 09:01:23,054 INFO L226 Difference]: Without dead ends: 382 [2019-10-22 09:01:23,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-22 09:01:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-10-22 09:01:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-22 09:01:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-10-22 09:01:23,072 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-10-22 09:01:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:23,073 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-10-22 09:01:23,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-10-22 09:01:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:01:23,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,079 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:23,079 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-10-22 09:01:23,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730041051] [2019-10-22 09:01:23,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:23,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730041051] [2019-10-22 09:01:23,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:23,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994875480] [2019-10-22 09:01:23,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,107 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-10-22 09:01:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:23,264 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-10-22 09:01:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:23,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 09:01:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:23,266 INFO L225 Difference]: With dead ends: 775 [2019-10-22 09:01:23,267 INFO L226 Difference]: Without dead ends: 406 [2019-10-22 09:01:23,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-10-22 09:01:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-10-22 09:01:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-10-22 09:01:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-10-22 09:01:23,282 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-10-22 09:01:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:23,282 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-10-22 09:01:23,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-10-22 09:01:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 09:01:23,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,283 INFO L380 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] [2019-10-22 09:01:23,283 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,283 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-10-22 09:01:23,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593475311] [2019-10-22 09:01:23,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:01:23,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593475311] [2019-10-22 09:01:23,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:23,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83121119] [2019-10-22 09:01:23,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,308 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-10-22 09:01:23,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:23,446 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-10-22 09:01:23,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:23,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 09:01:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:23,449 INFO L225 Difference]: With dead ends: 829 [2019-10-22 09:01:23,449 INFO L226 Difference]: Without dead ends: 438 [2019-10-22 09:01:23,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-22 09:01:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-10-22 09:01:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-10-22 09:01:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-10-22 09:01:23,465 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-10-22 09:01:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:23,465 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-10-22 09:01:23,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-10-22 09:01:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-22 09:01:23,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,466 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:23,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-10-22 09:01:23,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757281205] [2019-10-22 09:01:23,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:01:23,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757281205] [2019-10-22 09:01:23,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:23,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715598716] [2019-10-22 09:01:23,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,497 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-10-22 09:01:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:23,659 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-10-22 09:01:23,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:23,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-22 09:01:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:23,661 INFO L225 Difference]: With dead ends: 911 [2019-10-22 09:01:23,661 INFO L226 Difference]: Without dead ends: 480 [2019-10-22 09:01:23,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-10-22 09:01:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-10-22 09:01:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-22 09:01:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-10-22 09:01:23,680 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-10-22 09:01:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:23,680 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-10-22 09:01:23,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-10-22 09:01:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:01:23,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,682 INFO L380 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] [2019-10-22 09:01:23,682 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-10-22 09:01:23,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498177188] [2019-10-22 09:01:23,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:01:23,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498177188] [2019-10-22 09:01:23,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:23,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316186769] [2019-10-22 09:01:23,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,723 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-10-22 09:01:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:23,844 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-10-22 09:01:23,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:23,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-22 09:01:23,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:23,851 INFO L225 Difference]: With dead ends: 949 [2019-10-22 09:01:23,852 INFO L226 Difference]: Without dead ends: 480 [2019-10-22 09:01:23,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-10-22 09:01:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-10-22 09:01:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-22 09:01:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-10-22 09:01:23,867 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-10-22 09:01:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:23,868 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-10-22 09:01:23,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-10-22 09:01:23,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 09:01:23,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:23,869 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:23,869 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:23,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-10-22 09:01:23,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:23,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100050184] [2019-10-22 09:01:23,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:23,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:01:23,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100050184] [2019-10-22 09:01:23,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:23,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211605603] [2019-10-22 09:01:23,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:23,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:23,897 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-10-22 09:01:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,022 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-10-22 09:01:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 09:01:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,024 INFO L225 Difference]: With dead ends: 997 [2019-10-22 09:01:24,024 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 09:01:24,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 09:01:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-10-22 09:01:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-22 09:01:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-10-22 09:01:24,040 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-10-22 09:01:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,040 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-10-22 09:01:24,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-10-22 09:01:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:01:24,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,042 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,042 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-10-22 09:01:24,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706056541] [2019-10-22 09:01:24,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-22 09:01:24,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706056541] [2019-10-22 09:01:24,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217359398] [2019-10-22 09:01:24,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,068 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-10-22 09:01:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,191 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-10-22 09:01:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:01:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,193 INFO L225 Difference]: With dead ends: 1033 [2019-10-22 09:01:24,193 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 09:01:24,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 09:01:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-10-22 09:01:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-22 09:01:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-10-22 09:01:24,210 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-10-22 09:01:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,210 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-10-22 09:01:24,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-10-22 09:01:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:01:24,211 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,211 INFO L380 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,211 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-10-22 09:01:24,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580987948] [2019-10-22 09:01:24,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:24,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580987948] [2019-10-22 09:01:24,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736168189] [2019-10-22 09:01:24,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,240 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-10-22 09:01:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,383 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-10-22 09:01:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:01:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,386 INFO L225 Difference]: With dead ends: 1078 [2019-10-22 09:01:24,386 INFO L226 Difference]: Without dead ends: 573 [2019-10-22 09:01:24,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-22 09:01:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-10-22 09:01:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-22 09:01:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-10-22 09:01:24,406 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-10-22 09:01:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,407 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-10-22 09:01:24,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-10-22 09:01:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:01:24,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,408 INFO L380 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,408 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-10-22 09:01:24,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563936484] [2019-10-22 09:01:24,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:24,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563936484] [2019-10-22 09:01:24,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271217743] [2019-10-22 09:01:24,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,439 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-10-22 09:01:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,587 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-10-22 09:01:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-22 09:01:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,590 INFO L225 Difference]: With dead ends: 1131 [2019-10-22 09:01:24,590 INFO L226 Difference]: Without dead ends: 571 [2019-10-22 09:01:24,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-22 09:01:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-10-22 09:01:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-22 09:01:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-10-22 09:01:24,631 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-10-22 09:01:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,632 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-10-22 09:01:24,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-10-22 09:01:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:01:24,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,633 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2019-10-22 09:01:24,633 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-10-22 09:01:24,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456818845] [2019-10-22 09:01:24,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:01:24,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456818845] [2019-10-22 09:01:24,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383059760] [2019-10-22 09:01:24,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,660 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-10-22 09:01:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,772 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-10-22 09:01:24,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 09:01:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,774 INFO L225 Difference]: With dead ends: 1159 [2019-10-22 09:01:24,774 INFO L226 Difference]: Without dead ends: 603 [2019-10-22 09:01:24,775 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-22 09:01:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-10-22 09:01:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-22 09:01:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-10-22 09:01:24,796 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-10-22 09:01:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,797 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-10-22 09:01:24,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-10-22 09:01:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-22 09:01:24,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,798 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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] [2019-10-22 09:01:24,799 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-10-22 09:01:24,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674526781] [2019-10-22 09:01:24,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:01:24,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674526781] [2019-10-22 09:01:24,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435382221] [2019-10-22 09:01:24,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,835 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-10-22 09:01:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,964 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-10-22 09:01:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:24,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-22 09:01:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,966 INFO L225 Difference]: With dead ends: 1189 [2019-10-22 09:01:24,966 INFO L226 Difference]: Without dead ends: 603 [2019-10-22 09:01:24,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-22 09:01:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-10-22 09:01:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-22 09:01:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-10-22 09:01:24,992 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-10-22 09:01:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,992 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-10-22 09:01:24,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-10-22 09:01:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-22 09:01:24,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,994 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,994 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-10-22 09:01:24,994 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828947272] [2019-10-22 09:01:24,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,995 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-22 09:01:25,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828947272] [2019-10-22 09:01:25,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:25,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277567501] [2019-10-22 09:01:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,033 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-10-22 09:01:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,170 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-10-22 09:01:25,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-10-22 09:01:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,173 INFO L225 Difference]: With dead ends: 1239 [2019-10-22 09:01:25,173 INFO L226 Difference]: Without dead ends: 653 [2019-10-22 09:01:25,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-22 09:01:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-10-22 09:01:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-22 09:01:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-10-22 09:01:25,200 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-10-22 09:01:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,200 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-10-22 09:01:25,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-10-22 09:01:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-22 09:01:25,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,202 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 09:01:25,202 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-10-22 09:01:25,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200909323] [2019-10-22 09:01:25,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-22 09:01:25,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200909323] [2019-10-22 09:01:25,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:25,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669733470] [2019-10-22 09:01:25,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,240 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-10-22 09:01:25,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,365 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-10-22 09:01:25,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-22 09:01:25,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,368 INFO L225 Difference]: With dead ends: 1273 [2019-10-22 09:01:25,368 INFO L226 Difference]: Without dead ends: 653 [2019-10-22 09:01:25,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-22 09:01:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-10-22 09:01:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-22 09:01:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-10-22 09:01:25,392 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-10-22 09:01:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,392 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-10-22 09:01:25,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-10-22 09:01:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-22 09:01:25,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,394 INFO L380 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, 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] [2019-10-22 09:01:25,394 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-10-22 09:01:25,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005151717] [2019-10-22 09:01:25,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:01:25,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005151717] [2019-10-22 09:01:25,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:25,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102610320] [2019-10-22 09:01:25,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,440 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-10-22 09:01:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,612 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-10-22 09:01:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-22 09:01:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,616 INFO L225 Difference]: With dead ends: 1300 [2019-10-22 09:01:25,616 INFO L226 Difference]: Without dead ends: 680 [2019-10-22 09:01:25,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-10-22 09:01:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-10-22 09:01:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-22 09:01:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-10-22 09:01:25,643 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-10-22 09:01:25,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,643 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-10-22 09:01:25,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-10-22 09:01:25,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-22 09:01:25,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,645 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,645 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-10-22 09:01:25,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343268662] [2019-10-22 09:01:25,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-22 09:01:25,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343268662] [2019-10-22 09:01:25,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619181687] [2019-10-22 09:01:25,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,695 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-10-22 09:01:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,748 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-10-22 09:01:25,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-22 09:01:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,753 INFO L225 Difference]: With dead ends: 1343 [2019-10-22 09:01:25,753 INFO L226 Difference]: Without dead ends: 1341 [2019-10-22 09:01:25,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-10-22 09:01:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-10-22 09:01:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-10-22 09:01:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-10-22 09:01:25,802 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-10-22 09:01:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,802 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-10-22 09:01:25,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-10-22 09:01:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-22 09:01:25,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,804 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,804 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-10-22 09:01:25,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835550577] [2019-10-22 09:01:25,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-22 09:01:25,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835550577] [2019-10-22 09:01:25,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671322269] [2019-10-22 09:01:25,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:25,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,844 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-10-22 09:01:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,920 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-10-22 09:01:25,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-22 09:01:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,926 INFO L225 Difference]: With dead ends: 3328 [2019-10-22 09:01:25,926 INFO L226 Difference]: Without dead ends: 1996 [2019-10-22 09:01:25,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-10-22 09:01:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-10-22 09:01:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-10-22 09:01:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-10-22 09:01:26,004 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-10-22 09:01:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,005 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-10-22 09:01:26,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-10-22 09:01:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-22 09:01:26,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,008 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,008 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-10-22 09:01:26,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490707965] [2019-10-22 09:01:26,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-22 09:01:26,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490707965] [2019-10-22 09:01:26,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:26,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307574307] [2019-10-22 09:01:26,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,046 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-10-22 09:01:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,156 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-10-22 09:01:26,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-22 09:01:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,166 INFO L225 Difference]: With dead ends: 4616 [2019-10-22 09:01:26,166 INFO L226 Difference]: Without dead ends: 2629 [2019-10-22 09:01:26,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-10-22 09:01:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-10-22 09:01:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-10-22 09:01:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-10-22 09:01:26,266 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-10-22 09:01:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,267 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-10-22 09:01:26,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-10-22 09:01:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-22 09:01:26,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,270 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2019-10-22 09:01:26,270 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-10-22 09:01:26,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860311113] [2019-10-22 09:01:26,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-22 09:01:26,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860311113] [2019-10-22 09:01:26,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:26,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481365090] [2019-10-22 09:01:26,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,306 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-10-22 09:01:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,534 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-10-22 09:01:26,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-22 09:01:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,544 INFO L225 Difference]: With dead ends: 5375 [2019-10-22 09:01:26,544 INFO L226 Difference]: Without dead ends: 2755 [2019-10-22 09:01:26,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-10-22 09:01:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-10-22 09:01:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-10-22 09:01:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-10-22 09:01:26,681 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-10-22 09:01:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,682 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-10-22 09:01:26,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-10-22 09:01:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-22 09:01:26,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,685 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-22 09:01:26,686 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,686 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-10-22 09:01:26,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184568529] [2019-10-22 09:01:26,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-22 09:01:26,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184568529] [2019-10-22 09:01:26,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:26,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196591170] [2019-10-22 09:01:26,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,722 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-10-22 09:01:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,917 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-10-22 09:01:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-22 09:01:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,926 INFO L225 Difference]: With dead ends: 5471 [2019-10-22 09:01:26,927 INFO L226 Difference]: Without dead ends: 2755 [2019-10-22 09:01:26,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-10-22 09:01:27,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-10-22 09:01:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-10-22 09:01:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-10-22 09:01:27,017 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-10-22 09:01:27,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,017 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-10-22 09:01:27,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:27,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-10-22 09:01:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 09:01:27,020 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,021 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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] [2019-10-22 09:01:27,021 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-10-22 09:01:27,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479753097] [2019-10-22 09:01:27,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-22 09:01:27,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479753097] [2019-10-22 09:01:27,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:27,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545857670] [2019-10-22 09:01:27,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:27,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:27,057 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-10-22 09:01:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,255 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-10-22 09:01:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:27,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-22 09:01:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,264 INFO L225 Difference]: With dead ends: 5521 [2019-10-22 09:01:27,264 INFO L226 Difference]: Without dead ends: 2805 [2019-10-22 09:01:27,267 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-10-22 09:01:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-10-22 09:01:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-10-22 09:01:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-10-22 09:01:27,348 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-10-22 09:01:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,349 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-10-22 09:01:27,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:27,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-10-22 09:01:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 09:01:27,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,352 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1] [2019-10-22 09:01:27,352 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-10-22 09:01:27,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101079309] [2019-10-22 09:01:27,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-22 09:01:27,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101079309] [2019-10-22 09:01:27,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:27,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883856138] [2019-10-22 09:01:27,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:27,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:27,389 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-10-22 09:01:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,619 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-10-22 09:01:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:27,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-10-22 09:01:27,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,628 INFO L225 Difference]: With dead ends: 5711 [2019-10-22 09:01:27,628 INFO L226 Difference]: Without dead ends: 2995 [2019-10-22 09:01:27,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-10-22 09:01:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-10-22 09:01:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-10-22 09:01:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-10-22 09:01:27,721 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-10-22 09:01:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,721 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-10-22 09:01:27,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:27,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-10-22 09:01:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-22 09:01:27,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,726 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2019-10-22 09:01:27,726 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-10-22 09:01:27,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070278200] [2019-10-22 09:01:27,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:27,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070278200] [2019-10-22 09:01:27,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358741381] [2019-10-22 09:01:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:27,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-22 09:01:27,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:27,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:27,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912950393] [2019-10-22 09:01:27,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:27,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:27,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:27,939 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-10-22 09:01:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,098 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-10-22 09:01:28,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:28,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-22 09:01:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,118 INFO L225 Difference]: With dead ends: 8484 [2019-10-22 09:01:28,118 INFO L226 Difference]: Without dead ends: 5652 [2019-10-22 09:01:28,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:28,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-10-22 09:01:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-10-22 09:01:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-10-22 09:01:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-10-22 09:01:28,290 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-10-22 09:01:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,290 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-10-22 09:01:28,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-10-22 09:01:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-22 09:01:28,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,296 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-10-22 09:01:28,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:28,498 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-10-22 09:01:28,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920314646] [2019-10-22 09:01:28,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:28,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920314646] [2019-10-22 09:01:28,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952789880] [2019-10-22 09:01:28,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:28,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-22 09:01:28,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:28,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:28,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57680603] [2019-10-22 09:01:28,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:28,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:28,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:28,730 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-10-22 09:01:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,128 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-10-22 09:01:29,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:29,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-22 09:01:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,139 INFO L225 Difference]: With dead ends: 11836 [2019-10-22 09:01:29,139 INFO L226 Difference]: Without dead ends: 5994 [2019-10-22 09:01:29,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-10-22 09:01:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-10-22 09:01:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-10-22 09:01:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-10-22 09:01:29,326 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-10-22 09:01:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,326 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-10-22 09:01:29,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-10-22 09:01:29,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-22 09:01:29,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,334 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:29,535 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:29,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-10-22 09:01:29,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847932994] [2019-10-22 09:01:29,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:29,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847932994] [2019-10-22 09:01:29,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37451630] [2019-10-22 09:01:29,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:29,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-22 09:01:29,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:29,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:29,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467052872] [2019-10-22 09:01:29,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:29,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:29,722 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-10-22 09:01:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,006 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-10-22 09:01:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:30,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-22 09:01:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,014 INFO L225 Difference]: With dead ends: 10593 [2019-10-22 09:01:30,014 INFO L226 Difference]: Without dead ends: 4615 [2019-10-22 09:01:30,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-10-22 09:01:30,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-10-22 09:01:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-10-22 09:01:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-10-22 09:01:30,164 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-10-22 09:01:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:30,164 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-10-22 09:01:30,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-10-22 09:01:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-22 09:01:30,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:30,171 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:30,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:30,372 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,372 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-10-22 09:01:30,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542977419] [2019-10-22 09:01:30,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-22 09:01:30,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542977419] [2019-10-22 09:01:30,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029618792] [2019-10-22 09:01:30,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:30,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-22 09:01:30,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:30,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-22 09:01:30,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809312263] [2019-10-22 09:01:30,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:30,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:30,634 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-10-22 09:01:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,773 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-10-22 09:01:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:30,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-22 09:01:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,782 INFO L225 Difference]: With dead ends: 8870 [2019-10-22 09:01:30,782 INFO L226 Difference]: Without dead ends: 4473 [2019-10-22 09:01:30,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-10-22 09:01:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-10-22 09:01:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-10-22 09:01:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-10-22 09:01:30,926 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-10-22 09:01:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:30,927 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-10-22 09:01:30,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-10-22 09:01:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-22 09:01:30,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:30,933 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:31,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:31,133 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-10-22 09:01:31,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714554526] [2019-10-22 09:01:31,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-22 09:01:31,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714554526] [2019-10-22 09:01:31,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247728561] [2019-10-22 09:01:31,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-10-22 09:01:31,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:31,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-22 09:01:31,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111843964] [2019-10-22 09:01:31,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:31,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:31,329 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-10-22 09:01:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,564 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-10-22 09:01:31,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:31,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-22 09:01:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:31,570 INFO L225 Difference]: With dead ends: 7803 [2019-10-22 09:01:31,570 INFO L226 Difference]: Without dead ends: 3298 [2019-10-22 09:01:31,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-10-22 09:01:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-10-22 09:01:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-10-22 09:01:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-10-22 09:01:31,669 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-10-22 09:01:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,669 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-10-22 09:01:31,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-10-22 09:01:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-22 09:01:31,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,675 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:31,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:31,876 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-10-22 09:01:31,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714838942] [2019-10-22 09:01:31,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:31,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714838942] [2019-10-22 09:01:31,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953026782] [2019-10-22 09:01:31,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:31,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-22 09:01:31,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:31,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:31,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-10-22 09:01:32,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:32,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:32,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77493559] [2019-10-22 09:01:32,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:32,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:32,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:32,018 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-10-22 09:01:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,275 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-10-22 09:01:32,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:32,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-22 09:01:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,282 INFO L225 Difference]: With dead ends: 6414 [2019-10-22 09:01:32,282 INFO L226 Difference]: Without dead ends: 3362 [2019-10-22 09:01:32,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-10-22 09:01:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-10-22 09:01:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-10-22 09:01:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-10-22 09:01:32,438 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-10-22 09:01:32,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,438 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-10-22 09:01:32,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-10-22 09:01:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-22 09:01:32,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,443 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:32,644 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-10-22 09:01:32,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934053859] [2019-10-22 09:01:32,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:32,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934053859] [2019-10-22 09:01:32,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86185801] [2019-10-22 09:01:32,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 09:01:32,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:32,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:32,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044988935] [2019-10-22 09:01:32,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:32,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:32,813 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-10-22 09:01:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,954 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-10-22 09:01:32,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:32,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-22 09:01:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,965 INFO L225 Difference]: With dead ends: 9098 [2019-10-22 09:01:32,965 INFO L226 Difference]: Without dead ends: 6110 [2019-10-22 09:01:32,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-10-22 09:01:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-10-22 09:01:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-10-22 09:01:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-10-22 09:01:33,143 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-10-22 09:01:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,143 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-10-22 09:01:33,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-10-22 09:01:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-22 09:01:33,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,150 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1] [2019-10-22 09:01:33,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:33,350 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-10-22 09:01:33,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854365889] [2019-10-22 09:01:33,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:33,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854365889] [2019-10-22 09:01:33,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581063854] [2019-10-22 09:01:33,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:33,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 09:01:33,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:33,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:33,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727269859] [2019-10-22 09:01:33,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:33,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:33,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:33,499 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-10-22 09:01:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,694 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-10-22 09:01:33,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:33,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-10-22 09:01:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,710 INFO L225 Difference]: With dead ends: 12076 [2019-10-22 09:01:33,710 INFO L226 Difference]: Without dead ends: 9088 [2019-10-22 09:01:33,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-10-22 09:01:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-10-22 09:01:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-10-22 09:01:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-10-22 09:01:34,067 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-10-22 09:01:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,067 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-10-22 09:01:34,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-10-22 09:01:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-22 09:01:34,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:34,076 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:34,277 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-10-22 09:01:34,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863599288] [2019-10-22 09:01:34,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:34,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863599288] [2019-10-22 09:01:34,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036357040] [2019-10-22 09:01:34,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:01:34,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-22 09:01:34,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:34,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:34,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048884718] [2019-10-22 09:01:34,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:34,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:34,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:34,432 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-10-22 09:01:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,751 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-10-22 09:01:34,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:34,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-22 09:01:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,775 INFO L225 Difference]: With dead ends: 20674 [2019-10-22 09:01:34,776 INFO L226 Difference]: Without dead ends: 14708 [2019-10-22 09:01:34,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:34,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-10-22 09:01:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-10-22 09:01:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-10-22 09:01:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-10-22 09:01:35,192 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-10-22 09:01:35,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,193 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-10-22 09:01:35,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-10-22 09:01:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-22 09:01:35,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,202 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:35,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:35,403 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,404 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-10-22 09:01:35,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:35,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412251334] [2019-10-22 09:01:35,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 198 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:35,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412251334] [2019-10-22 09:01:35,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741426340] [2019-10-22 09:01:35,470 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:35,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-22 09:01:35,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:35,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-10-22 09:01:35,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:35,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:35,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706881788] [2019-10-22 09:01:35,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:35,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:35,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:35,574 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-10-22 09:01:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:36,187 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-10-22 09:01:36,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:36,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-22 09:01:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:36,213 INFO L225 Difference]: With dead ends: 30070 [2019-10-22 09:01:36,213 INFO L226 Difference]: Without dead ends: 15314 [2019-10-22 09:01:36,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-10-22 09:01:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-10-22 09:01:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-10-22 09:01:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-10-22 09:01:36,632 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-10-22 09:01:36,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:36,632 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-10-22 09:01:36,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-10-22 09:01:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-22 09:01:36,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:36,645 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:36,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:36,846 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:36,847 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-10-22 09:01:36,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:36,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458184954] [2019-10-22 09:01:36,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:36,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 198 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:36,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458184954] [2019-10-22 09:01:36,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397105702] [2019-10-22 09:01:36,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:36,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-10-22 09:01:37,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:37,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-22 09:01:37,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479649508] [2019-10-22 09:01:37,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:37,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:37,001 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-10-22 09:01:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,645 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-10-22 09:01:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:37,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-22 09:01:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,671 INFO L225 Difference]: With dead ends: 29822 [2019-10-22 09:01:37,672 INFO L226 Difference]: Without dead ends: 15186 [2019-10-22 09:01:37,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-10-22 09:01:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-10-22 09:01:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-10-22 09:01:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-10-22 09:01:38,134 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-10-22 09:01:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,135 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-10-22 09:01:38,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-10-22 09:01:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-22 09:01:38,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,147 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:38,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:38,348 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:38,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-10-22 09:01:38,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:38,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371642389] [2019-10-22 09:01:38,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-22 09:01:38,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371642389] [2019-10-22 09:01:38,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007350221] [2019-10-22 09:01:38,399 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:38,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 09:01:38,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:01:38,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:38,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-10-22 09:01:38,506 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:01:38,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-10-22 09:01:38,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10398493] [2019-10-22 09:01:38,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:38,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:38,507 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-10-22 09:01:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,449 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-10-22 09:01:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 09:01:40,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-10-22 09:01:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,496 INFO L225 Difference]: With dead ends: 50232 [2019-10-22 09:01:40,496 INFO L226 Difference]: Without dead ends: 34696 [2019-10-22 09:01:40,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:40,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-10-22 09:01:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-10-22 09:01:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-10-22 09:01:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-10-22 09:01:41,069 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-10-22 09:01:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:41,069 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-10-22 09:01:41,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-10-22 09:01:41,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-22 09:01:41,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:41,074 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:41,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:41,274 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-10-22 09:01:41,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378459600] [2019-10-22 09:01:41,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:41,401 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:41,401 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:01:41,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:41 BoogieIcfgContainer [2019-10-22 09:01:41,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:41,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:41,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:41,504 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:41,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:20" (3/4) ... [2019-10-22 09:01:41,506 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:01:41,617 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_316361c1-19d5-4860-afc3-b93c4e676b2f/bin/uautomizer/witness.graphml [2019-10-22 09:01:41,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:41,621 INFO L168 Benchmark]: Toolchain (without parser) took 22263.26 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 943.1 MB in the beginning and 1.4 GB in the end (delta: -426.1 MB). Peak memory consumption was 632.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,621 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:41,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:41,622 INFO L168 Benchmark]: Boogie Preprocessor took 60.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,622 INFO L168 Benchmark]: RCFGBuilder took 827.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,622 INFO L168 Benchmark]: TraceAbstraction took 20772.19 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 936.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -357.1 MB). Peak memory consumption was 579.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,622 INFO L168 Benchmark]: Witness Printer took 115.79 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:41,623 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 827.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20772.19 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 936.4 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -357.1 MB). Peak memory consumption was 579.3 MB. Max. memory is 11.5 GB. * Witness Printer took 115.79 ms. Allocated memory is still 2.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 631]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L636] int s ; [L637] int tmp ; [L641] s = 8464 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__hit = __VERIFIER_nondet_int() ; [L22] int s__rwstate ; [L23] int s__init_buf___0 = 1; [L24] int s__debug = __VERIFIER_nondet_int() ; [L25] int s__shutdown ; [L26] int s__cert = __VERIFIER_nondet_int() ; [L27] int s__options = __VERIFIER_nondet_int() ; [L28] int s__verify_mode = __VERIFIER_nondet_int() ; [L29] int s__session__peer = __VERIFIER_nondet_int() ; [L30] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L31] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L34] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__cert_request ; [L36] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__use_rsa_tmp ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_cipher__algo_strength ; [L42] int s__session__cipher ; [L43] int buf ; [L44] unsigned long l ; [L45] unsigned long Time ; [L46] unsigned long tmp ; [L47] int cb ; [L48] long num1 = __VERIFIER_nondet_long() ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int got_new_session ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 = __VERIFIER_nondet_int() ; [L61] long tmp___8 = __VERIFIER_nondet_long() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int tmp___10 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] unsigned long __cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L69] unsigned long __cil_tmp59 ; [L70] int __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND TRUE tmp___1 + 12288 [L91] COND TRUE tmp___2 + 16384 [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L294] COND FALSE !(ret <= 0) [L297] COND FALSE !(\read(s__hit)) [L300] s__state = 8512 [L302] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L307] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L308] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L309] COND TRUE __cil_tmp56 + 256UL [L310] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L360] ret = __VERIFIER_nondet_int() [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L383] COND TRUE s__verify_mode + 1 [L384] COND FALSE !(s__session__peer != 0) [L395] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L396] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L397] COND FALSE !(__cil_tmp61 + 256UL) [L407] s__s3__tmp__cert_request = 1 [L408] ret = __VERIFIER_nondet_int() [L409] COND FALSE !(ret <= 0) [L412] s__state = 8448 [L413] s__s3__tmp__next_state___0 = 8576 [L414] s__init_num = 0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND TRUE s__state == 8448 [L435] COND FALSE !(num1 > 0L) [L444] s__state = s__s3__tmp__next_state___0 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND FALSE !(state == 8576) [L620] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND TRUE s__state == 8576 [L448] ret = __VERIFIER_nondet_int() [L449] COND FALSE !(ret <= 0) [L452] COND FALSE !(ret == 2) [L455] ret = __VERIFIER_nondet_int() [L456] COND FALSE !(ret <= 0) [L459] s__init_num = 0 [L460] s__state = 8592 [L585] COND FALSE !(! s__s3__tmp__reuse_message) [L603] COND TRUE state == 8576 [L604] COND TRUE s__state == 8592 [L605] COND TRUE tmp___1 != -12288 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE __cil_tmp56 != 4294967040 [L608] COND TRUE __cil_tmp58 != 4294967294 [L609] COND TRUE tmp___7 != 1024 [L610] COND TRUE tmp___7 != 512 [L631] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 20.7s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2283 GetRequests, 2203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17906occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 6893 NumberOfCodeBlocks, 6601 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 6649 ConstructedInterpolants, 0 QuantifiedInterpolants, 1685570 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3883 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 53 InterpolantComputations, 40 PerfectInterpolantSequences, 9886/10231 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...