./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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 f4c57aae7ed3dd683b199a99be2cffcf6f23506e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-678e011 [2019-11-19 23:37:53,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:37:53,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:37:53,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:37:53,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:37:53,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:37:53,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:37:53,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:37:53,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:37:53,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:37:53,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:37:53,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:37:53,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:37:53,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:37:53,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:37:53,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:37:53,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:37:53,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:37:53,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:37:53,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:37:53,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:37:53,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:37:53,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:37:53,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:37:53,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:37:53,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:37:53,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:37:53,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:37:53,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:37:53,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:37:53,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:37:53,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:37:53,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:37:53,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:37:53,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:37:53,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:37:53,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:37:53,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:37:53,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:37:53,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:37:53,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:37:53,864 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:37:53,887 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:37:53,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:37:53,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:37:53,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:37:53,888 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:37:53,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:37:53,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:37:53,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:37:53,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:37:53,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:37:53,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:37:53,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:37:53,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:37:53,890 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:37:53,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:37:53,890 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:37:53,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:37:53,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:37:53,891 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:37:53,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:37:53,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:37:53,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:37:53,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:37:53,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:37:53,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:37:53,892 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:37:53,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:37:53,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:37:53,893 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/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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 -> f4c57aae7ed3dd683b199a99be2cffcf6f23506e [2019-11-19 23:37:54,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:37:54,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:37:54,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:37:54,065 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:37:54,066 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:37:54,066 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-19 23:37:54,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/data/8fa7b64ba/48dea82475244aa9a52fe6e6cbcbd8df/FLAGdefed0b76 [2019-11-19 23:37:54,555 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:37:54,576 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-19 23:37:54,590 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/data/8fa7b64ba/48dea82475244aa9a52fe6e6cbcbd8df/FLAGdefed0b76 [2019-11-19 23:37:54,907 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/data/8fa7b64ba/48dea82475244aa9a52fe6e6cbcbd8df [2019-11-19 23:37:54,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:37:54,910 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:37:54,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:37:54,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:37:54,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:37:54,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:37:54" (1/1) ... [2019-11-19 23:37:54,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44224560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:54, skipping insertion in model container [2019-11-19 23:37:54,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:37:54" (1/1) ... [2019-11-19 23:37:54,923 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:37:54,964 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:37:55,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:37:55,259 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:37:55,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:37:55,360 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:37:55,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55 WrapperNode [2019-11-19 23:37:55,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:37:55,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:37:55,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:37:55,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:37:55,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:37:55,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:37:55,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:37:55,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:37:55,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... [2019-11-19 23:37:55,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:37:55,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:37:55,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:37:55,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:37:55,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:37:55,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:37:55,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:37:55,729 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:37:56,324 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-19 23:37:56,324 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-19 23:37:56,326 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:37:56,326 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:37:56,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:37:56 BoogieIcfgContainer [2019-11-19 23:37:56,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:37:56,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:37:56,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:37:56,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:37:56,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:37:54" (1/3) ... [2019-11-19 23:37:56,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71179d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:37:56, skipping insertion in model container [2019-11-19 23:37:56,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:37:55" (2/3) ... [2019-11-19 23:37:56,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71179d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:37:56, skipping insertion in model container [2019-11-19 23:37:56,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:37:56" (3/3) ... [2019-11-19 23:37:56,334 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-11-19 23:37:56,342 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:37:56,349 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:37:56,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:37:56,381 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:37:56,381 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:37:56,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:37:56,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:37:56,382 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:37:56,382 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:37:56,382 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:37:56,382 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:37:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-19 23:37:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:37:56,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:56,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:56,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:56,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-11-19 23:37:56,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:56,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82846910] [2019-11-19 23:37:56,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:56,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82846910] [2019-11-19 23:37:56,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:56,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452023119] [2019-11-19 23:37:56,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:56,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:56,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:56,616 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-19 23:37:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:56,851 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-11-19 23:37:56,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:56,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 23:37:56,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:56,865 INFO L225 Difference]: With dead ends: 315 [2019-11-19 23:37:56,865 INFO L226 Difference]: Without dead ends: 154 [2019-11-19 23:37:56,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-19 23:37:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-11-19 23:37:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-19 23:37:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-11-19 23:37:56,915 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-11-19 23:37:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:56,915 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-11-19 23:37:56,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-11-19 23:37:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 23:37:56,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:56,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:56,918 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:56,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-11-19 23:37:56,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:56,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336015255] [2019-11-19 23:37:56,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:56,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336015255] [2019-11-19 23:37:56,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:56,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:56,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912648658] [2019-11-19 23:37:56,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:56,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:56,976 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-11-19 23:37:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:57,138 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-11-19 23:37:57,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:57,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 23:37:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:57,140 INFO L225 Difference]: With dead ends: 318 [2019-11-19 23:37:57,140 INFO L226 Difference]: Without dead ends: 173 [2019-11-19 23:37:57,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-19 23:37:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-19 23:37:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-19 23:37:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-11-19 23:37:57,171 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-11-19 23:37:57,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:57,172 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-11-19 23:37:57,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:57,172 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-11-19 23:37:57,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 23:37:57,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:57,175 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:57,175 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:57,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:57,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-11-19 23:37:57,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:57,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392766623] [2019-11-19 23:37:57,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:57,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392766623] [2019-11-19 23:37:57,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:57,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:57,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504871267] [2019-11-19 23:37:57,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:57,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:57,256 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-11-19 23:37:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:57,414 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-11-19 23:37:57,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:57,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 23:37:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:57,417 INFO L225 Difference]: With dead ends: 347 [2019-11-19 23:37:57,417 INFO L226 Difference]: Without dead ends: 181 [2019-11-19 23:37:57,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-19 23:37:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-19 23:37:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-19 23:37:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-11-19 23:37:57,434 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-11-19 23:37:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:57,435 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-11-19 23:37:57,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:57,435 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-11-19 23:37:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 23:37:57,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:57,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:57,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:57,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:57,437 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-11-19 23:37:57,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:57,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882517106] [2019-11-19 23:37:57,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:57,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882517106] [2019-11-19 23:37:57,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:57,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:57,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429850450] [2019-11-19 23:37:57,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:57,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:57,509 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-11-19 23:37:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:57,719 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-11-19 23:37:57,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:57,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 23:37:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:57,722 INFO L225 Difference]: With dead ends: 352 [2019-11-19 23:37:57,722 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 23:37:57,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 23:37:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-19 23:37:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-19 23:37:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-11-19 23:37:57,760 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-11-19 23:37:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:57,760 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-11-19 23:37:57,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-11-19 23:37:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:37:57,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:57,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:57,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-11-19 23:37:57,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:57,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933241647] [2019-11-19 23:37:57,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:57,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933241647] [2019-11-19 23:37:57,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:57,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:57,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142965310] [2019-11-19 23:37:57,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:57,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:57,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:57,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:57,841 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-11-19 23:37:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:58,022 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-11-19 23:37:58,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:58,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 23:37:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:58,025 INFO L225 Difference]: With dead ends: 363 [2019-11-19 23:37:58,025 INFO L226 Difference]: Without dead ends: 190 [2019-11-19 23:37:58,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-19 23:37:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-19 23:37:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-19 23:37:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-11-19 23:37:58,045 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-11-19 23:37:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:58,046 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-11-19 23:37:58,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-11-19 23:37:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 23:37:58,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:58,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:58,048 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-11-19 23:37:58,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:58,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327565786] [2019-11-19 23:37:58,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:58,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327565786] [2019-11-19 23:37:58,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:58,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:58,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975796227] [2019-11-19 23:37:58,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:58,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:58,137 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-11-19 23:37:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:58,328 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-11-19 23:37:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:58,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 23:37:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:58,330 INFO L225 Difference]: With dead ends: 363 [2019-11-19 23:37:58,330 INFO L226 Difference]: Without dead ends: 190 [2019-11-19 23:37:58,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-19 23:37:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-19 23:37:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-19 23:37:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-11-19 23:37:58,340 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-11-19 23:37:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:58,341 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-11-19 23:37:58,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-11-19 23:37:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 23:37:58,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:58,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:58,343 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-11-19 23:37:58,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:58,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416074715] [2019-11-19 23:37:58,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:58,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416074715] [2019-11-19 23:37:58,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:58,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:58,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545002897] [2019-11-19 23:37:58,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:58,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:58,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:58,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:58,378 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-11-19 23:37:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:58,535 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-11-19 23:37:58,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:58,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 23:37:58,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:58,537 INFO L225 Difference]: With dead ends: 363 [2019-11-19 23:37:58,537 INFO L226 Difference]: Without dead ends: 190 [2019-11-19 23:37:58,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-19 23:37:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-19 23:37:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-19 23:37:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-11-19 23:37:58,546 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-11-19 23:37:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:58,546 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-11-19 23:37:58,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-11-19 23:37:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 23:37:58,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:58,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:58,548 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:58,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-11-19 23:37:58,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:58,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991576913] [2019-11-19 23:37:58,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:58,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991576913] [2019-11-19 23:37:58,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:58,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:37:58,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476315425] [2019-11-19 23:37:58,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:37:58,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:58,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:37:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:37:58,616 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-11-19 23:37:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:58,897 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-11-19 23:37:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:37:58,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-19 23:37:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:58,901 INFO L225 Difference]: With dead ends: 511 [2019-11-19 23:37:58,901 INFO L226 Difference]: Without dead ends: 338 [2019-11-19 23:37:58,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:37:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-19 23:37:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-11-19 23:37:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-19 23:37:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-11-19 23:37:58,919 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-11-19 23:37:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:58,920 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-11-19 23:37:58,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:37:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-11-19 23:37:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 23:37:58,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:58,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:58,922 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:58,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:58,922 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-11-19 23:37:58,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:58,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751975351] [2019-11-19 23:37:58,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:58,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751975351] [2019-11-19 23:37:58,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:58,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:58,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040505132] [2019-11-19 23:37:58,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:58,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:58,958 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-11-19 23:37:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:59,150 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-11-19 23:37:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:59,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-19 23:37:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:59,154 INFO L225 Difference]: With dead ends: 698 [2019-11-19 23:37:59,154 INFO L226 Difference]: Without dead ends: 382 [2019-11-19 23:37:59,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-19 23:37:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-19 23:37:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-19 23:37:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-11-19 23:37:59,175 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-11-19 23:37:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:59,176 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-11-19 23:37:59,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-11-19 23:37:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 23:37:59,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:59,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:37:59,177 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-11-19 23:37:59,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:59,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888588816] [2019-11-19 23:37:59,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:37:59,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888588816] [2019-11-19 23:37:59,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:59,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:59,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154209937] [2019-11-19 23:37:59,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:59,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:59,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:59,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,224 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-11-19 23:37:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:59,435 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-11-19 23:37:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:59,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-19 23:37:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:59,439 INFO L225 Difference]: With dead ends: 775 [2019-11-19 23:37:59,439 INFO L226 Difference]: Without dead ends: 406 [2019-11-19 23:37:59,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-19 23:37:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-11-19 23:37:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-19 23:37:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-11-19 23:37:59,461 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-11-19 23:37:59,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:59,462 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-11-19 23:37:59,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-11-19 23:37:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 23:37:59,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:59,463 INFO L410 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-11-19 23:37:59,464 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-11-19 23:37:59,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:59,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756706852] [2019-11-19 23:37:59,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 23:37:59,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756706852] [2019-11-19 23:37:59,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:59,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:59,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975140068] [2019-11-19 23:37:59,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:59,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:59,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:59,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,502 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-11-19 23:37:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:59,666 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-11-19 23:37:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:59,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-19 23:37:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:59,670 INFO L225 Difference]: With dead ends: 829 [2019-11-19 23:37:59,670 INFO L226 Difference]: Without dead ends: 438 [2019-11-19 23:37:59,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-19 23:37:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-11-19 23:37:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-19 23:37:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-11-19 23:37:59,689 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-11-19 23:37:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:59,689 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-11-19 23:37:59,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-11-19 23:37:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 23:37:59,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:59,691 INFO L410 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-11-19 23:37:59,691 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-11-19 23:37:59,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:59,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983906471] [2019-11-19 23:37:59,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 23:37:59,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983906471] [2019-11-19 23:37:59,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:59,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:59,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903676545] [2019-11-19 23:37:59,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:59,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:59,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,725 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-11-19 23:37:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:37:59,909 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-11-19 23:37:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:37:59,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-19 23:37:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:37:59,913 INFO L225 Difference]: With dead ends: 911 [2019-11-19 23:37:59,913 INFO L226 Difference]: Without dead ends: 480 [2019-11-19 23:37:59,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-19 23:37:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-19 23:37:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-19 23:37:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-11-19 23:37:59,935 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-11-19 23:37:59,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:37:59,935 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-11-19 23:37:59,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:37:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-11-19 23:37:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 23:37:59,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:37:59,937 INFO L410 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-11-19 23:37:59,937 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:37:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:37:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-11-19 23:37:59,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:37:59,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305496163] [2019-11-19 23:37:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:37:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:37:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 23:37:59,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305496163] [2019-11-19 23:37:59,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:37:59,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:37:59,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127951637] [2019-11-19 23:37:59,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:37:59,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:37:59,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:37:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:37:59,986 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-11-19 23:38:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:00,148 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-11-19 23:38:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:00,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-19 23:38:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:00,152 INFO L225 Difference]: With dead ends: 949 [2019-11-19 23:38:00,152 INFO L226 Difference]: Without dead ends: 480 [2019-11-19 23:38:00,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-19 23:38:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-19 23:38:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-19 23:38:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-11-19 23:38:00,172 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-11-19 23:38:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:00,173 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-11-19 23:38:00,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:00,174 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-11-19 23:38:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 23:38:00,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:00,181 INFO L410 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-11-19 23:38:00,181 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-11-19 23:38:00,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:00,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353910331] [2019-11-19 23:38:00,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 23:38:00,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353910331] [2019-11-19 23:38:00,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:00,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:00,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286358372] [2019-11-19 23:38:00,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:00,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:00,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,220 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-11-19 23:38:00,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:00,377 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-11-19 23:38:00,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:00,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 23:38:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:00,381 INFO L225 Difference]: With dead ends: 997 [2019-11-19 23:38:00,381 INFO L226 Difference]: Without dead ends: 528 [2019-11-19 23:38:00,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-19 23:38:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-19 23:38:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-19 23:38:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-11-19 23:38:00,404 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-11-19 23:38:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:00,404 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-11-19 23:38:00,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-11-19 23:38:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 23:38:00,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:00,406 INFO L410 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-11-19 23:38:00,406 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-11-19 23:38:00,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:00,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658451143] [2019-11-19 23:38:00,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 23:38:00,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658451143] [2019-11-19 23:38:00,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:00,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:00,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787468776] [2019-11-19 23:38:00,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:00,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:00,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:00,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,446 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-11-19 23:38:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:00,603 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-11-19 23:38:00,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:00,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 23:38:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:00,607 INFO L225 Difference]: With dead ends: 1033 [2019-11-19 23:38:00,607 INFO L226 Difference]: Without dead ends: 528 [2019-11-19 23:38:00,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-19 23:38:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-19 23:38:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-19 23:38:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-11-19 23:38:00,631 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-11-19 23:38:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:00,632 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-11-19 23:38:00,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:00,632 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-11-19 23:38:00,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-19 23:38:00,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:00,634 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-19 23:38:00,634 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:00,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-11-19 23:38:00,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:00,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30384955] [2019-11-19 23:38:00,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:38:00,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30384955] [2019-11-19 23:38:00,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:00,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:00,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599817016] [2019-11-19 23:38:00,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:00,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:00,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:00,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,694 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-11-19 23:38:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:00,913 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-11-19 23:38:00,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:00,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-19 23:38:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:00,917 INFO L225 Difference]: With dead ends: 1078 [2019-11-19 23:38:00,918 INFO L226 Difference]: Without dead ends: 573 [2019-11-19 23:38:00,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-19 23:38:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-11-19 23:38:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-19 23:38:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-11-19 23:38:00,946 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-11-19 23:38:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:00,947 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-11-19 23:38:00,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-11-19 23:38:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-19 23:38:00,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:00,949 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-19 23:38:00,949 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-11-19 23:38:00,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:00,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416638485] [2019-11-19 23:38:00,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:38:00,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416638485] [2019-11-19 23:38:00,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:00,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:00,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455540309] [2019-11-19 23:38:00,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:00,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:00,987 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-11-19 23:38:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:01,230 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-11-19 23:38:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:01,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-19 23:38:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:01,235 INFO L225 Difference]: With dead ends: 1131 [2019-11-19 23:38:01,235 INFO L226 Difference]: Without dead ends: 571 [2019-11-19 23:38:01,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-19 23:38:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-11-19 23:38:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-19 23:38:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-11-19 23:38:01,261 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-11-19 23:38:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:01,261 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-11-19 23:38:01,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-11-19 23:38:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 23:38:01,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:01,263 INFO L410 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-11-19 23:38:01,263 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:01,264 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-11-19 23:38:01,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:01,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665233742] [2019-11-19 23:38:01,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:38:01,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665233742] [2019-11-19 23:38:01,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:01,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:01,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491591754] [2019-11-19 23:38:01,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:01,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:01,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,302 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-11-19 23:38:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:01,469 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-11-19 23:38:01,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:01,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 23:38:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:01,474 INFO L225 Difference]: With dead ends: 1159 [2019-11-19 23:38:01,474 INFO L226 Difference]: Without dead ends: 603 [2019-11-19 23:38:01,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-19 23:38:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-19 23:38:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-19 23:38:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-11-19 23:38:01,506 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-11-19 23:38:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:01,507 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-11-19 23:38:01,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-11-19 23:38:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-19 23:38:01,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:01,509 INFO L410 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-11-19 23:38:01,509 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-11-19 23:38:01,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:01,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763949950] [2019-11-19 23:38:01,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:38:01,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763949950] [2019-11-19 23:38:01,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:01,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:01,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450355608] [2019-11-19 23:38:01,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:01,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,548 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-11-19 23:38:01,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:01,720 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-11-19 23:38:01,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:01,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-19 23:38:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:01,725 INFO L225 Difference]: With dead ends: 1189 [2019-11-19 23:38:01,725 INFO L226 Difference]: Without dead ends: 603 [2019-11-19 23:38:01,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-19 23:38:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-19 23:38:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-19 23:38:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-11-19 23:38:01,754 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-11-19 23:38:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:01,755 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-11-19 23:38:01,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-11-19 23:38:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-19 23:38:01,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:01,757 INFO L410 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-11-19 23:38:01,757 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:01,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:01,758 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-11-19 23:38:01,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:01,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617097081] [2019-11-19 23:38:01,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 23:38:01,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617097081] [2019-11-19 23:38:01,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:01,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:01,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235068047] [2019-11-19 23:38:01,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:01,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:01,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,798 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-11-19 23:38:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:01,958 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-11-19 23:38:01,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:01,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-19 23:38:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:01,962 INFO L225 Difference]: With dead ends: 1239 [2019-11-19 23:38:01,963 INFO L226 Difference]: Without dead ends: 653 [2019-11-19 23:38:01,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:01,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-19 23:38:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-19 23:38:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-19 23:38:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-11-19 23:38:01,991 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-11-19 23:38:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:01,991 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-11-19 23:38:01,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-11-19 23:38:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 23:38:01,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:01,994 INFO L410 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-11-19 23:38:01,994 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:01,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:01,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-11-19 23:38:01,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:01,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82985133] [2019-11-19 23:38:01,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 23:38:02,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82985133] [2019-11-19 23:38:02,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:02,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:02,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200137813] [2019-11-19 23:38:02,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:02,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,025 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-11-19 23:38:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:02,177 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-11-19 23:38:02,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:02,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-19 23:38:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:02,181 INFO L225 Difference]: With dead ends: 1273 [2019-11-19 23:38:02,181 INFO L226 Difference]: Without dead ends: 653 [2019-11-19 23:38:02,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-19 23:38:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-19 23:38:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-19 23:38:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-11-19 23:38:02,218 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-11-19 23:38:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:02,218 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-11-19 23:38:02,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-11-19 23:38:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-19 23:38:02,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:02,220 INFO L410 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-11-19 23:38:02,220 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-11-19 23:38:02,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:02,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91325801] [2019-11-19 23:38:02,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:02,255 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:38:02,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91325801] [2019-11-19 23:38:02,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:02,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:02,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043772539] [2019-11-19 23:38:02,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:02,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:02,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,257 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-11-19 23:38:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:02,440 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-11-19 23:38:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:02,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-19 23:38:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:02,444 INFO L225 Difference]: With dead ends: 1300 [2019-11-19 23:38:02,444 INFO L226 Difference]: Without dead ends: 680 [2019-11-19 23:38:02,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-19 23:38:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-11-19 23:38:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-19 23:38:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-11-19 23:38:02,475 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-11-19 23:38:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:02,475 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-11-19 23:38:02,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-11-19 23:38:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 23:38:02,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:02,478 INFO L410 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-11-19 23:38:02,478 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-11-19 23:38:02,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:02,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677700255] [2019-11-19 23:38:02,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-19 23:38:02,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677700255] [2019-11-19 23:38:02,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:02,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:38:02,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621111091] [2019-11-19 23:38:02,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:02,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:02,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:02,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,522 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-11-19 23:38:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:02,579 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-11-19 23:38:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:02,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-19 23:38:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:02,587 INFO L225 Difference]: With dead ends: 1343 [2019-11-19 23:38:02,587 INFO L226 Difference]: Without dead ends: 1341 [2019-11-19 23:38:02,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-19 23:38:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-11-19 23:38:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-11-19 23:38:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-11-19 23:38:02,636 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-11-19 23:38:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:02,636 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-11-19 23:38:02,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-11-19 23:38:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 23:38:02,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:02,639 INFO L410 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-11-19 23:38:02,640 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-11-19 23:38:02,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:02,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684280578] [2019-11-19 23:38:02,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-19 23:38:02,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684280578] [2019-11-19 23:38:02,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:02,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:38:02,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257544998] [2019-11-19 23:38:02,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:02,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:02,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,675 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-11-19 23:38:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:02,743 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-11-19 23:38:02,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:02,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-19 23:38:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:02,754 INFO L225 Difference]: With dead ends: 3328 [2019-11-19 23:38:02,755 INFO L226 Difference]: Without dead ends: 1996 [2019-11-19 23:38:02,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-19 23:38:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-11-19 23:38:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-19 23:38:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-11-19 23:38:02,827 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-11-19 23:38:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:02,828 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-11-19 23:38:02,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-11-19 23:38:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 23:38:02,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:02,831 INFO L410 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-11-19 23:38:02,832 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-11-19 23:38:02,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:02,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162902088] [2019-11-19 23:38:02,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 23:38:02,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162902088] [2019-11-19 23:38:02,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:02,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:02,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070656128] [2019-11-19 23:38:02,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:02,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,871 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-11-19 23:38:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:02,962 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-11-19 23:38:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:02,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-19 23:38:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:02,977 INFO L225 Difference]: With dead ends: 4616 [2019-11-19 23:38:02,978 INFO L226 Difference]: Without dead ends: 2629 [2019-11-19 23:38:02,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-11-19 23:38:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-11-19 23:38:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-11-19 23:38:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-11-19 23:38:03,076 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-11-19 23:38:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:03,076 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-11-19 23:38:03,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-11-19 23:38:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-19 23:38:03,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:03,082 INFO L410 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-11-19 23:38:03,082 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-11-19 23:38:03,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:03,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484021474] [2019-11-19 23:38:03,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:38:03,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484021474] [2019-11-19 23:38:03,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:03,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:03,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732461213] [2019-11-19 23:38:03,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:03,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:03,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:03,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:03,130 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-11-19 23:38:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:03,394 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-11-19 23:38:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:03,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-19 23:38:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:03,409 INFO L225 Difference]: With dead ends: 5375 [2019-11-19 23:38:03,410 INFO L226 Difference]: Without dead ends: 2755 [2019-11-19 23:38:03,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:03,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-19 23:38:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-19 23:38:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-19 23:38:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-11-19 23:38:03,515 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-11-19 23:38:03,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:03,515 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-11-19 23:38:03,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-11-19 23:38:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-19 23:38:03,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:03,520 INFO L410 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-11-19 23:38:03,520 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:03,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-11-19 23:38:03,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:03,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988408454] [2019-11-19 23:38:03,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:38:03,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988408454] [2019-11-19 23:38:03,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:03,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:38:03,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727542831] [2019-11-19 23:38:03,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:03,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:03,571 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-11-19 23:38:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:03,796 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-11-19 23:38:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:03,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-19 23:38:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:03,811 INFO L225 Difference]: With dead ends: 5471 [2019-11-19 23:38:03,811 INFO L226 Difference]: Without dead ends: 2755 [2019-11-19 23:38:03,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-19 23:38:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-19 23:38:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-19 23:38:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-11-19 23:38:03,908 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-11-19 23:38:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:03,909 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-11-19 23:38:03,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-11-19 23:38:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-19 23:38:03,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:03,913 INFO L410 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-11-19 23:38:03,913 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:03,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:03,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-11-19 23:38:03,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:03,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488047255] [2019-11-19 23:38:03,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-19 23:38:03,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488047255] [2019-11-19 23:38:03,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:03,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:38:03,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443295819] [2019-11-19 23:38:03,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:03,963 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-11-19 23:38:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:04,189 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-11-19 23:38:04,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:04,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-19 23:38:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:04,204 INFO L225 Difference]: With dead ends: 5521 [2019-11-19 23:38:04,205 INFO L226 Difference]: Without dead ends: 2805 [2019-11-19 23:38:04,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-11-19 23:38:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-11-19 23:38:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-19 23:38:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-11-19 23:38:04,298 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-11-19 23:38:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:04,298 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-11-19 23:38:04,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-11-19 23:38:04,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-19 23:38:04,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:04,303 INFO L410 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-11-19 23:38:04,303 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-11-19 23:38:04,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:04,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816377601] [2019-11-19 23:38:04,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-19 23:38:04,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816377601] [2019-11-19 23:38:04,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:38:04,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:38:04,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050250744] [2019-11-19 23:38:04,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:04,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:04,381 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-11-19 23:38:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:04,649 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-11-19 23:38:04,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:04,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-19 23:38:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:04,674 INFO L225 Difference]: With dead ends: 5711 [2019-11-19 23:38:04,680 INFO L226 Difference]: Without dead ends: 2995 [2019-11-19 23:38:04,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:38:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-11-19 23:38:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-11-19 23:38:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-11-19 23:38:04,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-11-19 23:38:04,791 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-11-19 23:38:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:04,791 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-11-19 23:38:04,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-11-19 23:38:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-19 23:38:04,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:04,796 INFO L410 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-11-19 23:38:04,796 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:04,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:04,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-11-19 23:38:04,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:04,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303929319] [2019-11-19 23:38:04,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:04,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303929319] [2019-11-19 23:38:04,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969396550] [2019-11-19 23:38:04,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:04,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:38:05,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-19 23:38:05,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:05,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346232145] [2019-11-19 23:38:05,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:05,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:05,115 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-11-19 23:38:05,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:05,297 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-11-19 23:38:05,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:05,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-19 23:38:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:05,311 INFO L225 Difference]: With dead ends: 8484 [2019-11-19 23:38:05,311 INFO L226 Difference]: Without dead ends: 5652 [2019-11-19 23:38:05,318 INFO L630 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-11-19 23:38:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-11-19 23:38:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-11-19 23:38:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-11-19 23:38:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-11-19 23:38:05,569 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-11-19 23:38:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:05,570 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-11-19 23:38:05,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:05,570 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-11-19 23:38:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-19 23:38:05,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:05,582 INFO L410 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-11-19 23:38:05,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:05,788 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-11-19 23:38:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069685975] [2019-11-19 23:38:05,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 11 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:05,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069685975] [2019-11-19 23:38:05,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20971900] [2019-11-19 23:38:05,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:06,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:06,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-11-19 23:38:06,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:06,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:06,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764916488] [2019-11-19 23:38:06,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:06,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:06,110 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-11-19 23:38:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:06,500 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-11-19 23:38:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:06,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-19 23:38:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:06,513 INFO L225 Difference]: With dead ends: 11836 [2019-11-19 23:38:06,513 INFO L226 Difference]: Without dead ends: 5994 [2019-11-19 23:38:06,521 INFO L630 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-11-19 23:38:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-11-19 23:38:06,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-11-19 23:38:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-11-19 23:38:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-11-19 23:38:06,763 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-11-19 23:38:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:06,764 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-11-19 23:38:06,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-11-19 23:38:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-19 23:38:06,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:06,774 INFO L410 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-11-19 23:38:06,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:06,979 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:06,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-11-19 23:38:06,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:06,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381358014] [2019-11-19 23:38:06,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:07,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381358014] [2019-11-19 23:38:07,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943930775] [2019-11-19 23:38:07,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:07,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:07,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-11-19 23:38:07,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:07,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:07,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131753833] [2019-11-19 23:38:07,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:07,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:07,231 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-11-19 23:38:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:07,621 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-11-19 23:38:07,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:07,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-19 23:38:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:07,629 INFO L225 Difference]: With dead ends: 10593 [2019-11-19 23:38:07,629 INFO L226 Difference]: Without dead ends: 4615 [2019-11-19 23:38:07,637 INFO L630 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-11-19 23:38:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-11-19 23:38:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-11-19 23:38:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-19 23:38:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-11-19 23:38:07,790 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-11-19 23:38:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:07,791 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-11-19 23:38:07,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:07,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-11-19 23:38:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-19 23:38:07,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:07,798 INFO L410 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-11-19 23:38:08,002 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:08,002 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-11-19 23:38:08,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:08,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440084135] [2019-11-19 23:38:08,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-19 23:38:08,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440084135] [2019-11-19 23:38:08,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895719425] [2019-11-19 23:38:08,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:08,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:08,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-19 23:38:08,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:08,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-19 23:38:08,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806557864] [2019-11-19 23:38:08,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:08,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:08,239 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-11-19 23:38:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:08,382 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-11-19 23:38:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:08,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-19 23:38:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:08,391 INFO L225 Difference]: With dead ends: 8870 [2019-11-19 23:38:08,391 INFO L226 Difference]: Without dead ends: 4473 [2019-11-19 23:38:08,397 INFO L630 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-11-19 23:38:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-11-19 23:38:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-11-19 23:38:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-19 23:38:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-11-19 23:38:08,543 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-11-19 23:38:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:08,544 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-11-19 23:38:08,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-11-19 23:38:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-19 23:38:08,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:08,551 INFO L410 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-11-19 23:38:08,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:08,756 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-11-19 23:38:08,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:08,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472041341] [2019-11-19 23:38:08,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 151 proven. 78 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-19 23:38:08,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472041341] [2019-11-19 23:38:08,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270527890] [2019-11-19 23:38:08,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:08,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:08,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-11-19 23:38:09,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:09,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-19 23:38:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764112550] [2019-11-19 23:38:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:09,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:09,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:09,009 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-11-19 23:38:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:09,316 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-11-19 23:38:09,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:09,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-19 23:38:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:09,323 INFO L225 Difference]: With dead ends: 7803 [2019-11-19 23:38:09,323 INFO L226 Difference]: Without dead ends: 3298 [2019-11-19 23:38:09,328 INFO L630 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-11-19 23:38:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-19 23:38:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-11-19 23:38:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-19 23:38:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-11-19 23:38:09,432 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-11-19 23:38:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:09,433 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-11-19 23:38:09,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-11-19 23:38:09,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-19 23:38:09,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:09,440 INFO L410 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-11-19 23:38:09,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:09,645 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-11-19 23:38:09,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:09,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129972682] [2019-11-19 23:38:09,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 191 proven. 19 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:09,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129972682] [2019-11-19 23:38:09,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485633984] [2019-11-19 23:38:09,709 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:09,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-19 23:38:09,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:38:09,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:09,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-19 23:38:09,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:09,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:09,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632343995] [2019-11-19 23:38:09,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:09,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:09,809 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-11-19 23:38:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:10,076 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-11-19 23:38:10,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:10,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-19 23:38:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:10,083 INFO L225 Difference]: With dead ends: 6414 [2019-11-19 23:38:10,083 INFO L226 Difference]: Without dead ends: 3362 [2019-11-19 23:38:10,088 INFO L630 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-11-19 23:38:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-11-19 23:38:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-11-19 23:38:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-19 23:38:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-11-19 23:38:10,205 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-11-19 23:38:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:10,206 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-11-19 23:38:10,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-11-19 23:38:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-19 23:38:10,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:10,212 INFO L410 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-11-19 23:38:10,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:10,416 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:10,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:10,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-11-19 23:38:10,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:10,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226940835] [2019-11-19 23:38:10,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:10,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226940835] [2019-11-19 23:38:10,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916886578] [2019-11-19 23:38:10,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:10,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:38:10,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-19 23:38:10,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:10,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:10,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926297915] [2019-11-19 23:38:10,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:10,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:10,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:10,637 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-11-19 23:38:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:10,848 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-11-19 23:38:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:10,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-19 23:38:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:10,858 INFO L225 Difference]: With dead ends: 9098 [2019-11-19 23:38:10,859 INFO L226 Difference]: Without dead ends: 6110 [2019-11-19 23:38:10,863 INFO L630 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-11-19 23:38:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-11-19 23:38:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-11-19 23:38:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-11-19 23:38:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-11-19 23:38:11,060 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-11-19 23:38:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:11,060 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-11-19 23:38:11,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-11-19 23:38:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-19 23:38:11,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:11,068 INFO L410 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-11-19 23:38:11,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:11,273 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-11-19 23:38:11,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:11,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664786393] [2019-11-19 23:38:11,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:11,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664786393] [2019-11-19 23:38:11,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331170579] [2019-11-19 23:38:11,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:11,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:38:11,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-19 23:38:11,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:11,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:11,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844584658] [2019-11-19 23:38:11,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:11,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:11,474 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-11-19 23:38:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:11,710 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-11-19 23:38:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:11,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-19 23:38:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:11,725 INFO L225 Difference]: With dead ends: 12076 [2019-11-19 23:38:11,726 INFO L226 Difference]: Without dead ends: 9088 [2019-11-19 23:38:11,731 INFO L630 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-11-19 23:38:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-11-19 23:38:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-11-19 23:38:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-11-19 23:38:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-11-19 23:38:12,067 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-11-19 23:38:12,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:12,067 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-11-19 23:38:12,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-11-19 23:38:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-19 23:38:12,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:12,079 INFO L410 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-11-19 23:38:12,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:12,284 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:12,284 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-11-19 23:38:12,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:12,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996600041] [2019-11-19 23:38:12,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:12,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996600041] [2019-11-19 23:38:12,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332810965] [2019-11-19 23:38:12,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:12,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:38:12,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-19 23:38:12,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:12,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:12,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819103248] [2019-11-19 23:38:12,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:12,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:12,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:12,621 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-11-19 23:38:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:13,061 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-11-19 23:38:13,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:13,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-19 23:38:13,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:13,092 INFO L225 Difference]: With dead ends: 20674 [2019-11-19 23:38:13,093 INFO L226 Difference]: Without dead ends: 14708 [2019-11-19 23:38:13,106 INFO L630 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-11-19 23:38:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-11-19 23:38:13,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-11-19 23:38:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-19 23:38:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-11-19 23:38:13,640 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-11-19 23:38:13,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:13,641 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-11-19 23:38:13,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-11-19 23:38:13,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-19 23:38:13,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:13,654 INFO L410 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-11-19 23:38:13,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:13,859 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:13,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-11-19 23:38:13,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:13,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419890258] [2019-11-19 23:38:13,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 198 proven. 21 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:13,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419890258] [2019-11-19 23:38:13,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813597703] [2019-11-19 23:38:13,940 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:14,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-19 23:38:14,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:38:14,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:14,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-11-19 23:38:14,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:14,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:14,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208990171] [2019-11-19 23:38:14,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:14,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:14,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:14,072 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-11-19 23:38:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:14,798 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-11-19 23:38:14,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:14,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-19 23:38:14,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:14,826 INFO L225 Difference]: With dead ends: 30070 [2019-11-19 23:38:14,827 INFO L226 Difference]: Without dead ends: 15314 [2019-11-19 23:38:14,836 INFO L630 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-11-19 23:38:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-11-19 23:38:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-11-19 23:38:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-19 23:38:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-11-19 23:38:15,310 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-11-19 23:38:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:15,310 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-11-19 23:38:15,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-11-19 23:38:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-19 23:38:15,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:15,323 INFO L410 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-11-19 23:38:15,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:15,527 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-11-19 23:38:15,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:15,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553219770] [2019-11-19 23:38:15,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 198 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:15,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553219770] [2019-11-19 23:38:15,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179478494] [2019-11-19 23:38:15,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:15,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:38:15,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-19 23:38:15,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:38:15,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-19 23:38:15,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066099053] [2019-11-19 23:38:15,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:38:15,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:38:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:38:15,726 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-11-19 23:38:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:16,540 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-11-19 23:38:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:38:16,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-19 23:38:16,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:16,571 INFO L225 Difference]: With dead ends: 29822 [2019-11-19 23:38:16,571 INFO L226 Difference]: Without dead ends: 15186 [2019-11-19 23:38:16,578 INFO L630 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-11-19 23:38:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-11-19 23:38:17,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-11-19 23:38:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-19 23:38:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-11-19 23:38:17,057 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-11-19 23:38:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:17,058 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-11-19 23:38:17,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:38:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-11-19 23:38:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-19 23:38:17,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:17,067 INFO L410 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-11-19 23:38:17,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:17,279 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-11-19 23:38:17,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:17,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350462379] [2019-11-19 23:38:17,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:38:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 196 proven. 27 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-19 23:38:17,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350462379] [2019-11-19 23:38:17,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112749032] [2019-11-19 23:38:17,353 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/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-11-19 23:38:17,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 23:38:17,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:38:17,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 23:38:17,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:38:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-19 23:38:17,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:38:17,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-19 23:38:17,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727802992] [2019-11-19 23:38:17,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 23:38:17,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:38:17,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 23:38:17,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:38:17,521 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-11-19 23:38:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:38:19,750 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-11-19 23:38:19,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 23:38:19,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-11-19 23:38:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:38:19,787 INFO L225 Difference]: With dead ends: 50232 [2019-11-19 23:38:19,787 INFO L226 Difference]: Without dead ends: 34696 [2019-11-19 23:38:19,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:38:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-11-19 23:38:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-11-19 23:38:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-11-19 23:38:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-11-19 23:38:20,447 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-11-19 23:38:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:38:20,447 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-11-19 23:38:20,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 23:38:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-11-19 23:38:20,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-19 23:38:20,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:38:20,453 INFO L410 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-11-19 23:38:20,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:38:20,656 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:38:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:38:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-11-19 23:38:20,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:38:20,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965415228] [2019-11-19 23:38:20,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:38:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:38:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 23:38:20,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 23:38:20,830 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 23:38:20,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:38:20 BoogieIcfgContainer [2019-11-19 23:38:20,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:38:20,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:38:20,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:38:20,960 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:38:20,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:37:56" (3/4) ... [2019-11-19 23:38:20,962 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 23:38:21,140 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0daa59c2-4ac6-41c6-9c6c-a49de68fc8f4/bin/uautomizer/witness.graphml [2019-11-19 23:38:21,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:38:21,143 INFO L168 Benchmark]: Toolchain (without parser) took 26231.33 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). Peak memory consumption was 861.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:21,143 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:38:21,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:21,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:38:21,145 INFO L168 Benchmark]: Boogie Preprocessor took 36.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:21,145 INFO L168 Benchmark]: RCFGBuilder took 876.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:21,146 INFO L168 Benchmark]: TraceAbstraction took 24630.97 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 909.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.9 MB). Peak memory consumption was 801.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:21,146 INFO L168 Benchmark]: Witness Printer took 181.20 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-11-19 23:38:21,148 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 876.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24630.97 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 909.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.9 MB). Peak memory consumption was 801.8 MB. Max. memory is 11.5 GB. * Witness Printer took 181.20 ms. Allocated memory is still 2.1 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L635] int s ; [L636] int tmp ; [L640] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 = __VERIFIER_nondet_int() ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L293] COND FALSE !(ret <= 0) [L296] COND FALSE !(\read(s__hit)) [L299] s__state = 8512 [L301] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND TRUE s__state == 8512 [L306] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L307] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L308] COND TRUE __cil_tmp56 + 256UL [L309] skip = 1 [L317] s__state = 8528 [L318] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND TRUE s__state == 8528 [L322] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L323] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L325] __cil_tmp57 = (unsigned long )s__options [L326] COND TRUE __cil_tmp57 + 2097152UL [L327] s__s3__tmp__use_rsa_tmp = 1 [L332] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L359] ret = __VERIFIER_nondet_int() [L360] COND FALSE !(ret <= 0) [L377] s__state = 8544 [L378] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND TRUE s__state == 8544 [L382] COND TRUE s__verify_mode + 1 [L383] COND FALSE !(s__session__peer != 0) [L394] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L395] __cil_tmp61 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L396] COND FALSE !(__cil_tmp61 + 256UL) [L406] s__s3__tmp__cert_request = 1 [L407] ret = __VERIFIER_nondet_int() [L408] COND FALSE !(ret <= 0) [L411] s__state = 8448 [L412] s__s3__tmp__next_state___0 = 8576 [L413] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND TRUE s__state == 8448 [L434] COND FALSE !(num1 > 0L) [L443] s__state = s__s3__tmp__next_state___0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND FALSE !(state == 8576) [L619] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND TRUE s__state == 8576 [L447] ret = __VERIFIER_nondet_int() [L448] COND FALSE !(ret <= 0) [L451] COND FALSE !(ret == 2) [L454] ret = __VERIFIER_nondet_int() [L455] COND FALSE !(ret <= 0) [L458] s__init_num = 0 [L459] s__state = 8592 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L602] COND TRUE state == 8576 [L603] COND TRUE s__state == 8592 [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE tmp___2 != -16384 [L606] COND TRUE __cil_tmp56 != 4294967040 [L607] COND TRUE __cil_tmp58 != 4294967294 [L608] COND TRUE tmp___7 != 1024 [L609] COND TRUE tmp___7 != 512 [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2283 GetRequests, 2203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s 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.7s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s 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...