./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/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 b9ebacab53db4f4e6d9f51b7145688401913e247 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 12:39:10,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:39:10,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:39:10,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:39:10,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:39:10,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:39:10,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:39:10,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:39:10,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:39:10,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:39:10,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:39:10,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:39:10,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:39:10,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:39:10,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:39:10,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:39:10,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:39:10,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:39:10,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:39:10,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:39:10,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:39:10,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:39:10,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:39:10,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:39:10,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:39:10,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:39:10,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:39:10,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:39:10,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:39:10,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:39:10,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:39:10,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:39:10,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:39:10,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:39:10,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:39:10,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:39:10,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:39:10,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:39:10,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:39:10,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:39:10,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:39:10,660 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:39:10,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:39:10,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:39:10,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:39:10,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:39:10,674 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:39:10,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:39:10,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:39:10,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:39:10,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:39:10,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:39:10,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:39:10,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:39:10,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:39:10,676 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:39:10,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:39:10,676 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:39:10,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:39:10,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:39:10,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:39:10,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:39:10,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:39:10,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:39:10,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:39:10,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:39:10,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:39:10,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:39:10,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:39:10,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:39:10,679 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:39:10,679 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_ff02a5be-516e-45d5-956c-04c67a5b6a86/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 -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-12-07 12:39:10,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:39:10,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:39:10,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:39:10,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:39:10,799 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:39:10,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-12-07 12:39:10,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/data/e5b0a6c48/31487fef3c274e15bd6b8376f282c1ee/FLAG941f2de0d [2019-12-07 12:39:11,189 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:39:11,190 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-12-07 12:39:11,201 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/data/e5b0a6c48/31487fef3c274e15bd6b8376f282c1ee/FLAG941f2de0d [2019-12-07 12:39:11,212 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/data/e5b0a6c48/31487fef3c274e15bd6b8376f282c1ee [2019-12-07 12:39:11,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:39:11,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:39:11,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:39:11,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:39:11,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:39:11,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12624de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11, skipping insertion in model container [2019-12-07 12:39:11,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:39:11,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:39:11,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:39:11,450 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:39:11,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:39:11,500 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:39:11,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11 WrapperNode [2019-12-07 12:39:11,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:39:11,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:39:11,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:39:11,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:39:11,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:39:11,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:39:11,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:39:11,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:39:11,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... [2019-12-07 12:39:11,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:39:11,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:39:11,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:39:11,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:39:11,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/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-12-07 12:39:11,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:39:11,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:39:11,676 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:39:12,013 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 12:39:12,013 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 12:39:12,014 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:39:12,014 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:39:12,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:12 BoogieIcfgContainer [2019-12-07 12:39:12,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:39:12,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:39:12,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:39:12,019 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:39:12,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:39:11" (1/3) ... [2019-12-07 12:39:12,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60055617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:39:12, skipping insertion in model container [2019-12-07 12:39:12,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:11" (2/3) ... [2019-12-07 12:39:12,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60055617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:39:12, skipping insertion in model container [2019-12-07 12:39:12,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:12" (3/3) ... [2019-12-07 12:39:12,021 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-12-07 12:39:12,030 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:39:12,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:39:12,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:39:12,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:39:12,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:39:12,062 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:39:12,062 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:39:12,062 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:39:12,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:39:12,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:39:12,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:39:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-12-07 12:39:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:39:12,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:12,080 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-12-07 12:39:12,081 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:12,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-12-07 12:39:12,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:12,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040071675] [2019-12-07 12:39:12,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:12,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040071675] [2019-12-07 12:39:12,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:12,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:12,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658013708] [2019-12-07 12:39:12,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:12,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:12,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,230 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-12-07 12:39:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:12,368 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-12-07 12:39:12,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:12,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 12:39:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:12,378 INFO L225 Difference]: With dead ends: 352 [2019-12-07 12:39:12,378 INFO L226 Difference]: Without dead ends: 173 [2019-12-07 12:39:12,380 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-12-07 12:39:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-12-07 12:39:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-12-07 12:39:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 12:39:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-12-07 12:39:12,415 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-12-07 12:39:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:12,416 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-12-07 12:39:12,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-12-07 12:39:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:39:12,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:12,417 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-12-07 12:39:12,417 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-12-07 12:39:12,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:12,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947841928] [2019-12-07 12:39:12,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:12,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947841928] [2019-12-07 12:39:12,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:12,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:12,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81597661] [2019-12-07 12:39:12,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:12,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,454 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-12-07 12:39:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:12,534 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-12-07 12:39:12,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:12,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:39:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:12,536 INFO L225 Difference]: With dead ends: 357 [2019-12-07 12:39:12,536 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 12:39:12,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 12:39:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-12-07 12:39:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-12-07 12:39:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-12-07 12:39:12,548 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-12-07 12:39:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:12,549 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-12-07 12:39:12,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-12-07 12:39:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:39:12,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:12,550 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-12-07 12:39:12,550 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:12,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-12-07 12:39:12,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:12,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877214037] [2019-12-07 12:39:12,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:12,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877214037] [2019-12-07 12:39:12,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:12,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:12,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811230250] [2019-12-07 12:39:12,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,581 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-12-07 12:39:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:12,670 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-12-07 12:39:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:12,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:39:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:12,672 INFO L225 Difference]: With dead ends: 387 [2019-12-07 12:39:12,672 INFO L226 Difference]: Without dead ends: 201 [2019-12-07 12:39:12,673 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-12-07 12:39:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-07 12:39:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-12-07 12:39:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-12-07 12:39:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-12-07 12:39:12,683 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-12-07 12:39:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:12,683 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-12-07 12:39:12,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-12-07 12:39:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:39:12,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:12,684 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-12-07 12:39:12,685 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-12-07 12:39:12,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:12,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53670038] [2019-12-07 12:39:12,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:12,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53670038] [2019-12-07 12:39:12,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:12,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:12,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608050135] [2019-12-07 12:39:12,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:12,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:12,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:12,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,717 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-12-07 12:39:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:12,809 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-12-07 12:39:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:12,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:39:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:12,811 INFO L225 Difference]: With dead ends: 392 [2019-12-07 12:39:12,811 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 12:39:12,812 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-12-07 12:39:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 12:39:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-12-07 12:39:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 12:39:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-12-07 12:39:12,822 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-12-07 12:39:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:12,822 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-12-07 12:39:12,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-12-07 12:39:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:39:12,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:12,824 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-12-07 12:39:12,824 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-12-07 12:39:12,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:12,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178377528] [2019-12-07 12:39:12,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:12,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178377528] [2019-12-07 12:39:12,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:12,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:12,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505711063] [2019-12-07 12:39:12,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:12,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,855 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-12-07 12:39:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:12,933 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-12-07 12:39:12,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:12,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:39:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:12,934 INFO L225 Difference]: With dead ends: 403 [2019-12-07 12:39:12,934 INFO L226 Difference]: Without dead ends: 210 [2019-12-07 12:39:12,935 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-12-07 12:39:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-12-07 12:39:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-12-07 12:39:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 12:39:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-12-07 12:39:12,942 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-12-07 12:39:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:12,942 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-12-07 12:39:12,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-12-07 12:39:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:39:12,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:12,943 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] [2019-12-07 12:39:12,943 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-12-07 12:39:12,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:12,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009907540] [2019-12-07 12:39:12,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:12,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009907540] [2019-12-07 12:39:12,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:12,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:12,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821370802] [2019-12-07 12:39:12,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:12,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:12,964 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-12-07 12:39:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,049 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-12-07 12:39:13,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:13,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 12:39:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,050 INFO L225 Difference]: With dead ends: 403 [2019-12-07 12:39:13,050 INFO L226 Difference]: Without dead ends: 210 [2019-12-07 12:39:13,051 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-12-07 12:39:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-12-07 12:39:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-12-07 12:39:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 12:39:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-12-07 12:39:13,059 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-12-07 12:39:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,059 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-12-07 12:39:13,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-12-07 12:39:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:39:13,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,060 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] [2019-12-07 12:39:13,060 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-12-07 12:39:13,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669467704] [2019-12-07 12:39:13,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:13,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669467704] [2019-12-07 12:39:13,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:13,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:13,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981661711] [2019-12-07 12:39:13,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:13,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:13,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:13,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:13,088 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-12-07 12:39:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,171 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-12-07 12:39:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:13,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:39:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,173 INFO L225 Difference]: With dead ends: 403 [2019-12-07 12:39:13,173 INFO L226 Difference]: Without dead ends: 210 [2019-12-07 12:39:13,174 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-12-07 12:39:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-12-07 12:39:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-12-07 12:39:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-07 12:39:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-12-07 12:39:13,179 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-12-07 12:39:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,180 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-12-07 12:39:13,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-12-07 12:39:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:39:13,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,180 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] [2019-12-07 12:39:13,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-12-07 12:39:13,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492489895] [2019-12-07 12:39:13,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:13,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492489895] [2019-12-07 12:39:13,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:13,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:39:13,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469439277] [2019-12-07 12:39:13,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:13,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:13,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:13,207 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-12-07 12:39:13,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,356 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-12-07 12:39:13,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:39:13,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 12:39:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,358 INFO L225 Difference]: With dead ends: 599 [2019-12-07 12:39:13,358 INFO L226 Difference]: Without dead ends: 406 [2019-12-07 12:39:13,359 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-12-07 12:39:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-07 12:39:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-12-07 12:39:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 12:39:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-12-07 12:39:13,371 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-12-07 12:39:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,371 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-12-07 12:39:13,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-12-07 12:39:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:39:13,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,373 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-12-07 12:39:13,373 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-12-07 12:39:13,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770319507] [2019-12-07 12:39:13,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:13,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770319507] [2019-12-07 12:39:13,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:13,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:13,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128753279] [2019-12-07 12:39:13,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:13,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:13,400 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-12-07 12:39:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,513 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-12-07 12:39:13,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:13,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-12-07 12:39:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,515 INFO L225 Difference]: With dead ends: 841 [2019-12-07 12:39:13,515 INFO L226 Difference]: Without dead ends: 466 [2019-12-07 12:39:13,516 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-12-07 12:39:13,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-12-07 12:39:13,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-12-07 12:39:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-07 12:39:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-12-07 12:39:13,528 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-12-07 12:39:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,528 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-12-07 12:39:13,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-12-07 12:39:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:39:13,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,529 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-12-07 12:39:13,529 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,529 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-12-07 12:39:13,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017335832] [2019-12-07 12:39:13,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:13,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017335832] [2019-12-07 12:39:13,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:13,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:13,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458218851] [2019-12-07 12:39:13,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:13,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:13,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:13,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:13,550 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-12-07 12:39:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,658 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-12-07 12:39:13,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:13,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 12:39:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,662 INFO L225 Difference]: With dead ends: 930 [2019-12-07 12:39:13,662 INFO L226 Difference]: Without dead ends: 489 [2019-12-07 12:39:13,663 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-12-07 12:39:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-12-07 12:39:13,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-12-07 12:39:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-07 12:39:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-12-07 12:39:13,680 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-12-07 12:39:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,680 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-12-07 12:39:13,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-12-07 12:39:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:39:13,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,682 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:13,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-12-07 12:39:13,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113141684] [2019-12-07 12:39:13,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:39:13,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113141684] [2019-12-07 12:39:13,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:13,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:13,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454968291] [2019-12-07 12:39:13,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:13,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:13,708 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-12-07 12:39:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,809 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-12-07 12:39:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:13,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 12:39:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,813 INFO L225 Difference]: With dead ends: 987 [2019-12-07 12:39:13,813 INFO L226 Difference]: Without dead ends: 523 [2019-12-07 12:39:13,814 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-12-07 12:39:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-07 12:39:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-12-07 12:39:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-12-07 12:39:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-12-07 12:39:13,833 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-12-07 12:39:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,833 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-12-07 12:39:13,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-12-07 12:39:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:39:13,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,835 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:13,835 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-12-07 12:39:13,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667820420] [2019-12-07 12:39:13,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:39:13,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667820420] [2019-12-07 12:39:13,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:13,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:13,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279385419] [2019-12-07 12:39:13,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:13,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:13,856 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-12-07 12:39:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:13,964 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-12-07 12:39:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:13,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 12:39:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:13,967 INFO L225 Difference]: With dead ends: 1021 [2019-12-07 12:39:13,967 INFO L226 Difference]: Without dead ends: 523 [2019-12-07 12:39:13,968 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-12-07 12:39:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-12-07 12:39:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-12-07 12:39:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-12-07 12:39:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-12-07 12:39:13,987 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-12-07 12:39:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:13,987 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-12-07 12:39:13,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-12-07 12:39:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:39:13,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:13,989 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, 1, 1] [2019-12-07 12:39:13,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-12-07 12:39:13,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:13,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322044989] [2019-12-07 12:39:13,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 12:39:14,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322044989] [2019-12-07 12:39:14,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643478846] [2019-12-07 12:39:14,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,017 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-12-07 12:39:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:14,129 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-12-07 12:39:14,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:14,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 12:39:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:14,132 INFO L225 Difference]: With dead ends: 1068 [2019-12-07 12:39:14,132 INFO L226 Difference]: Without dead ends: 570 [2019-12-07 12:39:14,133 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-12-07 12:39:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-07 12:39:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-12-07 12:39:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-12-07 12:39:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-12-07 12:39:14,147 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-12-07 12:39:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:14,147 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-12-07 12:39:14,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-12-07 12:39:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 12:39:14,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:14,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:14,148 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-12-07 12:39:14,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:14,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309935586] [2019-12-07 12:39:14,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:14,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309935586] [2019-12-07 12:39:14,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211777222] [2019-12-07 12:39:14,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,175 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-12-07 12:39:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:14,288 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-12-07 12:39:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:14,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-07 12:39:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:14,291 INFO L225 Difference]: With dead ends: 1178 [2019-12-07 12:39:14,291 INFO L226 Difference]: Without dead ends: 617 [2019-12-07 12:39:14,292 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-12-07 12:39:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-07 12:39:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-12-07 12:39:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-12-07 12:39:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-12-07 12:39:14,306 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-12-07 12:39:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:14,306 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-12-07 12:39:14,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-12-07 12:39:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 12:39:14,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:14,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:14,308 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-12-07 12:39:14,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:14,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187996897] [2019-12-07 12:39:14,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187996897] [2019-12-07 12:39:14,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115067986] [2019-12-07 12:39:14,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,332 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-12-07 12:39:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:14,445 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-12-07 12:39:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:14,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-07 12:39:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:14,448 INFO L225 Difference]: With dead ends: 1221 [2019-12-07 12:39:14,448 INFO L226 Difference]: Without dead ends: 617 [2019-12-07 12:39:14,449 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-12-07 12:39:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-12-07 12:39:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-12-07 12:39:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-12-07 12:39:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-12-07 12:39:14,463 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-12-07 12:39:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:14,464 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-12-07 12:39:14,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-12-07 12:39:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 12:39:14,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:14,465 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, 1, 1] [2019-12-07 12:39:14,465 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-12-07 12:39:14,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:14,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615037140] [2019-12-07 12:39:14,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:39:14,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615037140] [2019-12-07 12:39:14,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488984995] [2019-12-07 12:39:14,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,487 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-12-07 12:39:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:14,591 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-12-07 12:39:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:14,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 12:39:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:14,594 INFO L225 Difference]: With dead ends: 1217 [2019-12-07 12:39:14,594 INFO L226 Difference]: Without dead ends: 613 [2019-12-07 12:39:14,595 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-12-07 12:39:14,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-12-07 12:39:14,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-12-07 12:39:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-12-07 12:39:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-12-07 12:39:14,608 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-12-07 12:39:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:14,608 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-12-07 12:39:14,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-12-07 12:39:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 12:39:14,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:14,609 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:14,609 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-12-07 12:39:14,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:14,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786909111] [2019-12-07 12:39:14,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:39:14,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786909111] [2019-12-07 12:39:14,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049605493] [2019-12-07 12:39:14,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,635 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-12-07 12:39:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:14,739 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-12-07 12:39:14,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:14,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-07 12:39:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:14,743 INFO L225 Difference]: With dead ends: 1275 [2019-12-07 12:39:14,743 INFO L226 Difference]: Without dead ends: 671 [2019-12-07 12:39:14,744 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-12-07 12:39:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-07 12:39:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-12-07 12:39:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 12:39:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-12-07 12:39:14,764 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-12-07 12:39:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:14,764 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-12-07 12:39:14,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:14,764 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-12-07 12:39:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 12:39:14,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:14,766 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:14,766 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:14,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-12-07 12:39:14,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:14,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554542500] [2019-12-07 12:39:14,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:39:14,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554542500] [2019-12-07 12:39:14,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205851781] [2019-12-07 12:39:14,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,805 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-12-07 12:39:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:14,902 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-12-07 12:39:14,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:14,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 12:39:14,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:14,904 INFO L225 Difference]: With dead ends: 1307 [2019-12-07 12:39:14,904 INFO L226 Difference]: Without dead ends: 671 [2019-12-07 12:39:14,905 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-12-07 12:39:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-07 12:39:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-12-07 12:39:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 12:39:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-12-07 12:39:14,919 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-12-07 12:39:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:14,919 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-12-07 12:39:14,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-12-07 12:39:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:39:14,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:14,920 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, 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] [2019-12-07 12:39:14,920 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:14,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-12-07 12:39:14,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:14,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921466877] [2019-12-07 12:39:14,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:39:14,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921466877] [2019-12-07 12:39:14,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:14,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:14,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464656743] [2019-12-07 12:39:14,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:14,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:14,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:14,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:14,942 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-12-07 12:39:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,051 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-12-07 12:39:15,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-12-07 12:39:15,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,054 INFO L225 Difference]: With dead ends: 1343 [2019-12-07 12:39:15,054 INFO L226 Difference]: Without dead ends: 707 [2019-12-07 12:39:15,055 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-12-07 12:39:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-07 12:39:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-12-07 12:39:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-07 12:39:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-12-07 12:39:15,069 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-12-07 12:39:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,069 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-12-07 12:39:15,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-12-07 12:39:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 12:39:15,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,070 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, 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] [2019-12-07 12:39:15,070 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-12-07 12:39:15,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438910790] [2019-12-07 12:39:15,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 12:39:15,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438910790] [2019-12-07 12:39:15,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843985113] [2019-12-07 12:39:15,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,093 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-12-07 12:39:15,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,201 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-12-07 12:39:15,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-12-07 12:39:15,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,204 INFO L225 Difference]: With dead ends: 1400 [2019-12-07 12:39:15,204 INFO L226 Difference]: Without dead ends: 708 [2019-12-07 12:39:15,205 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-12-07 12:39:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-07 12:39:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-12-07 12:39:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-12-07 12:39:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-12-07 12:39:15,219 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-12-07 12:39:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,220 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-12-07 12:39:15,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-12-07 12:39:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 12:39:15,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,221 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, 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-12-07 12:39:15,221 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-12-07 12:39:15,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845979057] [2019-12-07 12:39:15,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:39:15,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845979057] [2019-12-07 12:39:15,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281226543] [2019-12-07 12:39:15,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,243 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-12-07 12:39:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,343 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-12-07 12:39:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-12-07 12:39:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,346 INFO L225 Difference]: With dead ends: 1432 [2019-12-07 12:39:15,346 INFO L226 Difference]: Without dead ends: 743 [2019-12-07 12:39:15,347 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-12-07 12:39:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-07 12:39:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-12-07 12:39:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-07 12:39:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-12-07 12:39:15,362 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-12-07 12:39:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,362 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-12-07 12:39:15,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-12-07 12:39:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:39:15,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,363 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, 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-12-07 12:39:15,364 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-12-07 12:39:15,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425747035] [2019-12-07 12:39:15,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:39:15,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425747035] [2019-12-07 12:39:15,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530908037] [2019-12-07 12:39:15,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,392 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-12-07 12:39:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,489 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-12-07 12:39:15,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-12-07 12:39:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,493 INFO L225 Difference]: With dead ends: 1473 [2019-12-07 12:39:15,493 INFO L226 Difference]: Without dead ends: 743 [2019-12-07 12:39:15,494 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-12-07 12:39:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-07 12:39:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-12-07 12:39:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-07 12:39:15,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-12-07 12:39:15,515 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-12-07 12:39:15,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,515 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-12-07 12:39:15,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-12-07 12:39:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 12:39:15,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,516 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:15,516 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,516 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-12-07 12:39:15,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080002636] [2019-12-07 12:39:15,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 12:39:15,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080002636] [2019-12-07 12:39:15,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573421645] [2019-12-07 12:39:15,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,537 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-12-07 12:39:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,629 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-12-07 12:39:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-12-07 12:39:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,633 INFO L225 Difference]: With dead ends: 1509 [2019-12-07 12:39:15,633 INFO L226 Difference]: Without dead ends: 779 [2019-12-07 12:39:15,634 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-12-07 12:39:15,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-12-07 12:39:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-12-07 12:39:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-07 12:39:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-12-07 12:39:15,655 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-12-07 12:39:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,655 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-12-07 12:39:15,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-12-07 12:39:15,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 12:39:15,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,657 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:15,658 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-12-07 12:39:15,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508801599] [2019-12-07 12:39:15,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 12:39:15,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508801599] [2019-12-07 12:39:15,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118073735] [2019-12-07 12:39:15,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,683 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-12-07 12:39:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,776 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-12-07 12:39:15,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-12-07 12:39:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,780 INFO L225 Difference]: With dead ends: 1541 [2019-12-07 12:39:15,780 INFO L226 Difference]: Without dead ends: 779 [2019-12-07 12:39:15,781 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-12-07 12:39:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-12-07 12:39:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-12-07 12:39:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-07 12:39:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-12-07 12:39:15,803 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-12-07 12:39:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,803 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-12-07 12:39:15,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-12-07 12:39:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 12:39:15,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,806 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:15,806 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-12-07 12:39:15,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649547201] [2019-12-07 12:39:15,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-12-07 12:39:15,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649547201] [2019-12-07 12:39:15,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324204846] [2019-12-07 12:39:15,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,839 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-12-07 12:39:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:15,926 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-12-07 12:39:15,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:15,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-12-07 12:39:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:15,929 INFO L225 Difference]: With dead ends: 1567 [2019-12-07 12:39:15,929 INFO L226 Difference]: Without dead ends: 805 [2019-12-07 12:39:15,929 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-12-07 12:39:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-12-07 12:39:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-12-07 12:39:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 12:39:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-12-07 12:39:15,945 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-12-07 12:39:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:15,945 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-12-07 12:39:15,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-12-07 12:39:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 12:39:15,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:15,946 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:15,946 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-12-07 12:39:15,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:15,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103399415] [2019-12-07 12:39:15,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-12-07 12:39:15,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103399415] [2019-12-07 12:39:15,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:15,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:15,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317266776] [2019-12-07 12:39:15,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:15,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:15,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:15,969 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-12-07 12:39:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,061 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-12-07 12:39:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-12-07 12:39:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,065 INFO L225 Difference]: With dead ends: 1595 [2019-12-07 12:39:16,065 INFO L226 Difference]: Without dead ends: 805 [2019-12-07 12:39:16,066 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-12-07 12:39:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-12-07 12:39:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-12-07 12:39:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 12:39:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-12-07 12:39:16,089 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-12-07 12:39:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,089 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-12-07 12:39:16,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-12-07 12:39:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 12:39:16,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,091 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,091 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-12-07 12:39:16,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848722399] [2019-12-07 12:39:16,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:16,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 12:39:16,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848722399] [2019-12-07 12:39:16,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:16,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:16,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999592855] [2019-12-07 12:39:16,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:16,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:16,121 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-12-07 12:39:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,250 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-12-07 12:39:16,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-12-07 12:39:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,253 INFO L225 Difference]: With dead ends: 1650 [2019-12-07 12:39:16,253 INFO L226 Difference]: Without dead ends: 860 [2019-12-07 12:39:16,254 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-12-07 12:39:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-12-07 12:39:16,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-12-07 12:39:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-12-07 12:39:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-12-07 12:39:16,277 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-12-07 12:39:16,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,277 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-12-07 12:39:16,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-12-07 12:39:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 12:39:16,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,278 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,279 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-12-07 12:39:16,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632120468] [2019-12-07 12:39:16,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 12:39:16,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632120468] [2019-12-07 12:39:16,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:16,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:16,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051718327] [2019-12-07 12:39:16,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:16,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:16,316 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-12-07 12:39:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,423 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-12-07 12:39:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-12-07 12:39:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,427 INFO L225 Difference]: With dead ends: 1699 [2019-12-07 12:39:16,427 INFO L226 Difference]: Without dead ends: 844 [2019-12-07 12:39:16,428 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-12-07 12:39:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-12-07 12:39:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-12-07 12:39:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-07 12:39:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-12-07 12:39:16,449 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-12-07 12:39:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,449 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-12-07 12:39:16,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-12-07 12:39:16,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 12:39:16,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,450 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,450 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-12-07 12:39:16,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780391367] [2019-12-07 12:39:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 12:39:16,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780391367] [2019-12-07 12:39:16,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:16,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:16,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269397303] [2019-12-07 12:39:16,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:16,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:16,476 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-12-07 12:39:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,574 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-12-07 12:39:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-12-07 12:39:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,577 INFO L225 Difference]: With dead ends: 1665 [2019-12-07 12:39:16,577 INFO L226 Difference]: Without dead ends: 842 [2019-12-07 12:39:16,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-12-07 12:39:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-07 12:39:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-12-07 12:39:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-07 12:39:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-12-07 12:39:16,595 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-12-07 12:39:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,595 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-12-07 12:39:16,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,595 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-12-07 12:39:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 12:39:16,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,596 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,596 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-12-07 12:39:16,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217205735] [2019-12-07 12:39:16,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 12:39:16,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217205735] [2019-12-07 12:39:16,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:16,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:39:16,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49841771] [2019-12-07 12:39:16,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:16,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:16,623 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-12-07 12:39:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,715 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-12-07 12:39:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-12-07 12:39:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,718 INFO L225 Difference]: With dead ends: 1665 [2019-12-07 12:39:16,718 INFO L226 Difference]: Without dead ends: 825 [2019-12-07 12:39:16,719 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-12-07 12:39:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-12-07 12:39:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-12-07 12:39:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 12:39:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-12-07 12:39:16,737 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-12-07 12:39:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,737 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-12-07 12:39:16,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-12-07 12:39:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 12:39:16,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,738 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,738 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-12-07 12:39:16,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349347075] [2019-12-07 12:39:16,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-12-07 12:39:16,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349347075] [2019-12-07 12:39:16,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:16,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:39:16,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968179800] [2019-12-07 12:39:16,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:16,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:16,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:16,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:16,772 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-12-07 12:39:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,811 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-12-07 12:39:16,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-12-07 12:39:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,817 INFO L225 Difference]: With dead ends: 2411 [2019-12-07 12:39:16,817 INFO L226 Difference]: Without dead ends: 1605 [2019-12-07 12:39:16,818 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-12-07 12:39:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-12-07 12:39:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-12-07 12:39:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-07 12:39:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-12-07 12:39:16,844 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-12-07 12:39:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,844 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-12-07 12:39:16,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,844 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-12-07 12:39:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 12:39:16,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,845 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,845 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-12-07 12:39:16,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475739659] [2019-12-07 12:39:16,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-12-07 12:39:16,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475739659] [2019-12-07 12:39:16,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:16,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:39:16,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377449132] [2019-12-07 12:39:16,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:16,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:16,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:16,879 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-12-07 12:39:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:16,936 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-12-07 12:39:16,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:16,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-12-07 12:39:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:16,944 INFO L225 Difference]: With dead ends: 2410 [2019-12-07 12:39:16,944 INFO L226 Difference]: Without dead ends: 1602 [2019-12-07 12:39:16,945 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-12-07 12:39:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-12-07 12:39:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-12-07 12:39:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-07 12:39:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-12-07 12:39:16,984 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-12-07 12:39:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:16,984 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-12-07 12:39:16,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-12-07 12:39:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 12:39:16,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:16,985 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:16,985 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-12-07 12:39:16,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:16,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463292920] [2019-12-07 12:39:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-12-07 12:39:17,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463292920] [2019-12-07 12:39:17,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:17,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:39:17,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576556849] [2019-12-07 12:39:17,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:17,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:17,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:17,057 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-12-07 12:39:17,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:17,173 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-12-07 12:39:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:17,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-12-07 12:39:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:17,184 INFO L225 Difference]: With dead ends: 4746 [2019-12-07 12:39:17,184 INFO L226 Difference]: Without dead ends: 3153 [2019-12-07 12:39:17,186 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-12-07 12:39:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-12-07 12:39:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-12-07 12:39:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-07 12:39:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-12-07 12:39:17,234 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-12-07 12:39:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:17,235 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-12-07 12:39:17,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-12-07 12:39:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:39:17,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:17,236 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:17,236 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-12-07 12:39:17,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:17,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213753488] [2019-12-07 12:39:17,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 12:39:17,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213753488] [2019-12-07 12:39:17,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:17,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:39:17,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999310517] [2019-12-07 12:39:17,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:39:17,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:17,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:39:17,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:39:17,274 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-12-07 12:39:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:17,421 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-12-07 12:39:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:39:17,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-12-07 12:39:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:17,432 INFO L225 Difference]: With dead ends: 4786 [2019-12-07 12:39:17,432 INFO L226 Difference]: Without dead ends: 3193 [2019-12-07 12:39:17,434 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-12-07 12:39:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-12-07 12:39:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-12-07 12:39:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-12-07 12:39:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-12-07 12:39:17,521 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-12-07 12:39:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:17,521 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-12-07 12:39:17,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:39:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-12-07 12:39:17,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:39:17,522 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:17,522 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:17,522 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:17,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-12-07 12:39:17,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:17,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016217943] [2019-12-07 12:39:17,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:39:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:39:17,600 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:39:17,600 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:39:17,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:39:17 BoogieIcfgContainer [2019-12-07 12:39:17,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:39:17,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:39:17,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:39:17,650 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:39:17,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:12" (3/4) ... [2019-12-07 12:39:17,651 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:39:17,713 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ff02a5be-516e-45d5-956c-04c67a5b6a86/bin/uautomizer/witness.graphml [2019-12-07 12:39:17,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:39:17,715 INFO L168 Benchmark]: Toolchain (without parser) took 6499.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 943.5 MB in the beginning and 917.7 MB in the end (delta: 25.8 MB). Peak memory consumption was 343.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:39:17,715 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:39:17,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:39:17,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.08 ms. Allocated memory is still 1.1 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-12-07 12:39:17,715 INFO L168 Benchmark]: Boogie Preprocessor took 25.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:39:17,716 INFO L168 Benchmark]: RCFGBuilder took 450.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:39:17,716 INFO L168 Benchmark]: TraceAbstraction took 5632.99 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 219.7 MB). Free memory was 1.0 GB in the beginning and 941.3 MB in the end (delta: 73.9 MB). Peak memory consumption was 293.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:39:17,716 INFO L168 Benchmark]: Witness Printer took 63.75 ms. Allocated memory is still 1.3 GB. Free memory was 941.3 MB in the beginning and 917.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:39:17,718 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.08 ms. Allocated memory is still 1.1 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. * Boogie Preprocessor took 25.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 450.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5632.99 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 219.7 MB). Free memory was 1.0 GB in the beginning and 941.3 MB in the end (delta: 73.9 MB). Peak memory consumption was 293.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.75 ms. Allocated memory is still 1.3 GB. Free memory was 941.3 MB in the beginning and 917.7 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] 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 ; [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 ; [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 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.5s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...