./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/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 600447986a0d0a3d94421aa90c6997a7dd1eb35a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:06,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:06,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:06,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:06,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:06,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:06,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:06,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:06,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:06,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:06,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:06,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:06,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:06,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:06,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:06,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:06,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:06,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:06,552 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:06,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:06,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:06,557 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:06,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:06,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:06,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:06,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:06,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:06,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:06,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:06,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:06,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:06,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:06,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:06,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:06,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:06,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:06,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:06,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:06,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:06,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:06,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:06,573 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:06,585 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:06,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:06,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:06,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:06,595 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:06,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:06,596 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:06,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:06,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:06,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:06,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:06,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:06,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:06,597 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:06,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:06,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:06,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:06,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:06,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:06,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:06,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:06,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:06,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:06,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:06,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:06,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:06,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:06,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:06,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/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 -> 600447986a0d0a3d94421aa90c6997a7dd1eb35a [2019-10-22 08:58:06,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:06,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:06,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:06,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:06,642 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:06,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2019-10-22 08:58:06,691 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/data/10ff47aba/27c041dc35cd4eab980a8c78f760a880/FLAG0d99c5536 [2019-10-22 08:58:07,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:07,168 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl3.cil-1.c [2019-10-22 08:58:07,183 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/data/10ff47aba/27c041dc35cd4eab980a8c78f760a880/FLAG0d99c5536 [2019-10-22 08:58:07,666 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/data/10ff47aba/27c041dc35cd4eab980a8c78f760a880 [2019-10-22 08:58:07,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:07,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:07,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:07,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:07,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:07,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:07" (1/1) ... [2019-10-22 08:58:07,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4020c602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:07, skipping insertion in model container [2019-10-22 08:58:07,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:07" (1/1) ... [2019-10-22 08:58:07,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:07,750 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:08,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:08,104 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:08,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:08,230 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:08,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08 WrapperNode [2019-10-22 08:58:08,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:08,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:08,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:08,232 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:08,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:08,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:08,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:08,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:08,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... [2019-10-22 08:58:08,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:08,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:08,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:08,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:08,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:08,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:08,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:08,703 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,708 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,715 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,720 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,723 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,727 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,742 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,747 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,749 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,750 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,756 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,760 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,761 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,762 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,765 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,768 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,773 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,781 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,783 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,786 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,789 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,791 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,792 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:08,794 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:58:09,635 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume !false; [2019-10-22 08:58:09,636 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##415: assume false; [2019-10-22 08:58:09,636 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##445: assume false; [2019-10-22 08:58:09,636 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##290: assume false; [2019-10-22 08:58:09,636 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##291: assume !false; [2019-10-22 08:58:09,637 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##490: assume !false; [2019-10-22 08:58:09,637 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##269: assume false; [2019-10-22 08:58:09,637 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##270: assume !false; [2019-10-22 08:58:09,637 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##446: assume !false; [2019-10-22 08:58:09,637 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##209: assume false; [2019-10-22 08:58:09,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##210: assume !false; [2019-10-22 08:58:09,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-10-22 08:58:09,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-10-22 08:58:09,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##470: assume false; [2019-10-22 08:58:09,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##232: assume false; [2019-10-22 08:58:09,638 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##471: assume !false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##233: assume !false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##242: assume !false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##241: assume false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##489: assume false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume !false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##245: assume false; [2019-10-22 08:58:09,639 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##86: assume !false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##175: assume !false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##180: assume false; [2019-10-22 08:58:09,640 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##181: assume !false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##137: assume false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##138: assume !false; [2019-10-22 08:58:09,641 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##393: assume false; [2019-10-22 08:58:09,642 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-22 08:58:09,642 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##394: assume !false; [2019-10-22 08:58:09,642 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-22 08:58:09,644 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##164: assume !false; [2019-10-22 08:58:09,644 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume false; [2019-10-22 08:58:09,644 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##329: assume false; [2019-10-22 08:58:09,644 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##330: assume !false; [2019-10-22 08:58:09,645 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##108: assume !false; [2019-10-22 08:58:09,645 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume false; [2019-10-22 08:58:09,645 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##364: assume !false; [2019-10-22 08:58:09,645 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##363: assume false; [2019-10-22 08:58:09,648 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:09,648 INFO L284 CfgBuilder]: Removed 207 assume(true) statements. [2019-10-22 08:58:09,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:09 BoogieIcfgContainer [2019-10-22 08:58:09,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:09,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:09,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:09,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:09,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:07" (1/3) ... [2019-10-22 08:58:09,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113ee26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:09, skipping insertion in model container [2019-10-22 08:58:09,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:08" (2/3) ... [2019-10-22 08:58:09,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@113ee26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:09, skipping insertion in model container [2019-10-22 08:58:09,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:09" (3/3) ... [2019-10-22 08:58:09,658 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-1.c [2019-10-22 08:58:09,667 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:09,675 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2019-10-22 08:58:09,685 INFO L249 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2019-10-22 08:58:09,714 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:09,719 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:09,719 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:09,719 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:09,719 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:09,719 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:09,720 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:09,720 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2019-10-22 08:58:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:58:09,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:09,757 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:09,760 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 660910296, now seen corresponding path program 1 times [2019-10-22 08:58:09,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:09,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216669011] [2019-10-22 08:58:09,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:09,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:09,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:09,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216669011] [2019-10-22 08:58:09,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:09,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:09,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173491513] [2019-10-22 08:58:09,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:09,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:09,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:09,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:09,933 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2019-10-22 08:58:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:10,056 INFO L93 Difference]: Finished difference Result 763 states and 1090 transitions. [2019-10-22 08:58:10,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:10,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-22 08:58:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:10,071 INFO L225 Difference]: With dead ends: 763 [2019-10-22 08:58:10,072 INFO L226 Difference]: Without dead ends: 416 [2019-10-22 08:58:10,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-10-22 08:58:10,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-10-22 08:58:10,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-22 08:58:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2019-10-22 08:58:10,148 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 11 [2019-10-22 08:58:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:10,148 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2019-10-22 08:58:10,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2019-10-22 08:58:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 08:58:10,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:10,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:10,155 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash -32433196, now seen corresponding path program 1 times [2019-10-22 08:58:10,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:10,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237397871] [2019-10-22 08:58:10,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237397871] [2019-10-22 08:58:10,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:10,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:10,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515739031] [2019-10-22 08:58:10,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:10,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:10,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:10,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,268 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand 3 states. [2019-10-22 08:58:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:10,562 INFO L93 Difference]: Finished difference Result 714 states and 941 transitions. [2019-10-22 08:58:10,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:10,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-22 08:58:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:10,566 INFO L225 Difference]: With dead ends: 714 [2019-10-22 08:58:10,566 INFO L226 Difference]: Without dead ends: 547 [2019-10-22 08:58:10,568 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-22 08:58:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521. [2019-10-22 08:58:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-22 08:58:10,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 697 transitions. [2019-10-22 08:58:10,614 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 697 transitions. Word has length 13 [2019-10-22 08:58:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:10,615 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 697 transitions. [2019-10-22 08:58:10,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 697 transitions. [2019-10-22 08:58:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:58:10,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:10,616 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:10,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash 563627937, now seen corresponding path program 1 times [2019-10-22 08:58:10,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:10,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869561727] [2019-10-22 08:58:10,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869561727] [2019-10-22 08:58:10,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:10,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:10,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044724119] [2019-10-22 08:58:10,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:10,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,715 INFO L87 Difference]: Start difference. First operand 521 states and 697 transitions. Second operand 3 states. [2019-10-22 08:58:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:10,781 INFO L93 Difference]: Finished difference Result 1000 states and 1335 transitions. [2019-10-22 08:58:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:10,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-22 08:58:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:10,786 INFO L225 Difference]: With dead ends: 1000 [2019-10-22 08:58:10,786 INFO L226 Difference]: Without dead ends: 690 [2019-10-22 08:58:10,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-22 08:58:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 519. [2019-10-22 08:58:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-22 08:58:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 696 transitions. [2019-10-22 08:58:10,832 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 696 transitions. Word has length 16 [2019-10-22 08:58:10,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:10,832 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 696 transitions. [2019-10-22 08:58:10,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 696 transitions. [2019-10-22 08:58:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:58:10,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:10,835 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:10,835 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:10,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash 6806604, now seen corresponding path program 1 times [2019-10-22 08:58:10,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:10,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792559320] [2019-10-22 08:58:10,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:10,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:10,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792559320] [2019-10-22 08:58:10,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:10,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:10,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194462703] [2019-10-22 08:58:10,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:10,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,917 INFO L87 Difference]: Start difference. First operand 519 states and 696 transitions. Second operand 3 states. [2019-10-22 08:58:10,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:10,968 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2019-10-22 08:58:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:10,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 08:58:10,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:10,971 INFO L225 Difference]: With dead ends: 601 [2019-10-22 08:58:10,972 INFO L226 Difference]: Without dead ends: 578 [2019-10-22 08:58:10,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-22 08:58:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 537. [2019-10-22 08:58:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-22 08:58:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 727 transitions. [2019-10-22 08:58:11,001 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 727 transitions. Word has length 19 [2019-10-22 08:58:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:11,001 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 727 transitions. [2019-10-22 08:58:11,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 727 transitions. [2019-10-22 08:58:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:58:11,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:11,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:11,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash -450647822, now seen corresponding path program 1 times [2019-10-22 08:58:11,004 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:11,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95228659] [2019-10-22 08:58:11,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:11,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95228659] [2019-10-22 08:58:11,040 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:11,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:11,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106462643] [2019-10-22 08:58:11,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:11,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:11,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:11,041 INFO L87 Difference]: Start difference. First operand 537 states and 727 transitions. Second operand 3 states. [2019-10-22 08:58:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:11,314 INFO L93 Difference]: Finished difference Result 732 states and 987 transitions. [2019-10-22 08:58:11,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:11,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 08:58:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:11,318 INFO L225 Difference]: With dead ends: 732 [2019-10-22 08:58:11,318 INFO L226 Difference]: Without dead ends: 724 [2019-10-22 08:58:11,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-10-22 08:58:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 555. [2019-10-22 08:58:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-22 08:58:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 754 transitions. [2019-10-22 08:58:11,343 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 754 transitions. Word has length 22 [2019-10-22 08:58:11,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:11,344 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 754 transitions. [2019-10-22 08:58:11,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 754 transitions. [2019-10-22 08:58:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:58:11,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:11,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:11,348 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash 364241657, now seen corresponding path program 1 times [2019-10-22 08:58:11,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:11,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364038367] [2019-10-22 08:58:11,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:11,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364038367] [2019-10-22 08:58:11,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:11,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:11,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704916453] [2019-10-22 08:58:11,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:11,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:11,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:11,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:11,397 INFO L87 Difference]: Start difference. First operand 555 states and 754 transitions. Second operand 3 states. [2019-10-22 08:58:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:11,576 INFO L93 Difference]: Finished difference Result 590 states and 798 transitions. [2019-10-22 08:58:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:11,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-22 08:58:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:11,579 INFO L225 Difference]: With dead ends: 590 [2019-10-22 08:58:11,579 INFO L226 Difference]: Without dead ends: 585 [2019-10-22 08:58:11,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-22 08:58:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2019-10-22 08:58:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-22 08:58:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 790 transitions. [2019-10-22 08:58:11,603 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 790 transitions. Word has length 22 [2019-10-22 08:58:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:11,603 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 790 transitions. [2019-10-22 08:58:11,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:11,603 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 790 transitions. [2019-10-22 08:58:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:11,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:11,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:11,608 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1092839096, now seen corresponding path program 1 times [2019-10-22 08:58:11,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:11,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828487203] [2019-10-22 08:58:11,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:11,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:11,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828487203] [2019-10-22 08:58:11,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:11,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:11,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585513669] [2019-10-22 08:58:11,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:11,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:11,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:11,665 INFO L87 Difference]: Start difference. First operand 582 states and 790 transitions. Second operand 7 states. [2019-10-22 08:58:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,155 INFO L93 Difference]: Finished difference Result 898 states and 1197 transitions. [2019-10-22 08:58:12,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:12,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-10-22 08:58:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,158 INFO L225 Difference]: With dead ends: 898 [2019-10-22 08:58:12,158 INFO L226 Difference]: Without dead ends: 637 [2019-10-22 08:58:12,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:58:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-22 08:58:12,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 565. [2019-10-22 08:58:12,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-22 08:58:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 754 transitions. [2019-10-22 08:58:12,183 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 754 transitions. Word has length 23 [2019-10-22 08:58:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,183 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 754 transitions. [2019-10-22 08:58:12,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 754 transitions. [2019-10-22 08:58:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:58:12,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,184 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,184 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1575831316, now seen corresponding path program 1 times [2019-10-22 08:58:12,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801573661] [2019-10-22 08:58:12,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,185 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801573661] [2019-10-22 08:58:12,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:12,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854828433] [2019-10-22 08:58:12,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:12,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:12,221 INFO L87 Difference]: Start difference. First operand 565 states and 754 transitions. Second operand 4 states. [2019-10-22 08:58:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,263 INFO L93 Difference]: Finished difference Result 578 states and 768 transitions. [2019-10-22 08:58:12,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:12,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-10-22 08:58:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,266 INFO L225 Difference]: With dead ends: 578 [2019-10-22 08:58:12,266 INFO L226 Difference]: Without dead ends: 563 [2019-10-22 08:58:12,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-22 08:58:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-22 08:58:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-22 08:58:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 751 transitions. [2019-10-22 08:58:12,288 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 751 transitions. Word has length 23 [2019-10-22 08:58:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,288 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 751 transitions. [2019-10-22 08:58:12,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 751 transitions. [2019-10-22 08:58:12,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:58:12,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,289 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,289 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1184010678, now seen corresponding path program 1 times [2019-10-22 08:58:12,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052392575] [2019-10-22 08:58:12,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052392575] [2019-10-22 08:58:12,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:12,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887807475] [2019-10-22 08:58:12,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:12,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:12,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:12,313 INFO L87 Difference]: Start difference. First operand 563 states and 751 transitions. Second operand 3 states. [2019-10-22 08:58:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,446 INFO L93 Difference]: Finished difference Result 563 states and 751 transitions. [2019-10-22 08:58:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:12,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 08:58:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,448 INFO L225 Difference]: With dead ends: 563 [2019-10-22 08:58:12,449 INFO L226 Difference]: Without dead ends: 551 [2019-10-22 08:58:12,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-22 08:58:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2019-10-22 08:58:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-22 08:58:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 738 transitions. [2019-10-22 08:58:12,470 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 738 transitions. Word has length 25 [2019-10-22 08:58:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,470 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 738 transitions. [2019-10-22 08:58:12,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 738 transitions. [2019-10-22 08:58:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:58:12,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,472 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -944626100, now seen corresponding path program 1 times [2019-10-22 08:58:12,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739472036] [2019-10-22 08:58:12,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739472036] [2019-10-22 08:58:12,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:12,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090366714] [2019-10-22 08:58:12,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:12,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:12,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:12,514 INFO L87 Difference]: Start difference. First operand 551 states and 738 transitions. Second operand 3 states. [2019-10-22 08:58:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,651 INFO L93 Difference]: Finished difference Result 759 states and 1016 transitions. [2019-10-22 08:58:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:12,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-22 08:58:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,653 INFO L225 Difference]: With dead ends: 759 [2019-10-22 08:58:12,653 INFO L226 Difference]: Without dead ends: 553 [2019-10-22 08:58:12,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-22 08:58:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-22 08:58:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-22 08:58:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 741 transitions. [2019-10-22 08:58:12,676 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 741 transitions. Word has length 28 [2019-10-22 08:58:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,676 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 741 transitions. [2019-10-22 08:58:12,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 741 transitions. [2019-10-22 08:58:12,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:58:12,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,678 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1312752221, now seen corresponding path program 1 times [2019-10-22 08:58:12,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015604366] [2019-10-22 08:58:12,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015604366] [2019-10-22 08:58:12,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:12,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961222032] [2019-10-22 08:58:12,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:12,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:12,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:12,719 INFO L87 Difference]: Start difference. First operand 553 states and 741 transitions. Second operand 3 states. [2019-10-22 08:58:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:12,769 INFO L93 Difference]: Finished difference Result 733 states and 975 transitions. [2019-10-22 08:58:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:12,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 08:58:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:12,773 INFO L225 Difference]: With dead ends: 733 [2019-10-22 08:58:12,773 INFO L226 Difference]: Without dead ends: 529 [2019-10-22 08:58:12,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-10-22 08:58:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 513. [2019-10-22 08:58:12,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-10-22 08:58:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 683 transitions. [2019-10-22 08:58:12,801 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 683 transitions. Word has length 29 [2019-10-22 08:58:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:12,803 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 683 transitions. [2019-10-22 08:58:12,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 683 transitions. [2019-10-22 08:58:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:58:12,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:12,806 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:12,807 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:12,807 INFO L82 PathProgramCache]: Analyzing trace with hash 259846608, now seen corresponding path program 1 times [2019-10-22 08:58:12,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:12,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536798968] [2019-10-22 08:58:12,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:12,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:12,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536798968] [2019-10-22 08:58:12,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:12,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:12,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987969402] [2019-10-22 08:58:12,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:12,880 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:12,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:12,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:12,881 INFO L87 Difference]: Start difference. First operand 513 states and 683 transitions. Second operand 5 states. [2019-10-22 08:58:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,239 INFO L93 Difference]: Finished difference Result 1324 states and 1762 transitions. [2019-10-22 08:58:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:13,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 08:58:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,242 INFO L225 Difference]: With dead ends: 1324 [2019-10-22 08:58:13,243 INFO L226 Difference]: Without dead ends: 1052 [2019-10-22 08:58:13,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-22 08:58:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 552. [2019-10-22 08:58:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-22 08:58:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 741 transitions. [2019-10-22 08:58:13,271 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 741 transitions. Word has length 32 [2019-10-22 08:58:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,272 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 741 transitions. [2019-10-22 08:58:13,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 741 transitions. [2019-10-22 08:58:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:58:13,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,273 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,273 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,274 INFO L82 PathProgramCache]: Analyzing trace with hash 255000751, now seen corresponding path program 1 times [2019-10-22 08:58:13,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056006711] [2019-10-22 08:58:13,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056006711] [2019-10-22 08:58:13,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:13,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611655340] [2019-10-22 08:58:13,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:13,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:13,312 INFO L87 Difference]: Start difference. First operand 552 states and 741 transitions. Second operand 5 states. [2019-10-22 08:58:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,379 INFO L93 Difference]: Finished difference Result 572 states and 763 transitions. [2019-10-22 08:58:13,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:13,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 08:58:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,381 INFO L225 Difference]: With dead ends: 572 [2019-10-22 08:58:13,381 INFO L226 Difference]: Without dead ends: 555 [2019-10-22 08:58:13,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-22 08:58:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 552. [2019-10-22 08:58:13,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-10-22 08:58:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 740 transitions. [2019-10-22 08:58:13,405 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 740 transitions. Word has length 32 [2019-10-22 08:58:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,406 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 740 transitions. [2019-10-22 08:58:13,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 740 transitions. [2019-10-22 08:58:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:58:13,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,407 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,407 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 175699761, now seen corresponding path program 1 times [2019-10-22 08:58:13,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774496897] [2019-10-22 08:58:13,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774496897] [2019-10-22 08:58:13,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:13,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54169122] [2019-10-22 08:58:13,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:13,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:13,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:13,438 INFO L87 Difference]: Start difference. First operand 552 states and 740 transitions. Second operand 3 states. [2019-10-22 08:58:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,481 INFO L93 Difference]: Finished difference Result 812 states and 1079 transitions. [2019-10-22 08:58:13,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:13,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 08:58:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,483 INFO L225 Difference]: With dead ends: 812 [2019-10-22 08:58:13,483 INFO L226 Difference]: Without dead ends: 613 [2019-10-22 08:58:13,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-22 08:58:13,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 540. [2019-10-22 08:58:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:58:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2019-10-22 08:58:13,508 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 33 [2019-10-22 08:58:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,508 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2019-10-22 08:58:13,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2019-10-22 08:58:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:58:13,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,509 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,510 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -744399452, now seen corresponding path program 1 times [2019-10-22 08:58:13,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83216430] [2019-10-22 08:58:13,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83216430] [2019-10-22 08:58:13,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:13,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88243537] [2019-10-22 08:58:13,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:13,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:13,539 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2019-10-22 08:58:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,684 INFO L93 Difference]: Finished difference Result 716 states and 944 transitions. [2019-10-22 08:58:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:13,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 08:58:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,686 INFO L225 Difference]: With dead ends: 716 [2019-10-22 08:58:13,687 INFO L226 Difference]: Without dead ends: 703 [2019-10-22 08:58:13,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-10-22 08:58:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 587. [2019-10-22 08:58:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-22 08:58:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 779 transitions. [2019-10-22 08:58:13,719 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 779 transitions. Word has length 33 [2019-10-22 08:58:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,719 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 779 transitions. [2019-10-22 08:58:13,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 779 transitions. [2019-10-22 08:58:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:58:13,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,722 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1784201236, now seen corresponding path program 1 times [2019-10-22 08:58:13,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546104945] [2019-10-22 08:58:13,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546104945] [2019-10-22 08:58:13,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:13,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712194865] [2019-10-22 08:58:13,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:13,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:13,755 INFO L87 Difference]: Start difference. First operand 587 states and 779 transitions. Second operand 3 states. [2019-10-22 08:58:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:13,792 INFO L93 Difference]: Finished difference Result 625 states and 824 transitions. [2019-10-22 08:58:13,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:13,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 08:58:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:13,794 INFO L225 Difference]: With dead ends: 625 [2019-10-22 08:58:13,794 INFO L226 Difference]: Without dead ends: 581 [2019-10-22 08:58:13,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-22 08:58:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2019-10-22 08:58:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-22 08:58:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 758 transitions. [2019-10-22 08:58:13,825 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 758 transitions. Word has length 34 [2019-10-22 08:58:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:13,825 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 758 transitions. [2019-10-22 08:58:13,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 758 transitions. [2019-10-22 08:58:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:58:13,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:13,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:13,827 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1583955411, now seen corresponding path program 1 times [2019-10-22 08:58:13,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:13,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539620868] [2019-10-22 08:58:13,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:13,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:13,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539620868] [2019-10-22 08:58:13,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:13,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:13,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546672054] [2019-10-22 08:58:13,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:13,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:13,872 INFO L87 Difference]: Start difference. First operand 577 states and 758 transitions. Second operand 5 states. [2019-10-22 08:58:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,172 INFO L93 Difference]: Finished difference Result 601 states and 778 transitions. [2019-10-22 08:58:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:14,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-22 08:58:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,174 INFO L225 Difference]: With dead ends: 601 [2019-10-22 08:58:14,174 INFO L226 Difference]: Without dead ends: 589 [2019-10-22 08:58:14,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-22 08:58:14,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2019-10-22 08:58:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-22 08:58:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 756 transitions. [2019-10-22 08:58:14,204 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 756 transitions. Word has length 34 [2019-10-22 08:58:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,204 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 756 transitions. [2019-10-22 08:58:14,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 756 transitions. [2019-10-22 08:58:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:58:14,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,205 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1675490409, now seen corresponding path program 1 times [2019-10-22 08:58:14,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933588253] [2019-10-22 08:58:14,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933588253] [2019-10-22 08:58:14,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:14,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618013752] [2019-10-22 08:58:14,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:14,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:14,227 INFO L87 Difference]: Start difference. First operand 577 states and 756 transitions. Second operand 3 states. [2019-10-22 08:58:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,277 INFO L93 Difference]: Finished difference Result 820 states and 1058 transitions. [2019-10-22 08:58:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:14,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 08:58:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,280 INFO L225 Difference]: With dead ends: 820 [2019-10-22 08:58:14,280 INFO L226 Difference]: Without dead ends: 699 [2019-10-22 08:58:14,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-22 08:58:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 578. [2019-10-22 08:58:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-22 08:58:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 757 transitions. [2019-10-22 08:58:14,311 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 757 transitions. Word has length 34 [2019-10-22 08:58:14,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,311 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 757 transitions. [2019-10-22 08:58:14,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 757 transitions. [2019-10-22 08:58:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:58:14,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,312 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -930533145, now seen corresponding path program 1 times [2019-10-22 08:58:14,313 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240176132] [2019-10-22 08:58:14,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240176132] [2019-10-22 08:58:14,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:14,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851281543] [2019-10-22 08:58:14,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:14,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:14,356 INFO L87 Difference]: Start difference. First operand 578 states and 757 transitions. Second operand 4 states. [2019-10-22 08:58:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,431 INFO L93 Difference]: Finished difference Result 1366 states and 1768 transitions. [2019-10-22 08:58:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:14,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-22 08:58:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,434 INFO L225 Difference]: With dead ends: 1366 [2019-10-22 08:58:14,434 INFO L226 Difference]: Without dead ends: 797 [2019-10-22 08:58:14,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:14,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-22 08:58:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 670. [2019-10-22 08:58:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-22 08:58:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 871 transitions. [2019-10-22 08:58:14,475 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 871 transitions. Word has length 34 [2019-10-22 08:58:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,475 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 871 transitions. [2019-10-22 08:58:14,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 871 transitions. [2019-10-22 08:58:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:58:14,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,476 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,477 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,477 INFO L82 PathProgramCache]: Analyzing trace with hash -992572759, now seen corresponding path program 1 times [2019-10-22 08:58:14,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719897731] [2019-10-22 08:58:14,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719897731] [2019-10-22 08:58:14,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:14,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011813980] [2019-10-22 08:58:14,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:14,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:14,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:14,574 INFO L87 Difference]: Start difference. First operand 670 states and 871 transitions. Second operand 4 states. [2019-10-22 08:58:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,673 INFO L93 Difference]: Finished difference Result 859 states and 1114 transitions. [2019-10-22 08:58:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:14,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-22 08:58:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:14,676 INFO L225 Difference]: With dead ends: 859 [2019-10-22 08:58:14,676 INFO L226 Difference]: Without dead ends: 640 [2019-10-22 08:58:14,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-22 08:58:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 635. [2019-10-22 08:58:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-22 08:58:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 820 transitions. [2019-10-22 08:58:14,732 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 820 transitions. Word has length 34 [2019-10-22 08:58:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:14,732 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 820 transitions. [2019-10-22 08:58:14,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:14,761 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 820 transitions. [2019-10-22 08:58:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:58:14,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:14,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:14,762 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:14,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:14,763 INFO L82 PathProgramCache]: Analyzing trace with hash -19558115, now seen corresponding path program 1 times [2019-10-22 08:58:14,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:14,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965082767] [2019-10-22 08:58:14,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:14,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:14,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965082767] [2019-10-22 08:58:14,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:14,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:14,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009607581] [2019-10-22 08:58:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:14,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:14,807 INFO L87 Difference]: Start difference. First operand 635 states and 820 transitions. Second operand 4 states. [2019-10-22 08:58:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:14,998 INFO L93 Difference]: Finished difference Result 647 states and 830 transitions. [2019-10-22 08:58:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:14,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 08:58:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,000 INFO L225 Difference]: With dead ends: 647 [2019-10-22 08:58:15,001 INFO L226 Difference]: Without dead ends: 580 [2019-10-22 08:58:15,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-22 08:58:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-22 08:58:15,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-22 08:58:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 741 transitions. [2019-10-22 08:58:15,041 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 741 transitions. Word has length 35 [2019-10-22 08:58:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,041 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 741 transitions. [2019-10-22 08:58:15,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 741 transitions. [2019-10-22 08:58:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:58:15,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,043 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,043 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,043 INFO L82 PathProgramCache]: Analyzing trace with hash 813687739, now seen corresponding path program 1 times [2019-10-22 08:58:15,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111038504] [2019-10-22 08:58:15,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:15,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111038504] [2019-10-22 08:58:15,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:15,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567574080] [2019-10-22 08:58:15,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:15,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:15,085 INFO L87 Difference]: Start difference. First operand 580 states and 741 transitions. Second operand 4 states. [2019-10-22 08:58:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,234 INFO L93 Difference]: Finished difference Result 653 states and 823 transitions. [2019-10-22 08:58:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:15,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 08:58:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,237 INFO L225 Difference]: With dead ends: 653 [2019-10-22 08:58:15,237 INFO L226 Difference]: Without dead ends: 564 [2019-10-22 08:58:15,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-22 08:58:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 546. [2019-10-22 08:58:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-22 08:58:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 684 transitions. [2019-10-22 08:58:15,274 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 684 transitions. Word has length 35 [2019-10-22 08:58:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,275 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 684 transitions. [2019-10-22 08:58:15,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 684 transitions. [2019-10-22 08:58:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:58:15,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,276 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash -759040003, now seen corresponding path program 1 times [2019-10-22 08:58:15,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025791073] [2019-10-22 08:58:15,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:15,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025791073] [2019-10-22 08:58:15,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:15,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293410535] [2019-10-22 08:58:15,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:15,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:15,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,316 INFO L87 Difference]: Start difference. First operand 546 states and 684 transitions. Second operand 3 states. [2019-10-22 08:58:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,428 INFO L93 Difference]: Finished difference Result 569 states and 703 transitions. [2019-10-22 08:58:15,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:15,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-22 08:58:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,430 INFO L225 Difference]: With dead ends: 569 [2019-10-22 08:58:15,430 INFO L226 Difference]: Without dead ends: 549 [2019-10-22 08:58:15,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-22 08:58:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 540. [2019-10-22 08:58:15,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-22 08:58:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 673 transitions. [2019-10-22 08:58:15,470 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 673 transitions. Word has length 35 [2019-10-22 08:58:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,470 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 673 transitions. [2019-10-22 08:58:15,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:15,470 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 673 transitions. [2019-10-22 08:58:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:58:15,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,471 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,471 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 111409610, now seen corresponding path program 1 times [2019-10-22 08:58:15,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317933105] [2019-10-22 08:58:15,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:15,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317933105] [2019-10-22 08:58:15,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:15,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881953602] [2019-10-22 08:58:15,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:15,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:15,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:15,511 INFO L87 Difference]: Start difference. First operand 540 states and 673 transitions. Second operand 4 states. [2019-10-22 08:58:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,668 INFO L93 Difference]: Finished difference Result 721 states and 907 transitions. [2019-10-22 08:58:15,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:15,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 08:58:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,670 INFO L225 Difference]: With dead ends: 721 [2019-10-22 08:58:15,670 INFO L226 Difference]: Without dead ends: 537 [2019-10-22 08:58:15,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-22 08:58:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2019-10-22 08:58:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-22 08:58:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 664 transitions. [2019-10-22 08:58:15,712 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 664 transitions. Word has length 35 [2019-10-22 08:58:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,712 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 664 transitions. [2019-10-22 08:58:15,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 664 transitions. [2019-10-22 08:58:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:58:15,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,714 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2063815052, now seen corresponding path program 1 times [2019-10-22 08:58:15,715 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,715 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358021773] [2019-10-22 08:58:15,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,715 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:15,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358021773] [2019-10-22 08:58:15,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:15,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:15,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128957933] [2019-10-22 08:58:15,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:15,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:15,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:15,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:15,744 INFO L87 Difference]: Start difference. First operand 537 states and 664 transitions. Second operand 4 states. [2019-10-22 08:58:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:15,890 INFO L93 Difference]: Finished difference Result 550 states and 674 transitions. [2019-10-22 08:58:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:15,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 08:58:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:15,892 INFO L225 Difference]: With dead ends: 550 [2019-10-22 08:58:15,892 INFO L226 Difference]: Without dead ends: 541 [2019-10-22 08:58:15,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-22 08:58:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 537. [2019-10-22 08:58:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-22 08:58:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 662 transitions. [2019-10-22 08:58:15,934 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 662 transitions. Word has length 36 [2019-10-22 08:58:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:15,934 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 662 transitions. [2019-10-22 08:58:15,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 662 transitions. [2019-10-22 08:58:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:58:15,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:15,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:15,935 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:15,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2037812492, now seen corresponding path program 1 times [2019-10-22 08:58:15,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:15,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525970810] [2019-10-22 08:58:15,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:15,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:16,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525970810] [2019-10-22 08:58:16,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:16,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104736895] [2019-10-22 08:58:16,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:16,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:16,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:16,014 INFO L87 Difference]: Start difference. First operand 537 states and 662 transitions. Second operand 7 states. [2019-10-22 08:58:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,387 INFO L93 Difference]: Finished difference Result 784 states and 953 transitions. [2019-10-22 08:58:16,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:58:16,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-10-22 08:58:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,389 INFO L225 Difference]: With dead ends: 784 [2019-10-22 08:58:16,390 INFO L226 Difference]: Without dead ends: 764 [2019-10-22 08:58:16,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:58:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-10-22 08:58:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 536. [2019-10-22 08:58:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-10-22 08:58:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 660 transitions. [2019-10-22 08:58:16,450 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 660 transitions. Word has length 36 [2019-10-22 08:58:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,450 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 660 transitions. [2019-10-22 08:58:16,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 660 transitions. [2019-10-22 08:58:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:58:16,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,451 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,451 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,451 INFO L82 PathProgramCache]: Analyzing trace with hash -463076180, now seen corresponding path program 1 times [2019-10-22 08:58:16,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903430316] [2019-10-22 08:58:16,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:16,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903430316] [2019-10-22 08:58:16,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:16,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481599149] [2019-10-22 08:58:16,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:16,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:16,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:16,483 INFO L87 Difference]: Start difference. First operand 536 states and 660 transitions. Second operand 4 states. [2019-10-22 08:58:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:16,631 INFO L93 Difference]: Finished difference Result 549 states and 670 transitions. [2019-10-22 08:58:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:16,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-22 08:58:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:16,634 INFO L225 Difference]: With dead ends: 549 [2019-10-22 08:58:16,634 INFO L226 Difference]: Without dead ends: 540 [2019-10-22 08:58:16,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-22 08:58:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 536. [2019-10-22 08:58:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-10-22 08:58:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 658 transitions. [2019-10-22 08:58:16,684 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 658 transitions. Word has length 37 [2019-10-22 08:58:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:16,684 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 658 transitions. [2019-10-22 08:58:16,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:16,685 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 658 transitions. [2019-10-22 08:58:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:58:16,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:16,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:16,687 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:16,687 INFO L82 PathProgramCache]: Analyzing trace with hash -187254176, now seen corresponding path program 1 times [2019-10-22 08:58:16,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:16,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72018001] [2019-10-22 08:58:16,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:16,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:16,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72018001] [2019-10-22 08:58:16,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:16,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:16,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448537020] [2019-10-22 08:58:16,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:58:16,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:16,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:16,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:16,756 INFO L87 Difference]: Start difference. First operand 536 states and 658 transitions. Second operand 6 states. [2019-10-22 08:58:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,013 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2019-10-22 08:58:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:17,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-10-22 08:58:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,015 INFO L225 Difference]: With dead ends: 554 [2019-10-22 08:58:17,016 INFO L226 Difference]: Without dead ends: 551 [2019-10-22 08:58:17,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:58:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2019-10-22 08:58:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 542. [2019-10-22 08:58:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-22 08:58:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 664 transitions. [2019-10-22 08:58:17,061 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 664 transitions. Word has length 37 [2019-10-22 08:58:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:17,061 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 664 transitions. [2019-10-22 08:58:17,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:58:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 664 transitions. [2019-10-22 08:58:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:58:17,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:17,062 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:17,062 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:17,063 INFO L82 PathProgramCache]: Analyzing trace with hash -187266092, now seen corresponding path program 1 times [2019-10-22 08:58:17,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:17,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954289751] [2019-10-22 08:58:17,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:17,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:17,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954289751] [2019-10-22 08:58:17,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:17,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:58:17,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373475036] [2019-10-22 08:58:17,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:58:17,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:17,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:58:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:58:17,157 INFO L87 Difference]: Start difference. First operand 542 states and 664 transitions. Second operand 10 states. [2019-10-22 08:58:17,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:17,975 INFO L93 Difference]: Finished difference Result 820 states and 999 transitions. [2019-10-22 08:58:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:17,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-10-22 08:58:17,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:17,978 INFO L225 Difference]: With dead ends: 820 [2019-10-22 08:58:17,978 INFO L226 Difference]: Without dead ends: 803 [2019-10-22 08:58:17,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:58:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2019-10-22 08:58:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 595. [2019-10-22 08:58:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-22 08:58:18,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 721 transitions. [2019-10-22 08:58:18,032 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 721 transitions. Word has length 37 [2019-10-22 08:58:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,033 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 721 transitions. [2019-10-22 08:58:18,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:58:18,033 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 721 transitions. [2019-10-22 08:58:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:58:18,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,034 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,034 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1498284948, now seen corresponding path program 1 times [2019-10-22 08:58:18,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501958252] [2019-10-22 08:58:18,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:18,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501958252] [2019-10-22 08:58:18,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:18,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:18,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809470765] [2019-10-22 08:58:18,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:18,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:18,068 INFO L87 Difference]: Start difference. First operand 595 states and 721 transitions. Second operand 5 states. [2019-10-22 08:58:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:18,258 INFO L93 Difference]: Finished difference Result 604 states and 728 transitions. [2019-10-22 08:58:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:18,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-10-22 08:58:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:18,260 INFO L225 Difference]: With dead ends: 604 [2019-10-22 08:58:18,260 INFO L226 Difference]: Without dead ends: 581 [2019-10-22 08:58:18,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-22 08:58:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 523. [2019-10-22 08:58:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-22 08:58:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 642 transitions. [2019-10-22 08:58:18,315 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 642 transitions. Word has length 37 [2019-10-22 08:58:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,315 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 642 transitions. [2019-10-22 08:58:18,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 642 transitions. [2019-10-22 08:58:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:58:18,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,317 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,317 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1481841291, now seen corresponding path program 1 times [2019-10-22 08:58:18,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385413442] [2019-10-22 08:58:18,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:18,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385413442] [2019-10-22 08:58:18,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:18,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:18,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524287187] [2019-10-22 08:58:18,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:18,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:18,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:18,357 INFO L87 Difference]: Start difference. First operand 523 states and 642 transitions. Second operand 4 states. [2019-10-22 08:58:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:18,436 INFO L93 Difference]: Finished difference Result 541 states and 658 transitions. [2019-10-22 08:58:18,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:18,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-22 08:58:18,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:18,438 INFO L225 Difference]: With dead ends: 541 [2019-10-22 08:58:18,438 INFO L226 Difference]: Without dead ends: 520 [2019-10-22 08:58:18,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-10-22 08:58:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 506. [2019-10-22 08:58:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-22 08:58:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 622 transitions. [2019-10-22 08:58:18,499 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 622 transitions. Word has length 38 [2019-10-22 08:58:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,499 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 622 transitions. [2019-10-22 08:58:18,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 622 transitions. [2019-10-22 08:58:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:58:18,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,501 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1021756590, now seen corresponding path program 1 times [2019-10-22 08:58:18,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288082064] [2019-10-22 08:58:18,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:18,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288082064] [2019-10-22 08:58:18,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:18,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:18,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642570380] [2019-10-22 08:58:18,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:18,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:18,526 INFO L87 Difference]: Start difference. First operand 506 states and 622 transitions. Second operand 3 states. [2019-10-22 08:58:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:18,696 INFO L93 Difference]: Finished difference Result 870 states and 1065 transitions. [2019-10-22 08:58:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:18,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-22 08:58:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:18,698 INFO L225 Difference]: With dead ends: 870 [2019-10-22 08:58:18,699 INFO L226 Difference]: Without dead ends: 689 [2019-10-22 08:58:18,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-22 08:58:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 509. [2019-10-22 08:58:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-22 08:58:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 625 transitions. [2019-10-22 08:58:18,745 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 625 transitions. Word has length 38 [2019-10-22 08:58:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:18,745 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 625 transitions. [2019-10-22 08:58:18,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 625 transitions. [2019-10-22 08:58:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:58:18,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:18,746 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,746 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1329794158, now seen corresponding path program 1 times [2019-10-22 08:58:18,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056104662] [2019-10-22 08:58:18,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:18,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056104662] [2019-10-22 08:58:18,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:18,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:18,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450458971] [2019-10-22 08:58:18,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:18,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:18,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:18,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:18,787 INFO L87 Difference]: Start difference. First operand 509 states and 625 transitions. Second operand 5 states. [2019-10-22 08:58:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:18,998 INFO L93 Difference]: Finished difference Result 855 states and 1033 transitions. [2019-10-22 08:58:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:18,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-22 08:58:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:19,000 INFO L225 Difference]: With dead ends: 855 [2019-10-22 08:58:19,001 INFO L226 Difference]: Without dead ends: 699 [2019-10-22 08:58:19,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-22 08:58:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 509. [2019-10-22 08:58:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-22 08:58:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 621 transitions. [2019-10-22 08:58:19,053 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 621 transitions. Word has length 38 [2019-10-22 08:58:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:19,054 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 621 transitions. [2019-10-22 08:58:19,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 621 transitions. [2019-10-22 08:58:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:58:19,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:19,055 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,055 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 595887759, now seen corresponding path program 1 times [2019-10-22 08:58:19,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062465900] [2019-10-22 08:58:19,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:19,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062465900] [2019-10-22 08:58:19,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:19,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:19,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258505749] [2019-10-22 08:58:19,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:19,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:19,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:19,113 INFO L87 Difference]: Start difference. First operand 509 states and 621 transitions. Second operand 5 states. [2019-10-22 08:58:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:19,386 INFO L93 Difference]: Finished difference Result 977 states and 1195 transitions. [2019-10-22 08:58:19,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:19,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-22 08:58:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:19,389 INFO L225 Difference]: With dead ends: 977 [2019-10-22 08:58:19,389 INFO L226 Difference]: Without dead ends: 847 [2019-10-22 08:58:19,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-10-22 08:58:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 509. [2019-10-22 08:58:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-22 08:58:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 620 transitions. [2019-10-22 08:58:19,442 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 620 transitions. Word has length 41 [2019-10-22 08:58:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:19,442 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 620 transitions. [2019-10-22 08:58:19,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 620 transitions. [2019-10-22 08:58:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:58:19,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:19,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,443 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 768333102, now seen corresponding path program 1 times [2019-10-22 08:58:19,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507816189] [2019-10-22 08:58:19,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:19,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507816189] [2019-10-22 08:58:19,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:19,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:19,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232875851] [2019-10-22 08:58:19,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:19,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:19,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:19,483 INFO L87 Difference]: Start difference. First operand 509 states and 620 transitions. Second operand 7 states. [2019-10-22 08:58:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:19,707 INFO L93 Difference]: Finished difference Result 527 states and 637 transitions. [2019-10-22 08:58:19,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:19,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-10-22 08:58:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:19,709 INFO L225 Difference]: With dead ends: 527 [2019-10-22 08:58:19,709 INFO L226 Difference]: Without dead ends: 385 [2019-10-22 08:58:19,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:58:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-22 08:58:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2019-10-22 08:58:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-22 08:58:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 446 transitions. [2019-10-22 08:58:19,749 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 446 transitions. Word has length 41 [2019-10-22 08:58:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:19,749 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 446 transitions. [2019-10-22 08:58:19,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 446 transitions. [2019-10-22 08:58:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:58:19,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:19,750 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,750 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1022149612, now seen corresponding path program 1 times [2019-10-22 08:58:19,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782423890] [2019-10-22 08:58:19,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:19,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782423890] [2019-10-22 08:58:19,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:19,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:19,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129462351] [2019-10-22 08:58:19,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:19,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:19,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:19,782 INFO L87 Difference]: Start difference. First operand 367 states and 446 transitions. Second operand 3 states. [2019-10-22 08:58:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:19,875 INFO L93 Difference]: Finished difference Result 500 states and 615 transitions. [2019-10-22 08:58:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:19,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 08:58:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:19,877 INFO L225 Difference]: With dead ends: 500 [2019-10-22 08:58:19,877 INFO L226 Difference]: Without dead ends: 329 [2019-10-22 08:58:19,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-10-22 08:58:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2019-10-22 08:58:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 08:58:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 397 transitions. [2019-10-22 08:58:19,909 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 397 transitions. Word has length 45 [2019-10-22 08:58:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:19,909 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 397 transitions. [2019-10-22 08:58:19,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 397 transitions. [2019-10-22 08:58:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 08:58:19,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:19,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,910 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 632304062, now seen corresponding path program 1 times [2019-10-22 08:58:19,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554273172] [2019-10-22 08:58:19,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:19,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554273172] [2019-10-22 08:58:19,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:19,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:19,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249987014] [2019-10-22 08:58:19,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:19,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:19,955 INFO L87 Difference]: Start difference. First operand 329 states and 397 transitions. Second operand 7 states. [2019-10-22 08:58:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:20,167 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2019-10-22 08:58:20,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:58:20,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-22 08:58:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:20,169 INFO L225 Difference]: With dead ends: 459 [2019-10-22 08:58:20,169 INFO L226 Difference]: Without dead ends: 441 [2019-10-22 08:58:20,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:58:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-22 08:58:20,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 335. [2019-10-22 08:58:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-22 08:58:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 403 transitions. [2019-10-22 08:58:20,208 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 403 transitions. Word has length 51 [2019-10-22 08:58:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:20,208 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 403 transitions. [2019-10-22 08:58:20,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 403 transitions. [2019-10-22 08:58:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-22 08:58:20,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:20,209 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,209 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash -605199811, now seen corresponding path program 1 times [2019-10-22 08:58:20,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657920687] [2019-10-22 08:58:20,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657920687] [2019-10-22 08:58:20,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:20,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:20,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128974117] [2019-10-22 08:58:20,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:20,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:20,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:20,253 INFO L87 Difference]: Start difference. First operand 335 states and 403 transitions. Second operand 7 states. [2019-10-22 08:58:20,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:20,480 INFO L93 Difference]: Finished difference Result 464 states and 551 transitions. [2019-10-22 08:58:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:20,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-22 08:58:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:20,482 INFO L225 Difference]: With dead ends: 464 [2019-10-22 08:58:20,482 INFO L226 Difference]: Without dead ends: 446 [2019-10-22 08:58:20,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:58:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-22 08:58:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 329. [2019-10-22 08:58:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 08:58:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 396 transitions. [2019-10-22 08:58:20,518 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 396 transitions. Word has length 52 [2019-10-22 08:58:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:20,518 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 396 transitions. [2019-10-22 08:58:20,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 396 transitions. [2019-10-22 08:58:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-22 08:58:20,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:20,519 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,520 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1054423066, now seen corresponding path program 1 times [2019-10-22 08:58:20,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162517655] [2019-10-22 08:58:20,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:20,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162517655] [2019-10-22 08:58:20,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:20,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:20,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487189397] [2019-10-22 08:58:20,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:20,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:20,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:20,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:20,541 INFO L87 Difference]: Start difference. First operand 329 states and 396 transitions. Second operand 3 states. [2019-10-22 08:58:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:20,597 INFO L93 Difference]: Finished difference Result 575 states and 698 transitions. [2019-10-22 08:58:20,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:58:20,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-22 08:58:20,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:20,599 INFO L225 Difference]: With dead ends: 575 [2019-10-22 08:58:20,599 INFO L226 Difference]: Without dead ends: 383 [2019-10-22 08:58:20,599 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-22 08:58:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 329. [2019-10-22 08:58:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-22 08:58:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 392 transitions. [2019-10-22 08:58:20,635 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 392 transitions. Word has length 54 [2019-10-22 08:58:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:20,636 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 392 transitions. [2019-10-22 08:58:20,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:58:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 392 transitions. [2019-10-22 08:58:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-22 08:58:20,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:20,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:20,637 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:20,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash 273758220, now seen corresponding path program 1 times [2019-10-22 08:58:20,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:20,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864024724] [2019-10-22 08:58:20,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:20,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:20,700 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:20,700 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:58:20,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:20 BoogieIcfgContainer [2019-10-22 08:58:20,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:20,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:20,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:20,779 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:20,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:09" (3/4) ... [2019-10-22 08:58:20,781 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:58:20,924 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_72c8e7cb-aed7-476d-8a47-4ff6fc57d914/bin/uautomizer/witness.graphml [2019-10-22 08:58:20,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:20,929 INFO L168 Benchmark]: Toolchain (without parser) took 13258.89 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 656.9 MB). Free memory was 947.2 MB in the beginning and 1.5 GB in the end (delta: -515.6 MB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,930 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:20,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 559.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.37 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,931 INFO L168 Benchmark]: Boogie Preprocessor took 87.62 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.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,931 INFO L168 Benchmark]: RCFGBuilder took 1211.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.9 MB in the end (delta: 143.8 MB). Peak memory consumption was 143.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,932 INFO L168 Benchmark]: TraceAbstraction took 11128.01 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 537.9 MB). Free memory was 944.9 MB in the beginning and 1.5 GB in the end (delta: -540.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:20,932 INFO L168 Benchmark]: Witness Printer took 149.00 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:20,933 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 559.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.37 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.62 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.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1211.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 944.9 MB in the end (delta: 143.8 MB). Peak memory consumption was 143.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11128.01 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 537.9 MB). Free memory was 944.9 MB in the beginning and 1.5 GB in the end (delta: -540.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 149.00 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 64]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L35] int FloppyThread ; [L36] int KernelMode ; [L37] int Suspended ; [L38] int Executive ; [L39] int DiskController ; [L40] int FloppyDiskPeripheral ; [L41] int FlConfigCallBack ; [L42] int MaximumInterfaceType ; [L43] int MOUNTDEV_MOUNTED_DEVICE_GUID ; [L44] int myStatus ; [L45] int s ; [L46] int UNLOADED ; [L47] int NP ; [L48] int DC ; [L49] int SKIP1 ; [L50] int SKIP2 ; [L51] int MPR1 ; [L52] int MPR3 ; [L53] int IPC ; [L54] int pended ; [L55] int compRegistered ; [L56] int lowerDriverReturn ; [L57] int setEventCalled ; [L58] int customIrp ; [L90] int PagingReferenceCount = 0; [L91] int PagingMutex = 0; VAL [compRegistered=0, customIrp=0, DC=0, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=0, MPR3=0, myStatus=0, NP=0, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L670] int status ; [L671] int irp = __VERIFIER_nondet_int() ; [L672] int pirp ; [L673] int pirp__IoStatus__Status ; [L674] int irp_choice = __VERIFIER_nondet_int() ; [L675] int devobj = __VERIFIER_nondet_int() ; [L676] int __cil_tmp8 ; [L678] FloppyThread = 0 [L679] KernelMode = 0 [L680] Suspended = 0 [L681] Executive = 0 [L682] DiskController = 0 [L683] FloppyDiskPeripheral = 0 [L684] FlConfigCallBack = 0 [L685] MaximumInterfaceType = 0 [L686] MOUNTDEV_MOUNTED_DEVICE_GUID = 0 [L687] myStatus = 0 [L688] s = 0 [L689] UNLOADED = 0 [L690] NP = 0 [L691] DC = 0 [L692] SKIP1 = 0 [L693] SKIP2 = 0 [L694] MPR1 = 0 [L695] MPR3 = 0 [L696] IPC = 0 [L697] pended = 0 [L698] compRegistered = 0 [L699] lowerDriverReturn = 0 [L700] setEventCalled = 0 [L701] customIrp = 0 [L705] status = 0 [L706] pirp = irp [L73] UNLOADED = 0 [L74] NP = 1 [L75] DC = 2 [L76] SKIP1 = 3 [L77] SKIP2 = 4 [L78] MPR1 = 5 [L79] MPR3 = 6 [L80] IPC = 7 [L81] s = UNLOADED [L82] pended = 0 [L83] compRegistered = 0 [L84] lowerDriverReturn = 0 [L85] setEventCalled = 0 [L86] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L709] COND TRUE status >= 0 [L710] s = NP [L711] customIrp = 0 [L712] setEventCalled = customIrp [L713] lowerDriverReturn = setEventCalled [L714] compRegistered = lowerDriverReturn [L715] pended = compRegistered [L716] pirp__IoStatus__Status = 0 [L717] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L718] COND TRUE irp_choice == 0 [L719] pirp__IoStatus__Status = -1073741637 [L720] myStatus = -1073741637 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L660] s = NP [L661] pended = 0 [L662] compRegistered = 0 [L663] lowerDriverReturn = 0 [L664] setEventCalled = 0 [L665] customIrp = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L726] COND FALSE !(status < 0) [L730] int tmp_ndt_1; [L731] tmp_ndt_1 = __VERIFIER_nondet_int() [L732] COND TRUE tmp_ndt_1 == 3 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L163] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L164] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L165] int Irp__IoStatus__Information ; [L166] int Irp__IoStatus__Status ; [L167] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L168] int disketteExtension__IsRemoved = __VERIFIER_nondet_int() ; [L169] int disketteExtension__IsStarted = __VERIFIER_nondet_int() ; [L170] int disketteExtension__TargetObject = __VERIFIER_nondet_int() ; [L171] int disketteExtension__HoldNewRequests ; [L172] int disketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L173] int disketteExtension__InterfaceString__Buffer = __VERIFIER_nondet_int() ; [L174] int disketteExtension__InterfaceString = __VERIFIER_nondet_int() ; [L175] int disketteExtension__ArcName__Length = __VERIFIER_nondet_int() ; [L176] int disketteExtension__ArcName = __VERIFIER_nondet_int() ; [L177] int irpSp__MinorFunction = __VERIFIER_nondet_int() ; [L178] int IoGetConfigurationInformation__FloppyCount = __VERIFIER_nondet_int() ; [L179] int irpSp ; [L180] int disketteExtension ; [L181] int ntStatus ; [L182] int doneEvent = __VERIFIER_nondet_int() ; [L183] int irpSp___0 ; [L184] int nextIrpSp ; [L185] int nextIrpSp__Control ; [L186] int irpSp___1 ; [L187] int irpSp__Context ; [L188] int irpSp__Control ; [L189] long __cil_tmp29 ; [L190] long __cil_tmp30 ; [L193] ntStatus = 0 [L194] PagingReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L195] COND TRUE PagingReferenceCount == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L198] disketteExtension = DeviceObject__DeviceExtension [L199] irpSp = Irp__Tail__Overlay__CurrentStackLocation VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L200] COND FALSE !(\read(disketteExtension__IsRemoved)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L209] COND FALSE !(irpSp__MinorFunction == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L212] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L238] COND TRUE irpSp__MinorFunction == 5 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L241] COND FALSE !(! disketteExtension__IsStarted) [L257] disketteExtension__HoldNewRequests = 1 [L100] int status ; [L101] int threadHandle = __VERIFIER_nondet_int() ; [L102] int DisketteExtension__PoweringDown = __VERIFIER_nondet_int() ; [L103] int DisketteExtension__ThreadReferenceCount = __VERIFIER_nondet_int() ; [L104] int DisketteExtension__FloppyThread = __VERIFIER_nondet_int() ; [L105] int Irp__IoStatus__Status ; [L106] int Irp__IoStatus__Information ; [L107] int Irp__Tail__Overlay__CurrentStackLocation__Control ; [L108] int ObjAttributes = __VERIFIER_nondet_int() ; [L109] int __cil_tmp12 ; [L110] int __cil_tmp13 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L113] COND FALSE !(DisketteExtension__PoweringDown == 1) [L119] DisketteExtension__ThreadReferenceCount ++ VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L120] COND FALSE !(DisketteExtension__ThreadReferenceCount == 0) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L152] COND TRUE pended == 0 [L153] pended = 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L159] return (259); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L258] ntStatus = FlQueueIrpToThread(Irp, disketteExtension) [L261] __cil_tmp29 = (long )ntStatus VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L262] COND TRUE __cil_tmp29 == 259L [L1035] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1044] COND FALSE !(customIrp == 1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1048] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1055] int tmp_ndt_8; [L1056] tmp_ndt_8 = __VERIFIER_nondet_int() [L1057] COND TRUE tmp_ndt_8 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1063] return (0); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L267] COND TRUE disketteExtension__FloppyThread != 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L270] disketteExtension__FloppyThread = 0 [L271] Irp__IoStatus__Status = 0 [L272] myStatus = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L273] COND TRUE s == NP [L274] s = SKIP1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L281] Irp__CurrentLocation ++ [L282] Irp__Tail__Overlay__CurrentStackLocation ++ [L937] int returnVal2 ; [L938] int compRetStatus1 ; [L939] int lcontext = __VERIFIER_nondet_int() ; [L940] unsigned long __cil_tmp7 ; VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L943] COND FALSE !(\read(compRegistered)) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L956] int tmp_ndt_12; [L957] tmp_ndt_12 = __VERIFIER_nondet_int() [L958] COND TRUE tmp_ndt_12 == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L969] returnVal2 = 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L982] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L986] COND FALSE !(s == MPR1) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L995] COND TRUE s == SKIP1 [L996] s = SKIP2 [L997] lowerDriverReturn = returnVal2 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L1005] return (returnVal2); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=1, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L283] ntStatus = IofCallDriver(disketteExtension__TargetObject, Irp) [L429] PagingReferenceCount -- VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L430] COND TRUE PagingReferenceCount == 0 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L433] return (ntStatus); VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L739] status = FloppyPnp(devobj, pirp) [L749] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L750] COND FALSE !(s == NP) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L757] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L758] COND FALSE !(s == MPR3) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L765] COND TRUE s != UNLOADED VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L766] COND TRUE status != -1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L767] COND FALSE !(s != SKIP2) VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L781] COND TRUE pended == 1 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L782] COND TRUE status != 259 VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] [L64] __VERIFIER_error() VAL [compRegistered=0, customIrp=0, DC=2, DiskController=0, Executive=0, FlConfigCallBack=0, FloppyDiskPeripheral=0, FloppyThread=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MaximumInterfaceType=0, MOUNTDEV_MOUNTED_DEVICE_GUID=0, MPR1=5, MPR3=6, myStatus=0, NP=1, PagingMutex=0, PagingReferenceCount=0, pended=1, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=0, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 421 locations, 41 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 16984 SDtfs, 13228 SDslu, 25141 SDs, 0 SdLazy, 4888 SolverSat, 501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=670occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 3014 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1344 NumberOfCodeBlocks, 1344 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1250 ConstructedInterpolants, 0 QuantifiedInterpolants, 109920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 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...