./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-6b5699a [2019-11-25 08:54:24,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:54:24,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:54:24,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:54:24,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:54:24,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:54:24,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:54:24,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:54:24,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:54:24,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:54:24,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:54:24,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:54:24,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:54:24,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:54:24,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:54:24,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:54:24,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:54:24,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:54:24,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:54:24,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:54:24,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:54:24,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:54:24,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:54:24,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:54:24,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:54:24,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:54:24,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:54:24,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:54:24,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:54:24,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:54:24,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:54:24,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:54:24,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:54:24,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:54:24,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:54:24,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:54:24,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:54:24,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:54:24,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:54:24,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:54:24,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:54:24,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:54:24,595 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:54:24,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:54:24,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:54:24,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:54:24,596 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:54:24,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:54:24,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:54:24,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:54:24,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:54:24,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:54:24,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:54:24,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:54:24,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:54:24,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:54:24,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:54:24,598 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:54:24,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:54:24,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:54:24,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:54:24,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:54:24,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:54:24,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:54:24,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:54:24,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:54:24,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:54:24,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:54:24,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:54:24,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:54:24,601 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_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:24,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:54:24,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:54:24,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:54:24,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:54:24,754 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:54:24,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-25 08:54:24,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/data/01e0c11ec/dcb55b68d7ea45a28fb7db2a0add353c/FLAGaece1d898 [2019-11-25 08:54:25,279 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:54:25,279 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/sv-benchmarks/c/ssh-simplified/s3_srvr_11.cil.c [2019-11-25 08:54:25,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/data/01e0c11ec/dcb55b68d7ea45a28fb7db2a0add353c/FLAGaece1d898 [2019-11-25 08:54:25,302 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/data/01e0c11ec/dcb55b68d7ea45a28fb7db2a0add353c [2019-11-25 08:54:25,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:54:25,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:54:25,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:25,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:54:25,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:54:25,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f7275f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25, skipping insertion in model container [2019-11-25 08:54:25,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:54:25,350 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:54:25,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:25,668 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:54:25,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:25,780 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:54:25,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25 WrapperNode [2019-11-25 08:54:25,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:25,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:54:25,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:54:25,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:54:25,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:54:25,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:54:25,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:54:25,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:54:25,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... [2019-11-25 08:54:25,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:54:25,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:54:25,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:54:25,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:54:25,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:54:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:54:26,168 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:54:26,793 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:54:26,794 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:54:26,795 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:54:26,795 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:54:26,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:26 BoogieIcfgContainer [2019-11-25 08:54:26,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:54:26,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:54:26,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:54:26,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:54:26,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:54:25" (1/3) ... [2019-11-25 08:54:26,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9d114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:26, skipping insertion in model container [2019-11-25 08:54:26,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:25" (2/3) ... [2019-11-25 08:54:26,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9d114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:26, skipping insertion in model container [2019-11-25 08:54:26,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:26" (3/3) ... [2019-11-25 08:54:26,803 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_11.cil.c [2019-11-25 08:54:26,811 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:54:26,817 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:54:26,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:54:26,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:54:26,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:54:26,849 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:54:26,849 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:54:26,850 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:54:26,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:54:26,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:54:26,850 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:54:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-25 08:54:26,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:54:26,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:26,875 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-25 08:54:26,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1603119947, now seen corresponding path program 1 times [2019-11-25 08:54:26,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:26,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961413493] [2019-11-25 08:54:26,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:27,059 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-25 08:54:27,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961413493] [2019-11-25 08:54:27,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:27,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:27,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856647456] [2019-11-25 08:54:27,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:27,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:27,088 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-25 08:54:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:27,376 INFO L93 Difference]: Finished difference Result 315 states and 541 transitions. [2019-11-25 08:54:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:27,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:54:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:27,390 INFO L225 Difference]: With dead ends: 315 [2019-11-25 08:54:27,390 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:54:27,393 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-25 08:54:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:54:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2019-11-25 08:54:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 08:54:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 240 transitions. [2019-11-25 08:54:27,444 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 240 transitions. Word has length 25 [2019-11-25 08:54:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:27,444 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 240 transitions. [2019-11-25 08:54:27,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 240 transitions. [2019-11-25 08:54:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:54:27,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:27,447 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-25 08:54:27,447 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1655306444, now seen corresponding path program 1 times [2019-11-25 08:54:27,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:27,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643811130] [2019-11-25 08:54:27,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:27,508 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-25 08:54:27,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643811130] [2019-11-25 08:54:27,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:27,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:27,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923892225] [2019-11-25 08:54:27,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:27,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:27,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:27,511 INFO L87 Difference]: Start difference. First operand 152 states and 240 transitions. Second operand 3 states. [2019-11-25 08:54:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:27,674 INFO L93 Difference]: Finished difference Result 318 states and 501 transitions. [2019-11-25 08:54:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:27,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:54:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:27,677 INFO L225 Difference]: With dead ends: 318 [2019-11-25 08:54:27,677 INFO L226 Difference]: Without dead ends: 173 [2019-11-25 08:54:27,679 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-25 08:54:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-25 08:54:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-11-25 08:54:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-11-25 08:54:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2019-11-25 08:54:27,708 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 26 [2019-11-25 08:54:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:27,708 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2019-11-25 08:54:27,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2019-11-25 08:54:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:54:27,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:27,710 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-25 08:54:27,710 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2083538751, now seen corresponding path program 1 times [2019-11-25 08:54:27,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:27,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50845940] [2019-11-25 08:54:27,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:27,752 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-25 08:54:27,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50845940] [2019-11-25 08:54:27,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:27,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:27,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243494745] [2019-11-25 08:54:27,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:27,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:27,755 INFO L87 Difference]: Start difference. First operand 173 states and 269 transitions. Second operand 3 states. [2019-11-25 08:54:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:27,913 INFO L93 Difference]: Finished difference Result 347 states and 541 transitions. [2019-11-25 08:54:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:27,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:54:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:27,917 INFO L225 Difference]: With dead ends: 347 [2019-11-25 08:54:27,917 INFO L226 Difference]: Without dead ends: 181 [2019-11-25 08:54:27,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-25 08:54:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-25 08:54:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-25 08:54:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-25 08:54:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 280 transitions. [2019-11-25 08:54:27,950 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 280 transitions. Word has length 26 [2019-11-25 08:54:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:27,958 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 280 transitions. [2019-11-25 08:54:27,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 280 transitions. [2019-11-25 08:54:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:54:27,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:27,960 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-25 08:54:27,961 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash -467027583, now seen corresponding path program 1 times [2019-11-25 08:54:27,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:27,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592434082] [2019-11-25 08:54:27,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,045 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-25 08:54:28,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592434082] [2019-11-25 08:54:28,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:28,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114759011] [2019-11-25 08:54:28,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:28,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,048 INFO L87 Difference]: Start difference. First operand 179 states and 280 transitions. Second operand 3 states. [2019-11-25 08:54:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:28,220 INFO L93 Difference]: Finished difference Result 352 states and 551 transitions. [2019-11-25 08:54:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:28,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:54:28,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:28,223 INFO L225 Difference]: With dead ends: 352 [2019-11-25 08:54:28,223 INFO L226 Difference]: Without dead ends: 180 [2019-11-25 08:54:28,224 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-25 08:54:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-25 08:54:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-11-25 08:54:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-25 08:54:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-11-25 08:54:28,245 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 26 [2019-11-25 08:54:28,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:28,246 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-11-25 08:54:28,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-11-25 08:54:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:54:28,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:28,255 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-25 08:54:28,255 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1902471129, now seen corresponding path program 1 times [2019-11-25 08:54:28,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:28,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840184621] [2019-11-25 08:54:28,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,322 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-25 08:54:28,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840184621] [2019-11-25 08:54:28,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:28,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639196484] [2019-11-25 08:54:28,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:28,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,324 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 3 states. [2019-11-25 08:54:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:28,483 INFO L93 Difference]: Finished difference Result 363 states and 563 transitions. [2019-11-25 08:54:28,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:28,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:54:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:28,485 INFO L225 Difference]: With dead ends: 363 [2019-11-25 08:54:28,485 INFO L226 Difference]: Without dead ends: 190 [2019-11-25 08:54:28,487 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-25 08:54:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-25 08:54:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-25 08:54:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-25 08:54:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-11-25 08:54:28,503 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 27 [2019-11-25 08:54:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:28,503 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-11-25 08:54:28,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-11-25 08:54:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:54:28,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:28,507 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-25 08:54:28,507 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1605160869, now seen corresponding path program 1 times [2019-11-25 08:54:28,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:28,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365624274] [2019-11-25 08:54:28,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,542 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-25 08:54:28,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365624274] [2019-11-25 08:54:28,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:28,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340915879] [2019-11-25 08:54:28,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:28,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,544 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 3 states. [2019-11-25 08:54:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:28,732 INFO L93 Difference]: Finished difference Result 363 states and 559 transitions. [2019-11-25 08:54:28,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:28,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:54:28,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:28,734 INFO L225 Difference]: With dead ends: 363 [2019-11-25 08:54:28,734 INFO L226 Difference]: Without dead ends: 190 [2019-11-25 08:54:28,735 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-25 08:54:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-25 08:54:28,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-25 08:54:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-25 08:54:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-11-25 08:54:28,743 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 28 [2019-11-25 08:54:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:28,743 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-11-25 08:54:28,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-11-25 08:54:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:28,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:28,745 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-25 08:54:28,745 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:28,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1051085342, now seen corresponding path program 1 times [2019-11-25 08:54:28,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:28,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579715415] [2019-11-25 08:54:28,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,769 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-25 08:54:28,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579715415] [2019-11-25 08:54:28,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:28,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552700102] [2019-11-25 08:54:28,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:28,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:28,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,771 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 3 states. [2019-11-25 08:54:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:28,904 INFO L93 Difference]: Finished difference Result 363 states and 555 transitions. [2019-11-25 08:54:28,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:28,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-25 08:54:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:28,906 INFO L225 Difference]: With dead ends: 363 [2019-11-25 08:54:28,906 INFO L226 Difference]: Without dead ends: 190 [2019-11-25 08:54:28,907 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-25 08:54:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-25 08:54:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 180. [2019-11-25 08:54:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-25 08:54:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-11-25 08:54:28,914 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 29 [2019-11-25 08:54:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:28,915 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-11-25 08:54:28,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-11-25 08:54:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:54:28,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:28,916 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-25 08:54:28,916 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:28,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1476768639, now seen corresponding path program 1 times [2019-11-25 08:54:28,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:28,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090702623] [2019-11-25 08:54:28,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,972 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-25 08:54:28,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090702623] [2019-11-25 08:54:28,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:28,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139480704] [2019-11-25 08:54:28,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:28,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:28,974 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-11-25 08:54:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:29,235 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2019-11-25 08:54:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:29,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-25 08:54:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:29,238 INFO L225 Difference]: With dead ends: 511 [2019-11-25 08:54:29,238 INFO L226 Difference]: Without dead ends: 338 [2019-11-25 08:54:29,238 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-25 08:54:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-25 08:54:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 323. [2019-11-25 08:54:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-25 08:54:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 494 transitions. [2019-11-25 08:54:29,256 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 494 transitions. Word has length 29 [2019-11-25 08:54:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:29,256 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 494 transitions. [2019-11-25 08:54:29,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 494 transitions. [2019-11-25 08:54:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-25 08:54:29,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:29,260 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-25 08:54:29,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:29,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:29,261 INFO L82 PathProgramCache]: Analyzing trace with hash -91605738, now seen corresponding path program 1 times [2019-11-25 08:54:29,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:29,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452618007] [2019-11-25 08:54:29,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:29,316 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-25 08:54:29,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452618007] [2019-11-25 08:54:29,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:29,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:29,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396724166] [2019-11-25 08:54:29,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:29,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:29,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:29,318 INFO L87 Difference]: Start difference. First operand 323 states and 494 transitions. Second operand 3 states. [2019-11-25 08:54:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:29,498 INFO L93 Difference]: Finished difference Result 698 states and 1074 transitions. [2019-11-25 08:54:29,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:29,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-25 08:54:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:29,501 INFO L225 Difference]: With dead ends: 698 [2019-11-25 08:54:29,502 INFO L226 Difference]: Without dead ends: 382 [2019-11-25 08:54:29,502 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-25 08:54:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-25 08:54:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2019-11-25 08:54:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-25 08:54:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 581 transitions. [2019-11-25 08:54:29,518 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 581 transitions. Word has length 43 [2019-11-25 08:54:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:29,518 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 581 transitions. [2019-11-25 08:54:29,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 581 transitions. [2019-11-25 08:54:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 08:54:29,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:29,519 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-25 08:54:29,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:29,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033309, now seen corresponding path program 1 times [2019-11-25 08:54:29,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:29,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746295929] [2019-11-25 08:54:29,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:29,545 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-25 08:54:29,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746295929] [2019-11-25 08:54:29,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:29,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:29,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221915717] [2019-11-25 08:54:29,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:29,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:29,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:29,547 INFO L87 Difference]: Start difference. First operand 374 states and 581 transitions. Second operand 3 states. [2019-11-25 08:54:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:29,721 INFO L93 Difference]: Finished difference Result 775 states and 1210 transitions. [2019-11-25 08:54:29,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:29,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-25 08:54:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:29,724 INFO L225 Difference]: With dead ends: 775 [2019-11-25 08:54:29,724 INFO L226 Difference]: Without dead ends: 406 [2019-11-25 08:54:29,725 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-25 08:54:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-25 08:54:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 398. [2019-11-25 08:54:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-25 08:54:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 627 transitions. [2019-11-25 08:54:29,741 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 627 transitions. Word has length 44 [2019-11-25 08:54:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:29,742 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 627 transitions. [2019-11-25 08:54:29,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 627 transitions. [2019-11-25 08:54:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-25 08:54:29,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:29,743 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-25 08:54:29,743 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash 501139110, now seen corresponding path program 1 times [2019-11-25 08:54:29,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:29,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782719016] [2019-11-25 08:54:29,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:29,768 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-25 08:54:29,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782719016] [2019-11-25 08:54:29,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:29,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:29,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25624644] [2019-11-25 08:54:29,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:29,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:29,770 INFO L87 Difference]: Start difference. First operand 398 states and 627 transitions. Second operand 3 states. [2019-11-25 08:54:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:29,952 INFO L93 Difference]: Finished difference Result 829 states and 1310 transitions. [2019-11-25 08:54:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:29,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-25 08:54:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:29,956 INFO L225 Difference]: With dead ends: 829 [2019-11-25 08:54:29,957 INFO L226 Difference]: Without dead ends: 438 [2019-11-25 08:54:29,957 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-25 08:54:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-25 08:54:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-11-25 08:54:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-25 08:54:29,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 692 transitions. [2019-11-25 08:54:29,974 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 692 transitions. Word has length 54 [2019-11-25 08:54:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:29,975 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 692 transitions. [2019-11-25 08:54:29,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 692 transitions. [2019-11-25 08:54:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:54:29,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:29,978 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-25 08:54:29,978 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:29,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1234673389, now seen corresponding path program 1 times [2019-11-25 08:54:29,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:29,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360456844] [2019-11-25 08:54:29,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:30,034 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-25 08:54:30,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360456844] [2019-11-25 08:54:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286501346] [2019-11-25 08:54:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:30,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:30,036 INFO L87 Difference]: Start difference. First operand 438 states and 692 transitions. Second operand 3 states. [2019-11-25 08:54:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:30,199 INFO L93 Difference]: Finished difference Result 911 states and 1440 transitions. [2019-11-25 08:54:30,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:30,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-25 08:54:30,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:30,203 INFO L225 Difference]: With dead ends: 911 [2019-11-25 08:54:30,203 INFO L226 Difference]: Without dead ends: 480 [2019-11-25 08:54:30,204 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-25 08:54:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-25 08:54:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-25 08:54:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-25 08:54:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 752 transitions. [2019-11-25 08:54:30,222 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 752 transitions. Word has length 81 [2019-11-25 08:54:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:30,223 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 752 transitions. [2019-11-25 08:54:30,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 752 transitions. [2019-11-25 08:54:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-25 08:54:30,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:30,224 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-25 08:54:30,224 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash -337353345, now seen corresponding path program 1 times [2019-11-25 08:54:30,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:30,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767092887] [2019-11-25 08:54:30,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:30,254 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-25 08:54:30,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767092887] [2019-11-25 08:54:30,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:30,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:30,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462764011] [2019-11-25 08:54:30,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:30,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:30,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:30,256 INFO L87 Difference]: Start difference. First operand 476 states and 752 transitions. Second operand 3 states. [2019-11-25 08:54:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:30,416 INFO L93 Difference]: Finished difference Result 949 states and 1497 transitions. [2019-11-25 08:54:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:30,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-25 08:54:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:30,419 INFO L225 Difference]: With dead ends: 949 [2019-11-25 08:54:30,419 INFO L226 Difference]: Without dead ends: 480 [2019-11-25 08:54:30,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-25 08:54:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-11-25 08:54:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2019-11-25 08:54:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-25 08:54:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 749 transitions. [2019-11-25 08:54:30,438 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 749 transitions. Word has length 82 [2019-11-25 08:54:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:30,438 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 749 transitions. [2019-11-25 08:54:30,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 749 transitions. [2019-11-25 08:54:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:54:30,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:30,440 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-25 08:54:30,440 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1112997795, now seen corresponding path program 1 times [2019-11-25 08:54:30,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:30,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646217859] [2019-11-25 08:54:30,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:30,470 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-25 08:54:30,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646217859] [2019-11-25 08:54:30,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:30,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:30,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961189164] [2019-11-25 08:54:30,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:30,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:30,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:30,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:30,472 INFO L87 Difference]: Start difference. First operand 476 states and 749 transitions. Second operand 3 states. [2019-11-25 08:54:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:30,643 INFO L93 Difference]: Finished difference Result 997 states and 1572 transitions. [2019-11-25 08:54:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:30,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:54:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:30,646 INFO L225 Difference]: With dead ends: 997 [2019-11-25 08:54:30,647 INFO L226 Difference]: Without dead ends: 528 [2019-11-25 08:54:30,647 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-25 08:54:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-25 08:54:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-25 08:54:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-25 08:54:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 804 transitions. [2019-11-25 08:54:30,670 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 804 transitions. Word has length 83 [2019-11-25 08:54:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:30,671 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 804 transitions. [2019-11-25 08:54:30,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 804 transitions. [2019-11-25 08:54:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:54:30,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:30,673 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-25 08:54:30,673 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1939998609, now seen corresponding path program 1 times [2019-11-25 08:54:30,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:30,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422744659] [2019-11-25 08:54:30,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:30,708 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-25 08:54:30,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422744659] [2019-11-25 08:54:30,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:30,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:30,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257735174] [2019-11-25 08:54:30,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:30,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:30,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:30,710 INFO L87 Difference]: Start difference. First operand 512 states and 804 transitions. Second operand 3 states. [2019-11-25 08:54:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:30,869 INFO L93 Difference]: Finished difference Result 1033 states and 1623 transitions. [2019-11-25 08:54:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:30,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:54:30,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:30,873 INFO L225 Difference]: With dead ends: 1033 [2019-11-25 08:54:30,873 INFO L226 Difference]: Without dead ends: 528 [2019-11-25 08:54:30,874 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-25 08:54:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-25 08:54:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 512. [2019-11-25 08:54:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-25 08:54:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 800 transitions. [2019-11-25 08:54:30,896 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 800 transitions. Word has length 84 [2019-11-25 08:54:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:30,896 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 800 transitions. [2019-11-25 08:54:30,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 800 transitions. [2019-11-25 08:54:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:54:30,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:30,898 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-25 08:54:30,898 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1409112293, now seen corresponding path program 1 times [2019-11-25 08:54:30,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:30,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546537886] [2019-11-25 08:54:30,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:30,955 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-25 08:54:30,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546537886] [2019-11-25 08:54:30,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:30,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:30,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430029952] [2019-11-25 08:54:30,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:30,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:30,959 INFO L87 Difference]: Start difference. First operand 512 states and 800 transitions. Second operand 3 states. [2019-11-25 08:54:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:31,125 INFO L93 Difference]: Finished difference Result 1078 states and 1682 transitions. [2019-11-25 08:54:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:31,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:54:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:31,129 INFO L225 Difference]: With dead ends: 1078 [2019-11-25 08:54:31,129 INFO L226 Difference]: Without dead ends: 573 [2019-11-25 08:54:31,130 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-25 08:54:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-25 08:54:31,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 565. [2019-11-25 08:54:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-11-25 08:54:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 881 transitions. [2019-11-25 08:54:31,153 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 881 transitions. Word has length 84 [2019-11-25 08:54:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:31,153 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 881 transitions. [2019-11-25 08:54:31,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 881 transitions. [2019-11-25 08:54:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 08:54:31,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:31,155 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-25 08:54:31,155 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1919478498, now seen corresponding path program 1 times [2019-11-25 08:54:31,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:31,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007838519] [2019-11-25 08:54:31,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:31,187 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-25 08:54:31,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007838519] [2019-11-25 08:54:31,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:31,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:31,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711798060] [2019-11-25 08:54:31,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:31,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:31,189 INFO L87 Difference]: Start difference. First operand 565 states and 881 transitions. Second operand 3 states. [2019-11-25 08:54:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:31,404 INFO L93 Difference]: Finished difference Result 1131 states and 1761 transitions. [2019-11-25 08:54:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:31,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-25 08:54:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:31,408 INFO L225 Difference]: With dead ends: 1131 [2019-11-25 08:54:31,408 INFO L226 Difference]: Without dead ends: 571 [2019-11-25 08:54:31,411 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-25 08:54:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-25 08:54:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 563. [2019-11-25 08:54:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-11-25 08:54:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 876 transitions. [2019-11-25 08:54:31,434 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 876 transitions. Word has length 85 [2019-11-25 08:54:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:31,435 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 876 transitions. [2019-11-25 08:54:31,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 876 transitions. [2019-11-25 08:54:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:54:31,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:31,439 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-25 08:54:31,439 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:31,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:31,439 INFO L82 PathProgramCache]: Analyzing trace with hash -818800783, now seen corresponding path program 1 times [2019-11-25 08:54:31,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:31,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992767111] [2019-11-25 08:54:31,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:31,466 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-25 08:54:31,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992767111] [2019-11-25 08:54:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:31,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135778888] [2019-11-25 08:54:31,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:31,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:31,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:31,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:31,468 INFO L87 Difference]: Start difference. First operand 563 states and 876 transitions. Second operand 3 states. [2019-11-25 08:54:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:31,624 INFO L93 Difference]: Finished difference Result 1159 states and 1804 transitions. [2019-11-25 08:54:31,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:31,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:54:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:31,629 INFO L225 Difference]: With dead ends: 1159 [2019-11-25 08:54:31,629 INFO L226 Difference]: Without dead ends: 603 [2019-11-25 08:54:31,630 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-25 08:54:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-25 08:54:31,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-25 08:54:31,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-25 08:54:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 917 transitions. [2019-11-25 08:54:31,654 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 917 transitions. Word has length 106 [2019-11-25 08:54:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:31,654 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 917 transitions. [2019-11-25 08:54:31,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 917 transitions. [2019-11-25 08:54:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-25 08:54:31,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:31,657 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-25 08:54:31,657 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:31,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1053492997, now seen corresponding path program 1 times [2019-11-25 08:54:31,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:31,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249923566] [2019-11-25 08:54:31,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:31,685 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-25 08:54:31,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249923566] [2019-11-25 08:54:31,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:31,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:31,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816124747] [2019-11-25 08:54:31,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:31,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:31,687 INFO L87 Difference]: Start difference. First operand 593 states and 917 transitions. Second operand 3 states. [2019-11-25 08:54:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:31,834 INFO L93 Difference]: Finished difference Result 1189 states and 1839 transitions. [2019-11-25 08:54:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:31,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-25 08:54:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:31,838 INFO L225 Difference]: With dead ends: 1189 [2019-11-25 08:54:31,838 INFO L226 Difference]: Without dead ends: 603 [2019-11-25 08:54:31,839 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-25 08:54:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-25 08:54:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2019-11-25 08:54:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-25 08:54:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 911 transitions. [2019-11-25 08:54:31,862 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 911 transitions. Word has length 107 [2019-11-25 08:54:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:31,863 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 911 transitions. [2019-11-25 08:54:31,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 911 transitions. [2019-11-25 08:54:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-25 08:54:31,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:31,865 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-25 08:54:31,865 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:31,865 INFO L82 PathProgramCache]: Analyzing trace with hash 532417498, now seen corresponding path program 1 times [2019-11-25 08:54:31,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:31,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988254180] [2019-11-25 08:54:31,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:31,893 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-25 08:54:31,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988254180] [2019-11-25 08:54:31,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:31,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:31,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683576051] [2019-11-25 08:54:31,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:31,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:31,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:31,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:31,895 INFO L87 Difference]: Start difference. First operand 593 states and 911 transitions. Second operand 3 states. [2019-11-25 08:54:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:32,034 INFO L93 Difference]: Finished difference Result 1239 states and 1906 transitions. [2019-11-25 08:54:32,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:32,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-25 08:54:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:32,038 INFO L225 Difference]: With dead ends: 1239 [2019-11-25 08:54:32,038 INFO L226 Difference]: Without dead ends: 653 [2019-11-25 08:54:32,039 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-25 08:54:32,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-25 08:54:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-25 08:54:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-25 08:54:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 958 transitions. [2019-11-25 08:54:32,064 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 958 transitions. Word has length 110 [2019-11-25 08:54:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:32,065 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 958 transitions. [2019-11-25 08:54:32,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 958 transitions. [2019-11-25 08:54:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-25 08:54:32,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:32,067 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-25 08:54:32,067 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1562226642, now seen corresponding path program 1 times [2019-11-25 08:54:32,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:32,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345455884] [2019-11-25 08:54:32,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:32,097 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-25 08:54:32,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345455884] [2019-11-25 08:54:32,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:32,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:32,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179730143] [2019-11-25 08:54:32,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:32,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:32,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:32,099 INFO L87 Difference]: Start difference. First operand 627 states and 958 transitions. Second operand 3 states. [2019-11-25 08:54:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:32,241 INFO L93 Difference]: Finished difference Result 1273 states and 1947 transitions. [2019-11-25 08:54:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:32,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-25 08:54:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:32,245 INFO L225 Difference]: With dead ends: 1273 [2019-11-25 08:54:32,245 INFO L226 Difference]: Without dead ends: 653 [2019-11-25 08:54:32,246 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-25 08:54:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-25 08:54:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 627. [2019-11-25 08:54:32,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-25 08:54:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 952 transitions. [2019-11-25 08:54:32,272 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 952 transitions. Word has length 111 [2019-11-25 08:54:32,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:32,272 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 952 transitions. [2019-11-25 08:54:32,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:32,272 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 952 transitions. [2019-11-25 08:54:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 08:54:32,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:32,274 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-25 08:54:32,275 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:32,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2031768980, now seen corresponding path program 1 times [2019-11-25 08:54:32,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:32,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668167758] [2019-11-25 08:54:32,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:32,308 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-25 08:54:32,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668167758] [2019-11-25 08:54:32,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:32,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:32,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922156068] [2019-11-25 08:54:32,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:32,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:32,310 INFO L87 Difference]: Start difference. First operand 627 states and 952 transitions. Second operand 3 states. [2019-11-25 08:54:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:32,506 INFO L93 Difference]: Finished difference Result 1300 states and 1972 transitions. [2019-11-25 08:54:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:32,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-25 08:54:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:32,511 INFO L225 Difference]: With dead ends: 1300 [2019-11-25 08:54:32,511 INFO L226 Difference]: Without dead ends: 680 [2019-11-25 08:54:32,512 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-25 08:54:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-11-25 08:54:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-11-25 08:54:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-25 08:54:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1020 transitions. [2019-11-25 08:54:32,542 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1020 transitions. Word has length 122 [2019-11-25 08:54:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:32,543 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1020 transitions. [2019-11-25 08:54:32,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1020 transitions. [2019-11-25 08:54:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:54:32,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:32,545 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-25 08:54:32,545 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1706022811, now seen corresponding path program 1 times [2019-11-25 08:54:32,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:32,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770327410] [2019-11-25 08:54:32,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:32,608 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-25 08:54:32,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770327410] [2019-11-25 08:54:32,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:32,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:32,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681340006] [2019-11-25 08:54:32,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:32,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:32,614 INFO L87 Difference]: Start difference. First operand 674 states and 1020 transitions. Second operand 3 states. [2019-11-25 08:54:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:32,671 INFO L93 Difference]: Finished difference Result 1343 states and 2030 transitions. [2019-11-25 08:54:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:32,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-25 08:54:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:32,679 INFO L225 Difference]: With dead ends: 1343 [2019-11-25 08:54:32,679 INFO L226 Difference]: Without dead ends: 1341 [2019-11-25 08:54:32,680 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-25 08:54:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-11-25 08:54:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1339. [2019-11-25 08:54:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1339 states. [2019-11-25 08:54:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 2026 transitions. [2019-11-25 08:54:32,733 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 2026 transitions. Word has length 123 [2019-11-25 08:54:32,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:32,733 INFO L462 AbstractCegarLoop]: Abstraction has 1339 states and 2026 transitions. [2019-11-25 08:54:32,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 2026 transitions. [2019-11-25 08:54:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-25 08:54:32,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:32,736 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-25 08:54:32,736 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 601196500, now seen corresponding path program 1 times [2019-11-25 08:54:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:32,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323613946] [2019-11-25 08:54:32,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:32,769 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-25 08:54:32,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323613946] [2019-11-25 08:54:32,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:32,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:32,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584376683] [2019-11-25 08:54:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:32,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:32,771 INFO L87 Difference]: Start difference. First operand 1339 states and 2026 transitions. Second operand 3 states. [2019-11-25 08:54:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:32,857 INFO L93 Difference]: Finished difference Result 3328 states and 5034 transitions. [2019-11-25 08:54:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:32,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-25 08:54:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:32,869 INFO L225 Difference]: With dead ends: 3328 [2019-11-25 08:54:32,869 INFO L226 Difference]: Without dead ends: 1996 [2019-11-25 08:54:32,872 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-25 08:54:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2019-11-25 08:54:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2019-11-25 08:54:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2019-11-25 08:54:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3012 transitions. [2019-11-25 08:54:32,952 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3012 transitions. Word has length 124 [2019-11-25 08:54:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:32,952 INFO L462 AbstractCegarLoop]: Abstraction has 1994 states and 3012 transitions. [2019-11-25 08:54:32,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3012 transitions. [2019-11-25 08:54:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-25 08:54:32,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:32,956 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-25 08:54:32,956 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1540663978, now seen corresponding path program 1 times [2019-11-25 08:54:32,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:32,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232392776] [2019-11-25 08:54:32,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:32,991 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-25 08:54:32,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232392776] [2019-11-25 08:54:32,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:32,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:32,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853636582] [2019-11-25 08:54:32,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:32,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:32,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:32,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:32,993 INFO L87 Difference]: Start difference. First operand 1994 states and 3012 transitions. Second operand 3 states. [2019-11-25 08:54:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:33,100 INFO L93 Difference]: Finished difference Result 4616 states and 6971 transitions. [2019-11-25 08:54:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:33,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-25 08:54:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:33,115 INFO L225 Difference]: With dead ends: 4616 [2019-11-25 08:54:33,115 INFO L226 Difference]: Without dead ends: 2629 [2019-11-25 08:54:33,118 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-25 08:54:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2019-11-25 08:54:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2019-11-25 08:54:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2627 states. [2019-11-25 08:54:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3961 transitions. [2019-11-25 08:54:33,221 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3961 transitions. Word has length 124 [2019-11-25 08:54:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:33,222 INFO L462 AbstractCegarLoop]: Abstraction has 2627 states and 3961 transitions. [2019-11-25 08:54:33,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3961 transitions. [2019-11-25 08:54:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-25 08:54:33,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:33,226 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-25 08:54:33,227 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:33,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:33,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1091794830, now seen corresponding path program 1 times [2019-11-25 08:54:33,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:33,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885040945] [2019-11-25 08:54:33,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:33,281 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-25 08:54:33,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885040945] [2019-11-25 08:54:33,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:33,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:33,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686368322] [2019-11-25 08:54:33,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:33,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:33,284 INFO L87 Difference]: Start difference. First operand 2627 states and 3961 transitions. Second operand 3 states. [2019-11-25 08:54:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:33,560 INFO L93 Difference]: Finished difference Result 5375 states and 8098 transitions. [2019-11-25 08:54:33,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:33,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-25 08:54:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:33,574 INFO L225 Difference]: With dead ends: 5375 [2019-11-25 08:54:33,575 INFO L226 Difference]: Without dead ends: 2755 [2019-11-25 08:54:33,578 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-25 08:54:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-25 08:54:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-25 08:54:33,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-25 08:54:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4076 transitions. [2019-11-25 08:54:33,690 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4076 transitions. Word has length 132 [2019-11-25 08:54:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:33,690 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4076 transitions. [2019-11-25 08:54:33,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4076 transitions. [2019-11-25 08:54:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-25 08:54:33,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:33,695 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-25 08:54:33,695 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:33,696 INFO L82 PathProgramCache]: Analyzing trace with hash -106917274, now seen corresponding path program 1 times [2019-11-25 08:54:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:33,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981763589] [2019-11-25 08:54:33,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:33,729 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-25 08:54:33,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981763589] [2019-11-25 08:54:33,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:33,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:33,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306866880] [2019-11-25 08:54:33,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:33,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:33,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:33,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:33,733 INFO L87 Difference]: Start difference. First operand 2723 states and 4076 transitions. Second operand 3 states. [2019-11-25 08:54:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:33,975 INFO L93 Difference]: Finished difference Result 5471 states and 8181 transitions. [2019-11-25 08:54:33,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:33,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-25 08:54:33,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:33,990 INFO L225 Difference]: With dead ends: 5471 [2019-11-25 08:54:33,991 INFO L226 Difference]: Without dead ends: 2755 [2019-11-25 08:54:33,994 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-25 08:54:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-25 08:54:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2723. [2019-11-25 08:54:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-25 08:54:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 4044 transitions. [2019-11-25 08:54:34,103 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 4044 transitions. Word has length 133 [2019-11-25 08:54:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:34,104 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 4044 transitions. [2019-11-25 08:54:34,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:34,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 4044 transitions. [2019-11-25 08:54:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-25 08:54:34,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:34,108 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-25 08:54:34,108 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2091342634, now seen corresponding path program 1 times [2019-11-25 08:54:34,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:34,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451232485] [2019-11-25 08:54:34,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:34,156 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-25 08:54:34,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451232485] [2019-11-25 08:54:34,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:34,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:34,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082348851] [2019-11-25 08:54:34,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:34,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:34,158 INFO L87 Difference]: Start difference. First operand 2723 states and 4044 transitions. Second operand 3 states. [2019-11-25 08:54:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:34,423 INFO L93 Difference]: Finished difference Result 5521 states and 8174 transitions. [2019-11-25 08:54:34,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:34,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-25 08:54:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:34,438 INFO L225 Difference]: With dead ends: 5521 [2019-11-25 08:54:34,439 INFO L226 Difference]: Without dead ends: 2805 [2019-11-25 08:54:34,442 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-25 08:54:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2019-11-25 08:54:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2723. [2019-11-25 08:54:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2723 states. [2019-11-25 08:54:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3956 transitions. [2019-11-25 08:54:34,559 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3956 transitions. Word has length 163 [2019-11-25 08:54:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:34,560 INFO L462 AbstractCegarLoop]: Abstraction has 2723 states and 3956 transitions. [2019-11-25 08:54:34,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3956 transitions. [2019-11-25 08:54:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-25 08:54:34,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:34,565 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-25 08:54:34,565 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1144304748, now seen corresponding path program 1 times [2019-11-25 08:54:34,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:34,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192230497] [2019-11-25 08:54:34,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:34,650 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-25 08:54:34,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192230497] [2019-11-25 08:54:34,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:34,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:34,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702081723] [2019-11-25 08:54:34,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:34,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:34,652 INFO L87 Difference]: Start difference. First operand 2723 states and 3956 transitions. Second operand 3 states. [2019-11-25 08:54:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:34,936 INFO L93 Difference]: Finished difference Result 5711 states and 8273 transitions. [2019-11-25 08:54:34,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:34,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-25 08:54:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:34,958 INFO L225 Difference]: With dead ends: 5711 [2019-11-25 08:54:34,965 INFO L226 Difference]: Without dead ends: 2995 [2019-11-25 08:54:34,968 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-25 08:54:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-11-25 08:54:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2839. [2019-11-25 08:54:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-11-25 08:54:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 4044 transitions. [2019-11-25 08:54:35,080 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 4044 transitions. Word has length 163 [2019-11-25 08:54:35,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:35,081 INFO L462 AbstractCegarLoop]: Abstraction has 2839 states and 4044 transitions. [2019-11-25 08:54:35,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 4044 transitions. [2019-11-25 08:54:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-25 08:54:35,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:35,086 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-25 08:54:35,086 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:35,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1925800112, now seen corresponding path program 1 times [2019-11-25 08:54:35,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:35,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198294070] [2019-11-25 08:54:35,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:35,156 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-25 08:54:35,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198294070] [2019-11-25 08:54:35,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689227977] [2019-11-25 08:54:35,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:35,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:35,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:35,355 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-25 08:54:35,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:35,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:35,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377181126] [2019-11-25 08:54:35,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:35,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:35,357 INFO L87 Difference]: Start difference. First operand 2839 states and 4044 transitions. Second operand 3 states. [2019-11-25 08:54:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:35,559 INFO L93 Difference]: Finished difference Result 8484 states and 12071 transitions. [2019-11-25 08:54:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:35,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-11-25 08:54:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:35,573 INFO L225 Difference]: With dead ends: 8484 [2019-11-25 08:54:35,573 INFO L226 Difference]: Without dead ends: 5652 [2019-11-25 08:54:35,579 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-25 08:54:35,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5652 states. [2019-11-25 08:54:35,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5652 to 5650. [2019-11-25 08:54:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5650 states. [2019-11-25 08:54:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 8033 transitions. [2019-11-25 08:54:35,841 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 8033 transitions. Word has length 171 [2019-11-25 08:54:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:35,842 INFO L462 AbstractCegarLoop]: Abstraction has 5650 states and 8033 transitions. [2019-11-25 08:54:35,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 8033 transitions. [2019-11-25 08:54:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-25 08:54:35,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:35,894 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-25 08:54:36,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:36,095 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1741886925, now seen corresponding path program 1 times [2019-11-25 08:54:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:36,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119312192] [2019-11-25 08:54:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:36,181 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-25 08:54:36,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119312192] [2019-11-25 08:54:36,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224464496] [2019-11-25 08:54:36,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:36,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:36,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:36,337 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-25 08:54:36,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:36,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:36,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975091182] [2019-11-25 08:54:36,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:36,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:36,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:36,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:36,339 INFO L87 Difference]: Start difference. First operand 5650 states and 8033 transitions. Second operand 3 states. [2019-11-25 08:54:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:36,731 INFO L93 Difference]: Finished difference Result 11836 states and 16798 transitions. [2019-11-25 08:54:36,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:36,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-25 08:54:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:36,744 INFO L225 Difference]: With dead ends: 11836 [2019-11-25 08:54:36,744 INFO L226 Difference]: Without dead ends: 5994 [2019-11-25 08:54:36,751 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-25 08:54:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-11-25 08:54:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5834. [2019-11-25 08:54:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5834 states. [2019-11-25 08:54:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 8265 transitions. [2019-11-25 08:54:36,984 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 8265 transitions. Word has length 172 [2019-11-25 08:54:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:36,985 INFO L462 AbstractCegarLoop]: Abstraction has 5834 states and 8265 transitions. [2019-11-25 08:54:36,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 8265 transitions. [2019-11-25 08:54:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-25 08:54:36,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:36,994 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-25 08:54:37,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:37,199 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1648497422, now seen corresponding path program 1 times [2019-11-25 08:54:37,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:37,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358387085] [2019-11-25 08:54:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:37,267 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-25 08:54:37,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358387085] [2019-11-25 08:54:37,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608532698] [2019-11-25 08:54:37,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:37,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:37,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:37,412 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-25 08:54:37,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:37,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:37,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008065902] [2019-11-25 08:54:37,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:37,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:37,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:37,415 INFO L87 Difference]: Start difference. First operand 5834 states and 8265 transitions. Second operand 3 states. [2019-11-25 08:54:37,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:37,828 INFO L93 Difference]: Finished difference Result 10593 states and 14957 transitions. [2019-11-25 08:54:37,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:37,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-25 08:54:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:37,839 INFO L225 Difference]: With dead ends: 10593 [2019-11-25 08:54:37,839 INFO L226 Difference]: Without dead ends: 4615 [2019-11-25 08:54:37,848 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-25 08:54:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2019-11-25 08:54:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4471. [2019-11-25 08:54:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-25 08:54:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6324 transitions. [2019-11-25 08:54:38,028 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6324 transitions. Word has length 173 [2019-11-25 08:54:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:38,028 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6324 transitions. [2019-11-25 08:54:38,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6324 transitions. [2019-11-25 08:54:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-25 08:54:38,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:38,037 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-25 08:54:38,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:38,248 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash 492657149, now seen corresponding path program 1 times [2019-11-25 08:54:38,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:38,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112321170] [2019-11-25 08:54:38,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:38,330 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-25 08:54:38,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112321170] [2019-11-25 08:54:38,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661740225] [2019-11-25 08:54:38,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:38,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:38,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:38,474 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-25 08:54:38,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:38,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-25 08:54:38,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107880344] [2019-11-25 08:54:38,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:38,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:38,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:38,476 INFO L87 Difference]: Start difference. First operand 4471 states and 6324 transitions. Second operand 3 states. [2019-11-25 08:54:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:38,677 INFO L93 Difference]: Finished difference Result 8870 states and 12551 transitions. [2019-11-25 08:54:38,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:38,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-25 08:54:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:38,687 INFO L225 Difference]: With dead ends: 8870 [2019-11-25 08:54:38,687 INFO L226 Difference]: Without dead ends: 4473 [2019-11-25 08:54:38,693 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-25 08:54:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2019-11-25 08:54:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 4471. [2019-11-25 08:54:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4471 states. [2019-11-25 08:54:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6308 transitions. [2019-11-25 08:54:38,871 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6308 transitions. Word has length 176 [2019-11-25 08:54:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:38,872 INFO L462 AbstractCegarLoop]: Abstraction has 4471 states and 6308 transitions. [2019-11-25 08:54:38,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6308 transitions. [2019-11-25 08:54:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-25 08:54:38,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:38,880 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-25 08:54:39,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:39,084 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash 750822587, now seen corresponding path program 1 times [2019-11-25 08:54:39,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:39,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519779596] [2019-11-25 08:54:39,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:39,182 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-25 08:54:39,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519779596] [2019-11-25 08:54:39,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867154792] [2019-11-25 08:54:39,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:39,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:39,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:39,398 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-25 08:54:39,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:39,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-25 08:54:39,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479649161] [2019-11-25 08:54:39,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:39,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:39,400 INFO L87 Difference]: Start difference. First operand 4471 states and 6308 transitions. Second operand 3 states. [2019-11-25 08:54:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:39,661 INFO L93 Difference]: Finished difference Result 7803 states and 10977 transitions. [2019-11-25 08:54:39,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:39,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-11-25 08:54:39,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:39,669 INFO L225 Difference]: With dead ends: 7803 [2019-11-25 08:54:39,669 INFO L226 Difference]: Without dead ends: 3298 [2019-11-25 08:54:39,675 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-25 08:54:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-11-25 08:54:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3178. [2019-11-25 08:54:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-25 08:54:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4467 transitions. [2019-11-25 08:54:39,793 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4467 transitions. Word has length 176 [2019-11-25 08:54:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:39,794 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4467 transitions. [2019-11-25 08:54:39,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:39,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4467 transitions. [2019-11-25 08:54:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-25 08:54:39,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:39,801 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-25 08:54:40,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:40,005 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:40,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash 290208357, now seen corresponding path program 2 times [2019-11-25 08:54:40,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:40,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128471063] [2019-11-25 08:54:40,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:40,097 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-25 08:54:40,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128471063] [2019-11-25 08:54:40,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279050724] [2019-11-25 08:54:40,098 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:40,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 08:54:40,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:40,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:40,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:40,203 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-25 08:54:40,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:40,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:40,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467228045] [2019-11-25 08:54:40,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:40,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:40,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:40,205 INFO L87 Difference]: Start difference. First operand 3178 states and 4467 transitions. Second operand 3 states. [2019-11-25 08:54:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:40,449 INFO L93 Difference]: Finished difference Result 6414 states and 9030 transitions. [2019-11-25 08:54:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:40,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-11-25 08:54:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:40,457 INFO L225 Difference]: With dead ends: 6414 [2019-11-25 08:54:40,457 INFO L226 Difference]: Without dead ends: 3362 [2019-11-25 08:54:40,461 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-25 08:54:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2019-11-25 08:54:40,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3178. [2019-11-25 08:54:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3178 states. [2019-11-25 08:54:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3178 states to 3178 states and 4451 transitions. [2019-11-25 08:54:40,577 INFO L78 Accepts]: Start accepts. Automaton has 3178 states and 4451 transitions. Word has length 181 [2019-11-25 08:54:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:40,578 INFO L462 AbstractCegarLoop]: Abstraction has 3178 states and 4451 transitions. [2019-11-25 08:54:40,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3178 states and 4451 transitions. [2019-11-25 08:54:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-25 08:54:40,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:40,584 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-25 08:54:40,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:40,788 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1359170395, now seen corresponding path program 1 times [2019-11-25 08:54:40,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:40,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416992024] [2019-11-25 08:54:40,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:40,855 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-25 08:54:40,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416992024] [2019-11-25 08:54:40,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312900990] [2019-11-25 08:54:40,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:40,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:40,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:40,993 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-25 08:54:40,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:40,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:40,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601544249] [2019-11-25 08:54:40,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:40,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:40,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:40,995 INFO L87 Difference]: Start difference. First operand 3178 states and 4451 transitions. Second operand 3 states. [2019-11-25 08:54:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:41,204 INFO L93 Difference]: Finished difference Result 9098 states and 12761 transitions. [2019-11-25 08:54:41,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:41,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-11-25 08:54:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:41,215 INFO L225 Difference]: With dead ends: 9098 [2019-11-25 08:54:41,215 INFO L226 Difference]: Without dead ends: 6110 [2019-11-25 08:54:41,220 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-25 08:54:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6110 states. [2019-11-25 08:54:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6110 to 6108. [2019-11-25 08:54:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-11-25 08:54:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8553 transitions. [2019-11-25 08:54:41,430 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8553 transitions. Word has length 183 [2019-11-25 08:54:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:41,430 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 8553 transitions. [2019-11-25 08:54:41,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8553 transitions. [2019-11-25 08:54:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-25 08:54:41,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:41,439 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-25 08:54:41,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:41,644 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:41,645 INFO L82 PathProgramCache]: Analyzing trace with hash -580968611, now seen corresponding path program 1 times [2019-11-25 08:54:41,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:41,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797411434] [2019-11-25 08:54:41,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:41,710 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-25 08:54:41,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797411434] [2019-11-25 08:54:41,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143582616] [2019-11-25 08:54:41,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:41,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:41,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:41,842 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-25 08:54:41,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:41,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:41,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717545425] [2019-11-25 08:54:41,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:41,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:41,844 INFO L87 Difference]: Start difference. First operand 6108 states and 8553 transitions. Second operand 3 states. [2019-11-25 08:54:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:42,079 INFO L93 Difference]: Finished difference Result 12076 states and 16919 transitions. [2019-11-25 08:54:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:42,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-25 08:54:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:42,095 INFO L225 Difference]: With dead ends: 12076 [2019-11-25 08:54:42,095 INFO L226 Difference]: Without dead ends: 9088 [2019-11-25 08:54:42,100 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-25 08:54:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2019-11-25 08:54:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 9086. [2019-11-25 08:54:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9086 states. [2019-11-25 08:54:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 12719 transitions. [2019-11-25 08:54:42,414 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 12719 transitions. Word has length 185 [2019-11-25 08:54:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:42,415 INFO L462 AbstractCegarLoop]: Abstraction has 9086 states and 12719 transitions. [2019-11-25 08:54:42,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 12719 transitions. [2019-11-25 08:54:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-25 08:54:42,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:42,425 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-25 08:54:42,629 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:42,630 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:42,630 INFO L82 PathProgramCache]: Analyzing trace with hash -607881575, now seen corresponding path program 1 times [2019-11-25 08:54:42,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:42,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890884393] [2019-11-25 08:54:42,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:42,715 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-25 08:54:42,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890884393] [2019-11-25 08:54:42,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105992699] [2019-11-25 08:54:42,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:42,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:54:42,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:42,943 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-25 08:54:42,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:42,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:42,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592638693] [2019-11-25 08:54:42,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:42,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:42,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:42,946 INFO L87 Difference]: Start difference. First operand 9086 states and 12719 transitions. Second operand 3 states. [2019-11-25 08:54:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:43,343 INFO L93 Difference]: Finished difference Result 20674 states and 28969 transitions. [2019-11-25 08:54:43,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:43,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-25 08:54:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:43,369 INFO L225 Difference]: With dead ends: 20674 [2019-11-25 08:54:43,369 INFO L226 Difference]: Without dead ends: 14708 [2019-11-25 08:54:43,381 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-25 08:54:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-11-25 08:54:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14706. [2019-11-25 08:54:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-25 08:54:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20587 transitions. [2019-11-25 08:54:43,880 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20587 transitions. Word has length 186 [2019-11-25 08:54:43,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:43,880 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20587 transitions. [2019-11-25 08:54:43,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20587 transitions. [2019-11-25 08:54:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-25 08:54:43,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:43,892 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-25 08:54:44,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:44,096 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:44,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:44,097 INFO L82 PathProgramCache]: Analyzing trace with hash 9813042, now seen corresponding path program 3 times [2019-11-25 08:54:44,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:44,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513911513] [2019-11-25 08:54:44,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:44,164 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-25 08:54:44,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513911513] [2019-11-25 08:54:44,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612103795] [2019-11-25 08:54:44,165 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:44,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-25 08:54:44,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:44,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:44,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:44,264 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-25 08:54:44,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:44,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:44,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877643772] [2019-11-25 08:54:44,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:44,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:44,266 INFO L87 Difference]: Start difference. First operand 14706 states and 20587 transitions. Second operand 3 states. [2019-11-25 08:54:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:44,941 INFO L93 Difference]: Finished difference Result 30070 states and 42014 transitions. [2019-11-25 08:54:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:44,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-25 08:54:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:44,971 INFO L225 Difference]: With dead ends: 30070 [2019-11-25 08:54:44,971 INFO L226 Difference]: Without dead ends: 15314 [2019-11-25 08:54:44,982 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-25 08:54:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2019-11-25 08:54:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 14706. [2019-11-25 08:54:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-25 08:54:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20547 transitions. [2019-11-25 08:54:45,457 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20547 transitions. Word has length 186 [2019-11-25 08:54:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:45,457 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20547 transitions. [2019-11-25 08:54:45,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20547 transitions. [2019-11-25 08:54:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-25 08:54:45,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:45,470 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-25 08:54:45,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:45,673 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 854141729, now seen corresponding path program 1 times [2019-11-25 08:54:45,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:45,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845802750] [2019-11-25 08:54:45,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,740 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-25 08:54:45,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845802750] [2019-11-25 08:54:45,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602116021] [2019-11-25 08:54:45,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:45,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:54:45,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:45,866 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-25 08:54:45,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:54:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:54:45,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188313937] [2019-11-25 08:54:45,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:45,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:45,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:54:45,868 INFO L87 Difference]: Start difference. First operand 14706 states and 20547 transitions. Second operand 3 states. [2019-11-25 08:54:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:46,602 INFO L93 Difference]: Finished difference Result 29822 states and 41582 transitions. [2019-11-25 08:54:46,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:46,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-11-25 08:54:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:46,629 INFO L225 Difference]: With dead ends: 29822 [2019-11-25 08:54:46,629 INFO L226 Difference]: Without dead ends: 15186 [2019-11-25 08:54:46,635 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-25 08:54:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-11-25 08:54:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 14706. [2019-11-25 08:54:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-11-25 08:54:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 20523 transitions. [2019-11-25 08:54:47,118 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 20523 transitions. Word has length 187 [2019-11-25 08:54:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:47,118 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 20523 transitions. [2019-11-25 08:54:47,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 20523 transitions. [2019-11-25 08:54:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-25 08:54:47,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:47,127 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-25 08:54:47,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:47,331 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:47,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1508265096, now seen corresponding path program 4 times [2019-11-25 08:54:47,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:47,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870246508] [2019-11-25 08:54:47,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:47,396 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-25 08:54:47,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870246508] [2019-11-25 08:54:47,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267440390] [2019-11-25 08:54:47,397 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/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-25 08:54:47,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:54:47,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:54:47,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:54:47,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:54:47,536 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-25 08:54:47,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:54:47,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-25 08:54:47,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039575333] [2019-11-25 08:54:47,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:54:47,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:54:47,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:54:47,539 INFO L87 Difference]: Start difference. First operand 14706 states and 20523 transitions. Second operand 7 states. [2019-11-25 08:54:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:49,712 INFO L93 Difference]: Finished difference Result 50232 states and 68987 transitions. [2019-11-25 08:54:49,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:54:49,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 188 [2019-11-25 08:54:49,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:49,747 INFO L225 Difference]: With dead ends: 50232 [2019-11-25 08:54:49,747 INFO L226 Difference]: Without dead ends: 34696 [2019-11-25 08:54:49,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:54:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34696 states. [2019-11-25 08:54:50,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34696 to 17906. [2019-11-25 08:54:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17906 states. [2019-11-25 08:54:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17906 states to 17906 states and 24463 transitions. [2019-11-25 08:54:50,452 INFO L78 Accepts]: Start accepts. Automaton has 17906 states and 24463 transitions. Word has length 188 [2019-11-25 08:54:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:50,453 INFO L462 AbstractCegarLoop]: Abstraction has 17906 states and 24463 transitions. [2019-11-25 08:54:50,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:54:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17906 states and 24463 transitions. [2019-11-25 08:54:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-25 08:54:50,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:50,459 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-25 08:54:50,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:54:50,662 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash 941780496, now seen corresponding path program 1 times [2019-11-25 08:54:50,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:50,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541827391] [2019-11-25 08:54:50,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:54:50,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:54:50,856 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:54:50,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:54:50 BoogieIcfgContainer [2019-11-25 08:54:50,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:54:50,969 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:54:50,969 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:54:50,969 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:54:50,970 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:26" (3/4) ... [2019-11-25 08:54:50,972 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:54:51,117 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_731dd168-3c57-4b01-91d2-45e707972abe/bin/uautomizer/witness.graphml [2019-11-25 08:54:51,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:54:51,120 INFO L168 Benchmark]: Toolchain (without parser) took 25813.43 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -149.3 MB). Peak memory consumption was 879.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,120 INFO L168 Benchmark]: CDTParser took 0.18 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-25 08:54:51,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,121 INFO L168 Benchmark]: Boogie Preprocessor took 33.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,121 INFO L168 Benchmark]: RCFGBuilder took 898.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,122 INFO L168 Benchmark]: TraceAbstraction took 24171.46 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 870.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.1 MB). Peak memory consumption was 822.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,122 INFO L168 Benchmark]: Witness Printer took 148.93 ms. Allocated memory is still 2.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:51,124 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.18 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 475.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 898.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24171.46 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 870.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -48.1 MB). Peak memory consumption was 822.3 MB. Max. memory is 11.5 GB. * Witness Printer took 148.93 ms. Allocated memory is still 2.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 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.1s, OverallIterations: 42, TraceHistogramMax: 7, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8062 SDtfs, 6835 SDslu, 4489 SDs, 0 SdLazy, 4523 SolverSat, 1377 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s 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.9s AutomataMinimizationTime, 41 MinimizatonAttempts, 19003 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.8s 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...